论文信息 - Minimal rank completions for block matrices

Minimal rank completions for block matrices

Abstract This paper deals with the following problem of completion of block matrices. Let Aij, i ⩾ j, be given matrices. Find additional matrices Aij such that the completion A = (Aij)ni, j = 1 has lowest possible rank. The structure of the set of all minimal rank completions is studied. Special attention is paid to the Toeplitz case together with its connection to the partial realization problem.

Hugo J. Woerdeman | H. Woerdeman

[1] R. E. Kalman,et al. On minimal partial realizations of a linear input/output map , 1971 .

[2] Israel Gohberg,et al. On minimality in the partial realization problem , 1987 .

[3] M. A. Kaashoek,et al. Minimal representations of semiseparable kernels and systems with separable boundary conditions , 1987 .

[4] O. Bosgra,et al. On parametrizations for the minimal partial realization problem , 1983 .

[5] M. A. Kaashoek,et al. Unique minimal rank extensions of triangular operators , 1988 .

[6] G. Peeters. Construction and classification of minimal representations of semi-separable kernels , 1989 .

[7] Hugo J. Woerdeman,et al. The lower order of lower triangular operators and minimal rank extensions , 1987 .