On similarity of an arbitrary matrix to a block diagonal matrix

Abstract

Let an n x n -matrix A have m < n (m ? 2) different eigenvalues ?j of the algebraic multiplicity ?j (j = 1,..., m). It is proved that there are ?j x ?j-matrices Aj, each of which has a unique eigenvalue ?j, such that A is similar to the block-diagonal matrix ?D = diag (A1,A2,..., Am). I.e. there is an invertible matrix T, such that T-1AT = ?D. Besides, a sharp bound for the number kT := ||T||||T-1|| is derived. As applications of these results we obtain norm estimates for matrix functions non-regular on the convex hull of the spectra. These estimates generalize and refine the previously published results. In addition, a new bound for the spectral variation of matrices is derived. In the appropriate situations it refines the well known bounds.

Perturbation Bounds for Eigenvalues and Determinants of Matrices. A Survey

“…Due to Corollary 23 we have sv A ( Ã) ≤ z 1 (A, q). Additional relevant results can be found in the papers [34,35].…”

“…Theorem 11. Let A, Ã ∈ C n×n , condition (34) hold and X be a solution of (35). Then, with the notation q = A − Ã , one has…”

“…The proof of this theorem is based on the following lemma Lemma 6. Let A, Ã ∈ C n×n , condition (34) hold and X be a solution of (35). If, in addition, q X < 1, (38)…”