On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
From MaRDI portal
Publication:2441140
DOI10.1007/s11425-013-4571-7zbMath1292.65038arXiv0906.2239OpenAlexW3105539242MaRDI QIDQ2441140
Publication date: 21 March 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.2239
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10)
Related Items (4)
An orthogonally accumulated projection method for symmetric linear system of equations ⋮ On convergence of the inexact Rayleigh quotient iteration with MINRES ⋮ On expansion of search subspaces for large non-Hermitian eigenproblems ⋮ A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On convergence of the inexact Rayleigh quotient iteration with MINRES
- Convergence theory for inexact inverse iteration applied to the generalised nonsymmetric eigenproblem
- Convergence of inexact inverse iteration with application to preconditioned iterative solvers
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Two-sided and alternating Jacobi-Davidson
- Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
- Inexact inverse iteration for symmetric matrices
- Matrix Algorithms
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- Controlling Inner Iterations in the Jacobi–Davidson Method
- Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration
- Solution of Sparse Indefinite Systems of Linear Equations
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- MINRES and MINERR Are Better than SYMMLQ in Eigenpair Computations
- Convergence Analysis of Inexact Rayleigh Quotient Iteration
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
- Inexact Inverse Iteration with Variable Shift for Nonsymmetric Generalized Eigenvalue Problems
This page was built for publication: On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
