MINRES and MINERR Are Better than SYMMLQ in Eigenpair Computations
From MaRDI portal
Publication:4210383
DOI10.1137/S106482759528226XzbMath0922.65024MaRDI QIDQ4210383
Publication date: 21 September 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
eigenvalueseigenvectorsgeneralized eigenvalue probleminverse iterationeigenpairsMINRESpreconditioned iterative methodssymmetric indefinite systemsRayleigh quotient iterationsSYMMLQMINERR
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items (2)
An efficient algorithm for the Schrödinger-Poisson eigenvalue problem ⋮ On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
This page was built for publication: MINRES and MINERR Are Better than SYMMLQ in Eigenpair Computations