Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices

DOI10.1137/S0895479890189833zbMath0796.05065OpenAlexW2013793368MaRDI QIDQ4287912

Daniel Lam, J. William Helton, Hugo J. Woerdeman

Publication date: 15 September 1994

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479890189833

zbMATH Keywords

positive semidefinite matricesorthogonal representationsparsity graph

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (2)

Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors ⋮ Research problem: The completion number of a graph

This page was built for publication: Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices