Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems (Q1810881)
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: Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems |
scientific article; zbMATH DE number 1924956
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems |
scientific article; zbMATH DE number 1924956 |
Statements
Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems (English)
0 references
9 June 2003
0 references
This paper gives a variety of results on the Euclidean distance matrix completion problem, which is, if some entries of an \(n\times n\) matrix are specified, when can the rest of the matrix be filled in such that it is a matrix of distances between \(n\) points in some Euclidean space, and the related problem of completing a positive semidefinite (partial) matrix.
0 references
Euclidean distance geometry
0 references
Euclidean distance matrix completion
0 references
positive semidefinite matrix completion
0 references
