Convex combinations of matrices -- full rank characterization (Q1301303): Difference between revisions
From MaRDI portal
Latest revision as of 22:17, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convex combinations of matrices -- full rank characterization |
scientific article |
Statements
Convex combinations of matrices -- full rank characterization (English)
0 references
14 February 2000
0 references
The authors give a determinant condition which is necessary and sufficient in order that every convex combination of a set of \(n\times m\) complex matrices \(A_1,\dots,A_{k}\) has rank \(n\). The condition is too complicated to state here, but it involves checking that the determinant of a \((k-1)kn\times(k-1)kn\) matrix in \(k\) variables is never equal to \(0\).
0 references
convex combinations of matrices
0 references
full rank characterization
0 references
determinant condition
0 references
complex matrices
0 references