SIAM Journal on Matrix Analysis and Applications · 1995 · 78 citations · 7 references
ComputingMathematicsComputational ChemistryComputational GeometryGeometric ModelingDimensionality ReductionMatrix ComputationMatrix StructureMetric GeometryDistance MatricesGraph CompletionMatrix CompletionMolecular Conformation AnalysisStructured Matrix Computation
Motivated by the molecular conformation problem, completions of partial Euclidian distance matrices are studied. It is proved that any partial distance matrix with a chordal graph can be completed to a distance matrix. Given any nonchordal graph G, it is shown that there is a partial distance matrix A with graph G such that A does not admit any distance matrix completions. Finally, the connection between distance matrix completions and positive semidefinite completions is outlined.
7