The effects of inexact solvers in algorithms for symmetric eigenvalue problems

DOI10.1016/S0024-3795(98)10201-XzbMath0943.65048WikidataQ126550542 ScholiaQ126550542MaRDI QIDQ1301312

V. Pereyra

Publication date: 21 August 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

eigenvector; symmetric eigenvalue problem; inexact inverse iteration; inexact Rayleigh quotient iteration

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

Related Items

Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem, On convergence of the inexact Rayleigh quotient iteration with MINRES, Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation, Inexact inverse subspace iteration for generalized eigenvalue problems, A truncated-CG style method for symmetric generalized eigenvalue problems, Convergence of inexact inverse iteration with application to preconditioned iterative solvers, A new justification of the Jacobi-Davidson method for large eigenproblems, A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem, Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix., A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems, Two-sided and alternating Jacobi-Davidson, The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action, Computing tall skinny solutions of \(AX-XB=C\), Inexact inverse iteration for symmetric matrices

Cites Work

• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Inexact Newton Methods