AbstractSuppose A is an n-by-n matrix over a field F. We prove that it is possible to complete the diagonal entries of A so that the resulting rank of A is as small as possible when n⩾3r, where r is the “off-diagonal rank” of A and (n,r)≠(3,1)
AbstractLet A, B be n × n matrices with entries in a field F. Our purpose is to show the following t...
AbstractThe structure-rank of a matrix is the largest rank of a submatrix which lies within a specif...
AbstractAnalogues of characterizations of rank-preserving operators on field-valued matrices are det...
AbstractSuppose A is an n-by-n matrix over a field F. We prove that it is possible to complete the d...
AbstractIn this paper, we establish necessary and sufficient conditions for a minimal rank completio...
AbstractThe structure rank of a matrix, i.e. the maximum order of a nonsingular submatrix all of who...
AbstractIn this note it is shown that, for a given partially specified hermitian matrix P, the maxim...
AbstractFiedler proved in [Linear Algebra Appl. 2 (1969) 191–197] that the set of real n-by-n symmet...
AbstractA complete solution of the matrix completion problemA??B−1=?CD?is obtained in terms of solut...
AbstractIn this paper, we establish necessary and sufficient conditions for a minimal rank completio...
We investigate the problem of completing partial matrices to rank-one matrices in the standard simpl...
AbstractIt is proved that a linear transformation on the vector space of upper triangular matrices t...
Given are tight upper and lower bounds for the minimum rank among all matrices with a prescribed ze...
AbstractA partial matrix over a field F is a matrix whose entries are either elements of F or indepe...
Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact...
AbstractLet A, B be n × n matrices with entries in a field F. Our purpose is to show the following t...
AbstractThe structure-rank of a matrix is the largest rank of a submatrix which lies within a specif...
AbstractAnalogues of characterizations of rank-preserving operators on field-valued matrices are det...
AbstractSuppose A is an n-by-n matrix over a field F. We prove that it is possible to complete the d...
AbstractIn this paper, we establish necessary and sufficient conditions for a minimal rank completio...
AbstractThe structure rank of a matrix, i.e. the maximum order of a nonsingular submatrix all of who...
AbstractIn this note it is shown that, for a given partially specified hermitian matrix P, the maxim...
AbstractFiedler proved in [Linear Algebra Appl. 2 (1969) 191–197] that the set of real n-by-n symmet...
AbstractA complete solution of the matrix completion problemA??B−1=?CD?is obtained in terms of solut...
AbstractIn this paper, we establish necessary and sufficient conditions for a minimal rank completio...
We investigate the problem of completing partial matrices to rank-one matrices in the standard simpl...
AbstractIt is proved that a linear transformation on the vector space of upper triangular matrices t...
Given are tight upper and lower bounds for the minimum rank among all matrices with a prescribed ze...
AbstractA partial matrix over a field F is a matrix whose entries are either elements of F or indepe...
Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact...
AbstractLet A, B be n × n matrices with entries in a field F. Our purpose is to show the following t...
AbstractThe structure-rank of a matrix is the largest rank of a submatrix which lies within a specif...
AbstractAnalogues of characterizations of rank-preserving operators on field-valued matrices are det...
DOI
Add to ORKG