Solution of the embedding problem and decomposition of symmetric matrices.
From MaRDI portal
Publication:3692713
DOI10.1073/pnas.82.8.2197zbMath0574.65038WikidataQ37683767 ScholiaQ37683767MaRDI QIDQ3692713
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
numerical example; quadratic forms; Cholesky factorization; distance geometry; matrix factorization; embedding of distances
15B57: Hermitian, skew-Hermitian, and related matrices
65F35: Numerical computation of matrix norms, conditioning, scaling
51K05: General theory of distance geometry
15A63: Quadratic and bilinear forms, inner products
Related Items
An algorithm for realizing Euclidean distance matrices, Rigid versus unique determination of protein structures with geometric buildup, 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