A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix (Q2353376): Difference between revisions

The paper deals with the numerical computation of the smallest eigenvalue and the associated positive eigenvector of a large irreducible nonsingular \(M\)-matrix. The authors start their considerations from the inverse iteration method, introduced by \textit{T. Noda} in [Numer. Math. 17, 382--386 (1971; Zbl 0226.65026)], and propose two different inner tolerance strategies for solving the inner linear systems involved. Moreover, they establish a new quadratic convergence result and provide numerical experiments and comparisons with other iterative solvers.