A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268): Difference between revisions

The results obtained for positive semidefinite (PSD) and Euclidean distance (ED) matrix completion problems are very similar. Even though there is a strong relationship between the PSD matrices and ED matrices, it was not clear how to link the two completion problems. The authors show that the results concerning the ED matrix completion problem can be derived from those concerning the PSD completion problem using the functional transform introduced by \textit{I. J. Schoenberg} [Trans. Am. Math. Soc. 44, 522-536 (1938; Zbl 0019.41502)]. The authors also introduce a new set of necessary conditions for the two completion problems. Although these conditions are stronger than some previously known ones, they have not been able to characterise the elliptope or the ED matrix cone for larger classes of graphs.