The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
DOI10.1137/0610028zbMATH Open0726.05054OpenAlexW2075931151MaRDI QIDQ3348009FDOQ3348009
Authors: J. William Helton, Stephen J. Pierce, Leiba Rodman 
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cited In (19)
- Do sums of squares dream of free resolutions?
- Graphs with sparsity order at most two: the complex case
- One-step completions of Hermitian partial matrices with minimal negative signature
- Extremal rays and duals for cones of positive definite matrices with prescribed zeros
- Extreme rays and faces for the cone of class functions non-negative on the set of Gram matrices
- Extermal positive semidefinite matrices with given sparsity pattern
- Nonchordal positive semidefinite stochastic matrices∗
- More on extremal positive semidefinite doubly stochastic matrices
- Minimal separators of 2-chordal graphs
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- Research problem: The completion number of a graph
- Extremal correlation matrices
- Hereditary properties of matrices with cut-points
- Positive semidefinite matrices with a given sparsity pattern
- The positive definite completion problem revisited
- On the sparsity order of a graph and its deficiency in chordality
- Extremal bipartite matrices
- Positive semidefinite rank and nested spectrahedra
- Extremal positive semidefinite doubly stochastic matrices
This page was built for publication: The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348009)
