Uniqueness of the solutions of some completion problems (Q1887497): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Thomas Milligan / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Nicholas P. Karampetakis / rank | |||
Normal rank | |||
Revision as of 01:59, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniqueness of the solutions of some completion problems |
scientific article |
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
