论文信息 - The block lower bounds for the smallest singular value

The block lower bounds for the smallest singular value

In this article, we use block matrix technique to give further lower bounds for the smallest singular value of a general complex matrix. In addition, we prove that the smallest singular value of A is no less than that of the block comparison matrix of A under suitable conditions. Finally, some examples are given.

Chuan-Long Wang | Shan-Jun Zhang

[1] Charles R. Johnson. A Gersgorin-type lower bound for the smallest singular value , 1989 .

[2] Charles R. Johnson,et al. Further lower bounds for the smallest singular value , 1998 .

[3] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4] Lin Jia-hao,et al. Computational structural mechanics and optimal control—the simulation of substructural chain theory to linear quadratic optimal control problems† , 1992 .

[5] Liqun Qi,et al. Some Simple Estimates for Singular Values of a Matrix , 1984 .

[6] J. Varah. A lower bound for the smallest singular value of a matrix , 1975 .

[7] R. Varga,et al. Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem , 1962 .