Positive semidefinite completions of partial Hermitian matrices

DOI10.1016/0024-3795(92)90304-SMaRDI QIDQ1200554zbMATH OpenFDO

Authors Jerome Dancis

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0024-3795(92)90304-S

zbMATH Keywords

chordal graphpartial Hermitian matrixpositive semidefinite completionsranks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Hermitian, skew-Hermitian, and related matrices (15B57)

Review text

A partial Hermitian matrix is a matrix in which some entries are specified such that \(a_{ij}^*=a_{ji}\) among the specified entries, and others are left as free variables. The author explores the possible ranks of positive semidefinite completions of partial Hermitian matrices whose associated graph is chordal. Completing a partially specified matrix means filling in the unspecified entries.

Recommendations

• Inertia possibilities for completions of partial hermitian matrices^*
• scientific article; zbMATH DE number 4142224
• Positive definite completions of partial Hermitian matrices
• Maximal rank Hermitian completions of partially specified Hermitian matrices.
• The real positive semidefinite completion problem for series-parallel graphs

Cites work

• Bordered matrices
• Extensions of band matrices with band inverses
• Inertia possibilities for completions of partial hermitian matrices^*
• Invertible completions of band matrices
• Invertible Selfadjoint Extensions of Band Matrices and Their Entropy
• On the inertias of symmetric matrices and bounded self-adjoint operators
• Positive definite completions of partial Hermitian matrices
• Rank-preserving extensions of band matrices

Cited in

(18)

• The positive semidefiniteness of partitioned matrices
• Superoptimal completions of triangular matrices
• Maximal rank Hermitian completions of partially specified Hermitian matrices.
• Solutions to 18 constrained optimization problems on the rank and inertia of the linear matrix function
• The truncated Hamburger moment problems with gaps in the index set
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
• The truncated moment problem on the union of parallel lines
• Symmetric completions of cycles and bipartite graphs
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
• Inertia possibilities for completions of partial hermitian matrices^*
• scientific article; zbMATH DE number 1894414 (Why is no real title available?)
• The truncated moment problem on reducible cubic curves. I: Parabolic and circular type relations
• Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
• Complexity of chordal conversion for sparse semidefinite programs with small treewidth
• Ranks and inertias of Hermitian block Toeplitz matrices
• Semidefinite programming for discrete optimization and matrix completion problems
• Finite-rank kernel realization and completion
• Positive definite completions of partial Hermitian matrices

This page was built for publication: Positive semidefinite completions of partial Hermitian matrices

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