Realizing Euclidean distance matrices by sphere intersection (Q1728090)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Realizing Euclidean distance matrices by sphere intersection |
scientific article; zbMATH DE number 7027409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Realizing Euclidean distance matrices by sphere intersection |
scientific article; zbMATH DE number 7027409 |
Statements
Realizing Euclidean distance matrices by sphere intersection (English)
0 references
21 February 2019
0 references
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.
0 references
distance geometry
0 references
sphere intersection
0 references
Euclidean distance matrix
0 references
embedding dimension
0 references
0 references
0 references
0 references
0.9181332
0 references
0.9119296
0 references
0.90419304
0 references
0 references
0.8912052
0 references
0.8865665
0 references
0.87653655
0 references
0.87253296
0 references
0.87045014
0 references
0.86945087
0 references
