论文信息 - Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals

Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals

We obtain necessary and sufficient conditions for the existence and the uniqueness of rank-one completions of a partial matrix, and we verify a conjecture of Hadwin and Larson concerning the nature of completely rank-nonincreasing linear functionals defined on pattern subspaces.

J. A. Ward | K. J. Harrison | Don Hadwin | D. Hadwin | K. Harrison

[1] Leiba Rodman,et al. Ranks of Completions of Partial Matrices , 1989 .

[2] D. Larson,et al. Completely rank-nonincreasing linear maps☆ , 2003 .

[3] J. Hou,et al. Completely rank nonincreasing linear maps on nest algebras , 2003 .

[4] K. J. Harrison,et al. Matrix Completions and Chordal Graphs , 2003 .

[5] C. Richard Johnson,et al. Matrix Completion Problems: A Survey , 1990 .

[6] V. Olshevsky. Structured Matrices in Mathematics, Computer Science, and Engineering II , 2001 .

[7] M. Laurent. A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems , 1998 .

[8] L. Hogben. Graph theoretic methods for matrix completion problems , 2001 .