Rank-preserving diagonal completions of a matrix (Q1085238): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Thomas L. Markham / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Rabe-Rüdiger von Randow / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0024-3795(87)90207-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1964787265 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of tridiagonal matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completing a matrix when certain entries of its inverse are specified / rank | |||
Normal rank |
Latest revision as of 16:49, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rank-preserving diagonal completions of a matrix |
scientific article |
Statements
Rank-preserving diagonal completions of a matrix (English)
0 references
1987
0 references
The authors define the off-diagonal rank of a matrix A to be the smallest integer w such that there exists a \(w\times w\) nonsingular submatrix of A which does not contain any diagonal entries of A, and every \((w+1)\times (w+1)\) submatrix of A is either singular or contains a diagonal entry of A. They also define A to have (a) totally the rank r if A has rank r and all \(r\times r\) submatrices of A are nonsingular, and (b) totally the off-diagonal rank r if it has off-diagonal rank r and all \(r\times r\) submatrices not containing a diagonal entry of A are nonsingular. The main result of the paper is: if A is \(n\times n\) and has totally the off- diagonal rank r, where \(n\geq 3r\) and (n,r)\(\neq (3,1)\), then it is possible to adjust the diagonal entries of A in such a way that the resulting matrix has totally the rank r.
0 references
rank-preserving diagonal completions
0 references
off-diagonal rank
0 references