| We present a new algorithm for computing the Perron root of a nonnegative irreducible matrix. The algorithm is formulated by combining a reciprocal of the well known Collatz's formula with a special inverse iteration algorithm discussed in [10, Linear Algebra Appl., 15 (1976), pp 235-242 ]. Numerical experiments demonstrate that our algorithm is able to compute the Perron root accurately and faster than other well known algorithms; in particular, when the size of the matrix is large. The proof of convergence of our algorithm is also presented. |
