The real positive definite completion problem for a 4-cycle

DOI10.1016/S0024-3795(01)00317-2MaRDI QIDQ5954849zbMATH OpenOpenAlexFDO

Authors Mohammad Othman Omran, Wayne Barrett

Publication date 23 February 2003

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0024-3795(01)00317-2

zbMATH Keywords

4-cyclematrix completion problemnonchordal graphpartial matrixpositive definite completion problemsingular pointstwo specified entries

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29)

Review text

Previous works on the positive semidefinite (PSD) completion problem [cf. for example \textit{W. W. Barrett}, Mem. Am. Math. Soc. 584, 69 p. (1996; Zbl 0857.05068)] focused with determining the existence of a PSD completion of a given partial matrix, examining characteristics of the graph of the matrix. The present paper is concerned with describing the set of all PSD completions of a given partial matrix. The cases considered are quite general and the matrices have several dimensions.

Recommendations

• The real positive definite completion problem for a simple cycle
• The real positive definite completion problem: cycle completability
• The positive definite completion problem revisited
• The positive definite completion problem relative to a subspace
• Positive definite completions and determinant maximization
• scientific article; zbMATH DE number 2202148
• Some extremal results on 4-cycles
• scientific article; zbMATH DE number 1894414
• Completeness of S4 with respect to the real line: revisited
• Complementary results on the boundedness problem of factorizable four-dimensional matrices

Cites work

• scientific article; zbMATH DE number 4158856 (Why is no real title available?)
• scientific article; zbMATH DE number 3288410 (Why is no real title available?)
• Positive definite completions of partial Hermitian matrices
• Rank inequalities for positive semidefinite matrices
• The real positive definite completion problem for a simple cycle
• The real positive definite completion problem: cycle completability

Cited in

(6)

• The real positive definite completion problem for a simple cycle
• Null spaces of correlation matrices
• The real positive definite completion problem: cycle completability
• EXTENSION OF BLOCK MATRIX REPRESENTATION OF THE GEOMETRIC MEAN
• The real positive semidefinite completion problem for series-parallel graphs
• The positive definite completion problem revisited

This page was built for publication: The real positive definite completion problem for a 4-cycle

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