Title of article :
On the uniqueness of Euclidean distance matrix completions
Author/Authors :
Abdo Y. Alfakih، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
The Euclidean distance matrix completion problem (EDMCP) is the problem of determining whether or not a given partial matrix can be completed into a Euclidean distance matrix. In this paper, we present necessary and sufficient conditions for a given solution of the EDMCP to be unique.
Keywords :
Singleton sets , Euclidean distance matrices , Gale transform , Matrix completion problems , Convexsets , Semidefinite matrices
Journal title :
Linear Algebra and its Applications
Journal title :
Linear Algebra and its Applications
