Abstract
A solution of the problem of calculating cartesian coordinates from a matrix of interpoint distances (the embedding problem) is reported. An efficient and numerically stable algorithm for the transformation of distances to coordinates is then obtained. It is shown that the embedding problem is intimately related to the theory of symmetric matrices, since every symmetric matrix is related to a general distance matrix by a one-to-one transformation. Embedding of a distance matrix yields a decomposition of the associated symmetric matrix in the form of a sum over outer products of a linear independent system of coordinate vectors. It is shown that such a decomposition exists for every symmetric matrix and that it is numerically stable. From this decomposition, the rank and the numbers of positive, negative, and zero eigenvalues of the symmetric matrix are obtained directly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the National Academy of Sciences of the United States of America
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
