Realizing Euclidean distance matrices by sphere intersection
From MaRDI portal
This paper presents properties of an algorithm for finding a realization of a Euclidean distance matrix, in the smallest embedding dimension. The algorithm performs linearly in $n$ (the number of rows and column of the input matrix) and quadratically in the minimum embedding dimension.
Recommendations
- Multispherical Euclidean distance matrices
- On Euclidean distances and sphere representations
- An algorithm for realizing Euclidean distance matrices
- On Euclidean distance matrices
- On unit spherical Euclidean distance matrices which differ in one entry
- Euclidean distance matrices and applications
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Generalized Euclidean distance matrices
- Euclidean distance matrices: new characterization and boundary properties
- On the eigenvalues of Euclidean distance matrices
Cites work
- A note on computing the intersection of spheres in \(\mathbb{R}^n\)
- An algorithm for realizing Euclidean distance matrices
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Euclidean distance geometry and applications
- Fast linear algebra is stable
- Multidimensional scaling.
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Open research areas in distance geometry
- Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Solution of the embedding problem and decomposition of symmetric matrices.
- The discretizable distance geometry problem
- The discretizable molecular distance geometry problem
Cited in
(14)- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
- NMR protein structure calculation and sphere intersections
- A remark on global positioning from local distances
- An algorithm for realizing Euclidean distance matrices
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Solution of the embedding problem and decomposition of symmetric matrices.
- The isomap algorithm in distance geometry
- A note on computing the intersection of spheres in \(\mathbb{R}^n\)
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Distance shrinkage and Euclidean embedding via regularized kernel estimation
- Geometric algebra and distance matrices
- An impossible combinatorial counting method in distance geometry
- On the local and global minimizers of the smooth stress function in Euclidean distance matrix problems
This page was built for publication: Realizing Euclidean distance matrices by sphere intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1728090)
