The positive definite completion problem relative to a subspace

DOI10.1016/S0024-3795(99)00246-3zbMath0994.15014MaRDI QIDQ1973913

Ronald L. Smith, Charles R. Johnson

Publication date: 10 October 2002

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

zbMATH Keywords

quadratic formcompletionpartial matrixchordal graphdistance matrixchordal patternspartial positive definite

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29)

Related Items (2)

Conditional quadratic semidefinite programming: examples and methods ⋮ Graph theoretic methods for matrix completion problems

Cites Work

• Positive definite completions of partial Hermitian matrices
• Definiteness and semidefiniteness of quadratic forms revisited
• Olga, matrix theory and the Taussky unification problem
• The Euclidian Distance Matrix Completion Problem
• Metric Spaces and Positive Definite Functions

This page was built for publication: The positive definite completion problem relative to a subspace