The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern

DOI10.1137/0610028zbMath0726.05054OpenAlexW2075931151MaRDI QIDQ3348009

J. William Helton, Leiba Rodman, Stephen J. Pierce

Publication date: 1989

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

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

zbMATH Keywords

extremal matrixorder of a 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

Minimal separators of 2-chordal graphs ⋮ Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors ⋮ Extermal positive semidefinite matrices with given sparsity pattern ⋮ Nonchordal positive semidefinite stochastic matrices^∗ ⋮ Do Sums of Squares Dream of Free Resolutions? ⋮ Graphs with sparsity order at most two: the complex case ⋮ More on extremal positive semidefinite doubly stochastic matrices ⋮ The positive definite completion problem revisited ⋮ One-step completions of Hermitian partial matrices with minimal negative signature ⋮ Research problem: The completion number of a graph ⋮ Extremal bipartite matrices ⋮ Hereditary properties of matrices with cut-points ⋮ Extremal positive semidefinite doubly stochastic matrices