On convergence of iterative projection methods for symmetric eigenvalue problems
From MaRDI portal
Publication:730577
DOI10.1016/j.cam.2016.08.035zbMath1382.65096OpenAlexW2513714633MaRDI QIDQ730577
Publication date: 28 December 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.08.035
global convergencepreconditioningRayleigh-Ritz procedureiterative methods for eigenvalue problemsrestarting
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)
Related Items (3)
On global convergence of subspace projection methods for Hermitian eigenvalue problems ⋮ Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On convergence of the inexact Rayleigh quotient iteration with MINRES
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
- On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem
- Rational Krylov for eigenvalue computation and model order reduction
- Convergence of inexact inverse iteration with application to preconditioned iterative solvers
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Eigenvalue computation in the 20th century
- Preconditioning eigenvalues and some comparison of solvers
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- On the convergence rate of a preconditioned subspace eigensolver
- A note on the Rayleigh quotient iteration for symmetric eigenvalue problems
- A block Arnoldi-type contour integral spectral projection method for solving generalized eigenvalue problems
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- A geometric theory for preconditioned inverse iteration applied to a subspace
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
- Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method
- On the Convergence of Rational Ritz Values
- Convergence Analysis of Gradient Iterations for the Symmetric Eigenvalue Problem
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- Gradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers
- Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration
- Jacobi Correction Equation, Line Search, and Conjugate Gradients in Hermitian Eigenvalue Computation I: Computing an Extreme Eigenvalue
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix
- Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
- The Davidson Method
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
- Convergence Analysis of Inexact Rayleigh Quotient Iteration
- Templates for the Solution of Algebraic Eigenvalue Problems
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Is Jacobi--Davidson Faster than Davidson?
- Changing poles in the rational Lanczos method for the Hermitian eigenvalue problem
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
This page was built for publication: On convergence of iterative projection methods for symmetric eigenvalue problems
