Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
From MaRDI portal
Publication:3112404
DOI10.1137/100807922zbMath1238.65028WikidataQ115156439 ScholiaQ115156439MaRDI QIDQ3112404
Publication date: 16 January 2012
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100807922
convergence; generalized eigenvalue problem; Jacobi-Davidson method; Rayleigh quotient iteration; tuned preconditioner; Krylov subspace inner solves
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65F10: Iterative numerical methods for linear systems
65F08: Preconditioners for iterative methods
Related Items
Broyden's Method for Nonlinear Eigenproblems, Preconditioners for Krylov subspace methods: An overview, On convergence of the inexact Rayleigh quotient iteration with MINRES, On convergence of iterative projection methods for symmetric eigenvalue problems, GMRES convergence bounds for eigenvalue problems, Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems, Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations, A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix, Disguised and new quasi-Newton methods for nonlinear eigenvalue problems, On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems, On expansion of search subspaces for large non-Hermitian eigenproblems, Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems, Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems, Tuned preconditioners for inexact two-sided inverse and Rayleigh quotient iteration
Uses Software
