Uniqueness of the solutions of some completion problems (Q1887497): Difference between revisions

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.