The Minimum Rank of a 3 × 3 Partial Block Matrix

The Minimum Rank of a 3 × 3 Partial Block Matrix
复制标题

DOI:
10.1080/03081080290019531
复制
发表时间:
2002-01
影响因子:
1.1
通讯作者:
Yongge Tian
Yongge Tian
中科院分区:
数学3区
文献类型:
--
作者:
Yongge Tian

文献摘要

被引文献

相似文献

The minimum rank of the 3 × 3 partial block matrix $$ \left[ {\matrix{ {A_{11} } & {A_{12} } & ? \cr {A_{21} } & ? & {A_{23} } \cr ? & {A_{32} } & {A_{33} } \cr } } \right]$$ is determined when A ij (1 h i , j h 3) are all nonsingular matrices of the same size. This solves partially a problem that was proposed in [N. Cohen, C.R. Johnson, L. Rodman and H.J. Woerdeman (1989). Ranks of completions of partial matrices. Operator Theory: Advances and Applications , 40 , 165-185.].