Connections between the real positive semidefinite and distance matrix completion problems Original Research Article

Though the real symmetric positive semidefinite (PSD) matrices and the Euclidean distance matrices are closely related, exact relationships between the corresponding completion problems are not apparent. We establish strong partial relationships of two types. This permits the transfer of some insights from one problem to the other and allows computational tools for the PSD problem to be used for the distance problem.