Convex combinations of matrices -- full rank characterization

DOI10.1016/S0024-3795(98)10136-2zbMath0942.15001MaRDI QIDQ1301303

Barbara Kołodziejczak, Tomasz Szulc

Publication date: 14 February 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

complex matricesconvex combinations of matricesdeterminant conditionfull rank characterization

Mathematics Subject Classification ID

Algebraic systems of matrices (15A30) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

A practical test for assessing the reachability of discrete-time Takagi-Sugeno fuzzy systems ⋮ Flight evaluation of a sliding mode online control allocation scheme for fault tolerant control ⋮ Comments on ‘Less conservative conditions for robust LQR-state-derivative controller design: an LMI approach’ and new sufficient LMI conditions for invertibility of a convex combination of matrices ⋮ Unnamed Item ⋮ Robust unknown input observer for state and fault estimation in discrete-time Takagi–Sugeno systems ⋮ Set-membership parity space hybrid system diagnosis ⋮ A characterization of convex cones of matrices with constant regular inertia ⋮ On Some Properties of Convex Matrix Sets Characterized byP-Matrices and BlockP-Matrices ⋮ Less conservative conditions for robust LQR-state-derivative controller design: an LMI approach

Cites Work

• Block eigenvalues of block compound matrices
• Rank of convex combinations of matrices
• Matrix Analysis
• Block P-matrices
• Convex combinations of matrices-nonsingularity and schur stability characterizations
• Convex sets of nonsingular and P:–Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item