The real positive definite completion problem: cycle completability

DOI10.1090/MEMO/0584MaRDI QIDQ4890859zbMATH OpenOpenAlexFDO

Authors Charles R. Johnson, Raphael Loewy, Wayne 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

cycle conditionspositive semidefinite completionpositive semidefinite matrix

Mathematics Subject Classification ID

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

Recommendations

• The real positive definite completion problem for a simple cycle
• The real positive definite completion problem for a 4-cycle
• The positive definite completion problem revisited
• scientific article; zbMATH DE number 2202148
• The cycle completable graphs for the completely positive and doubly nonnegative completion problems
• The positive definite completion problem relative to a subspace
• The completely positive and doubly nonnegative completion problems
• The totally positive completion problem
• Paths and Cycles in the Totally Positive Completion Problem

Cited in

(28)

• Structural conditions for cycle completable graphs
• Olga, matrix theory and the Taussky unification problem
• Matrix sandwich problems
• The real positive definite completion problem for a simple cycle
• Cuts, matrix completions and graph rigidity
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• A parameterization of positive definite matrices in terms of partial correlation vines
• The cycle completable graphs for the completely positive and doubly nonnegative completion problems
• Connections between the real positive semidefinite and distance matrix completion problems
• Semidefiniteness without real symmetry
• Symmetric completions of cycles and bipartite graphs
• An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
• Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
• Complexity of the positive semidefinite matrix completion problem with a rank constraint
• Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
• Groups acting on Gaussian graphical models
• Geometry of maximum likelihood estimation in Gaussian graphical models
• Sums of squares and sparse semidefinite programming
• scientific article; zbMATH DE number 2202148 (Why is no real title available?)
• 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
• On Sidorenko's conjecture for determinants and Gaussian Markov random fields
• Characterizing and generalizing cycle completable graphs
• The real positive semidefinite completion problem for series-parallel graphs
• Lectures on nonnegative polynomials and sums of squares
• Extremal rays and duals for cones of positive definite matrices with prescribed zeros
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming

This page was built for publication: The real positive definite completion problem: cycle completability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4890859)