On the uniqueness of Euclidean distance matrix completions.

DOI10.1016/S0024-3795(02)00737-1zbMath1036.15012MaRDI QIDQ1405021

Abdo Y. Alfakih

Publication date: 25 August 2003

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

zbMATH Keywords

convex setsmatrix completion problemEuclidean distance matrixGale transformssingleton setssymmetric partial matrix

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48) General theory of distance geometry (51K05) Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Gale and other diagrams (52B35)

Related Items (6)

Uniqueness of the solutions of some completion problems ⋮ Euclidean distance matrix completion problems ⋮ Phase retrieval of complex and vector-valued functions ⋮ On the uniqueness of Euclidean distance matrix completions: the case of points in general position ⋮ A variance inequality ensuring that a pre-distance matrix is Euclidean ⋮ Euclidean Distance Matrices and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• Properties of Euclidean and non-Euclidean distance matrices
• On certain linear mappings between inner-product and squared-distance matrices
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Distance matrix completion by numerical optimization
• Distance geometry optimization for protein structures
• Graph rigidity via Euclidean distance matrices
• The cone of distance matrices
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
• The Euclidian Distance Matrix Completion Problem
• The Euclidean distance completion problem: cycle completability
• The Molecule Problem: Exploiting Structure in Global Optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications
• On rigidity and realizability of weighted graphs

This page was built for publication: On the uniqueness of Euclidean distance matrix completions.