On the Maximum Eigenvalue of a Reducible Non-Negative Real Matrix.
Lower bounds on the smallest eigenvalue of a symmetric positive definite matrix play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the bounds based on and have attracted attention recently, because they can be computed in operations when is tridiagonal. In this paper, we focus on these bounds and investigate their properties in detail. First, we consider the problem of finding the optimal bound that can be computed...
Let A be a complex n × n matrix. Let A' be its commutant in Mₙ(ℂ), and C(A) be its centralizer in GL(n,ℂ). Consider the standard C(A)-action on ℂⁿ. We describe the C(A)-orbits via invariant subspaces of A'. For example, we count the number of C(A)-orbits as well as that of invariant subspaces of A'.