An algorithm for realizing Euclidean distance matrices
From MaRDI portal
Publication:324865
Recommendations
- Realizing Euclidean distance matrices by sphere intersection
- The isomap algorithm in distance geometry
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- The cone of distance matrices
Cites work
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Equality relating Euclidean distance cone to positive semidefinite cone
- Euclidean distance geometry and applications
- Global Continuation for Distance Geometry Problems
- On generating instances for the modular distance geometry problem
- Problems of distance geometry and convex properties of quadratic maps
- Solution of the embedding problem and decomposition of symmetric matrices.
Cited in
(7)- Distance shrinkage and Euclidean embedding via regularized kernel estimation
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Geometric algebra and distance matrices
- A genetic algorithm for circulant Euclidean distance matrices
- Realizing Euclidean distance matrices by sphere intersection
- An algorithm for the computation of the Hutchinson distance
- Generalized Euclidean distance matrices
This page was built for publication: An algorithm for realizing Euclidean distance matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324865)