Completing triangular block matrices with maximal and minimal ranks (Q1595160): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q703629 |
||
Property / reviewed by | |||
Property / reviewed by: Takayuki Nôno / rank | |||
Revision as of 10:38, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Completing triangular block matrices with maximal and minimal ranks |
scientific article |
Statements
Completing triangular block matrices with maximal and minimal ranks (English)
0 references
7 May 2002
0 references
The author considers two completion problems on block matrices with maximal and minimal ranks: For \(A=(A_{ij})\) an \(n\times n\) block matrix, where \(A_{ij}\) \((n\geq i\geq j\geq 1)\) is given, and \(A_{ij}\) \((1\leq i<j \leq n)\) is a variant block entity, determine all these variant block entries such that \(A=(A_{ij})\) has maximal and minimal possible rank, respectively. By using the theory of generalized inverses of matrices, the author presents complete solutions to these two problems. As applications he also determines maximal and minimal ranks of the matrix expression \(A-B\times C\) when \(X\) is a variant triangular block matrix, then presents a necessary and sufficient condition for the matrix equation \(B\times C=A\) to have a triangular block solution.
0 references
matrix completion
0 references
block matrices
0 references
maximal and minimal ranks
0 references
generalized inverses
0 references
matrix equation
0 references