论文信息 - Convex combinations of matrices — Full rank characterization

Convex combinations of matrices — Full rank characterization

Abstract Let A 1 ,…, A k be complex n -by- m matrices. Using the notion of a block P -matrix, introduced recently by Elsner and the second author, a characterization of the full rank property of all convex combinations of A 1 ,…, A k is derived.

Tomasz Szulc | Barbara Kolodziejczak | T. Szulc | B. Kolodziejczak

[1] Ludwig Elsner,et al. Convex combinations of matrices-nonsingularity and schur stability characterizations , 1998 .

[2] Gene H. Golub,et al. Matrix computations , 1983 .

[3] Charles R. Johnson,et al. Convex sets of nonsingular and P:–Matrices , 1995 .

[4] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .

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

[6] J. Victória. Block Eigenvalues of block compound matrices , 1982 .

[7] Calyampudi R. Rao,et al. Linear Statistical Inference and Its Applications. , 1975 .

[8] W. D. Ray. Matrices in control theory , 1984 .

[9] Ludwig Elsner,et al. Block P-matrices , 1998 .

[10] Tomasz Szulc. Rank of convex combinations of matrices , 1996, Reliab. Comput..