A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix (Q2353376)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix |
scientific article |
Statements
A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix (English)
0 references
9 July 2015
0 references
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.
0 references
Noda iteration
0 references
eigenvector
0 references
quadratic convergence
0 references
Jacobi-Davidson algorithm
0 references
Krylov-Schur method
0 references
smallest eigenvalue
0 references
large irreducible nonsingular \(M\)-matrix
0 references
inverse iteration method
0 references
numerical experiment
0 references
0 references
0 references
0 references
0 references