Uniqueness of the solutions of some completion problems (Q1887497)
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: Uniqueness of the solutions of some completion problems |
scientific article; zbMATH DE number 2119130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniqueness of the solutions of some completion problems |
scientific article; zbMATH DE number 2119130 |
Statements
Uniqueness of the solutions of some completion problems (English)
0 references
26 November 2004
0 references
The authors determine conditions for uniqueness of the solutions of several completion problems (positive semi-definite completion, distance matrix completion, contractive matrix completion), that depend on the existence of a positive semi-definite matrix satisfying certain linear constraints. An algorithm is given to check these conditions numerically. The theory is illustrated via several numerical examples.
0 references
completion problems
0 references
positive semi-definite matrix
0 references
Euclidean square distance matrix
0 references
contractive matrix
0 references
semi-definite programming
0 references
algorithm
0 references
numerical examples
0 references
0.8110975623130798
0 references
0.8051628470420837
0 references
0.7935263514518738
0 references
