The Euclidian Distance Matrix Completion Problem

DOI10.1137/S0895479893249757zbMath0823.15012OpenAlexW1985806186MaRDI QIDQ4835417

Charles R. Johnson, Mihály Bakonyi

Publication date: 5 November 1995

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479893249757

zbMATH Keywords

chordal graphundirected graphpositive semidefinite completioncompletion of partial Euclidean distance matricesdistance matrix completionsmolecular mapping problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Canonical forms, reductions, classification (15A21)

Related Items (25)

Matrix completions for linear matrix equations ⋮ Euclidean distance matrix completion problems ⋮ A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ Connections between the real positive semidefinite and distance matrix completion problems ⋮ Decomposition Methods for Sparse Matrix Nearness Problems ⋮ Cuts, matrix completions and graph rigidity ⋮ Sensor network localization, Euclidean distance matrix completions, and graph realization ⋮ A connection between positive semidefinite and Euclidean distance matrix completion problems ⋮ Structural conditions for cycle completable graphs ⋮ Central limit theorems for classical multidimensional scaling ⋮ On the uniqueness of Euclidean distance matrix completions. ⋮ The elliptic matrix completion problem ⋮ Matrix completions and chordal graphs ⋮ The positive definite completion problem relative to a subspace ⋮ On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Molecular conformation search by distance matrix perturbations ⋮ On the uniqueness of Euclidean distance matrix completions: the case of points in general position ⋮ Euclidean distance matrices, semidefinite programming and sensor network localization ⋮ Euclidean Distance Matrices and Applications ⋮ Positive definite completions and determinant maximization ⋮ Matrix estimation by universal singular value thresholding ⋮ Matrix sandwich problems ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices

This page was built for publication: The Euclidian Distance Matrix Completion Problem