For a complex matrix A, the well-known Levy-Desplanques theorem states that A is nonsingular if for all i. The equivalent Gershgorin theorem on the localization of eigenvalues implies that the eigenvalues of A must satisfy Taussky extended this by showing that A is nonsingular if A is irreducible and with the inequality strict for at least one i. A goal of this paper is to give lower bounds on ** **for this case as well. We give bounds which depend on the diameter and the algebraic connectivity of the graph of A.

We also study bounds for reducible matrices by introducing the notion of m-reducibility. In particular, we give bounds for reducible matrices which depends on the algebraic connectivity of the strongly connected components of the graph and the number of edges between them. These bounds are also applicable to bound the subdominant eigenvalues of reducible stochastic matrices and Laplacian matrices of directed graphs.

By:* Chai Wah Wu*

Published in: Linear Algebra and Its Applications, volume 402, (no ), pages 29-45 in 2005

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .