The real positive definite completion problem: cycle completability

DOI10.1090/MEMO/0584zbMATH Open0857.05068OpenAlexW2145171684MaRDI QIDQ4890859FDOQ4890859

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

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

zbMATH Keywords

positive semidefinite matrixcycle conditionspositive semidefinite completion

Mathematics Subject Classification ID

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

Cited In (27)

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

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)