Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems (Q1810881): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Kim Hang Kim / rank | |||
Property / reviewed by | |||
Property / reviewed by: Kim Hang Kim / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:47, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems |
scientific article |
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