The real positive definite completion problem: cycle completability

DOI10.1090/memo/0584zbMath0857.05068OpenAlexW2145171684MaRDI QIDQ4890859

Raphael Loewy, Charles R. Johnson, Wayne W. Barrett

Publication date: 26 February 1997

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/memo/0584

zbMATH Keywords

positive semidefinite matrixcycle conditionspositive semidefinite completion

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Structural characterization of families of graphs (05C75)

Related Items

Connections between the real positive semidefinite and distance matrix completion problems, Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry, Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors, Extremal rays and duals for cones of positive definite matrices with prescribed zeros, Cuts, matrix completions and graph rigidity, A connection between positive semidefinite and Euclidean distance matrix completion problems, Structural conditions for cycle completable graphs, Groups acting on Gaussian graphical models, On Sidorenko's conjecture for determinants and Gaussian Markov random fields, Characterizing and generalizing cycle completable graphs, A parameterization of positive definite matrices in terms of partial correlation vines, An efficient algorithm for maximum entropy extension of block-circulant covariance matrices, Geometry of maximum likelihood estimation in Gaussian graphical models, Semidefiniteness without real symmetry, Symmetric completions of cycles and bipartite graphs, The real positive semidefinite completion problem for series-parallel graphs, Sums of Squares and Sparse Semidefinite Programming, Singularity Degree of the Positive Semidefinite Matrix Completion Problem, Complete positivity of matrices of special form, The real positive definite completion problem for a 4-cycle, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, The cycle completable graphs for the completely positive and doubly nonnegative completion problems, Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint, Olga, matrix theory and the Taussky unification problem, Matrix sandwich problems