Global algorithms for maximal eigenpair
For researchers needing to compute maximal eigenpairs, this provides a more general algorithmic solution, though it is an incremental extension of prior work.
This paper extends previous work on computing the maximal eigenpair by introducing two global algorithms that work for a general class of real or complex matrices, including those with negative off-diagonal elements.
This paper is a continuation of \ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements. This paper introduces two global algorithms for computing the maximal eigenpair in a rather general setup, including even a class of real (with some negative off-diagonal elements) or complex matrices.