Solution of the embedding problem and decomposition of symmetric matrices.

DOI10.1073/PNAS.82.8.2197MaRDI QIDQ3692713zbMATH OpenOpenAlexWikidataFDO

Authors Manfred J. Sippl, Harold A. Scheraga

Publication date 1985

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.82.8.2197

zbMATH Keywords

Cholesky factorizationdistance geometryembedding of distancesmatrix factorizationnumerical examplequadratic forms

Mathematics Subject Classification ID

Quadratic and bilinear forms, inner products (15A63) Hermitian, skew-Hermitian, and related matrices (15B57) General theory of distance geometry (51K05) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Realizing Euclidean distance matrices by sphere intersection
• The cone of distance matrices
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• A remark on global positioning from local distances
• The embedding problem for predistance matrices

Cited in

(8)

• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
• Calculation of coordinates from incomplete and incorrect distance data
• Realizing Euclidean distance matrices by sphere intersection
• Solving symmetric matrix word equations via symmetric space machinery
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• An algorithm for realizing Euclidean distance matrices
• scientific article; zbMATH DE number 3935230 (Why is no real title available?)
• Rigid versus unique determination of protein structures with geometric buildup

This page was built for publication: Solution of the embedding problem and decomposition of symmetric matrices.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692713)