On local quadratic convergence of inexact simplified Jacobi-Davidson method
From MaRDI portal
Publication:513233
DOI10.1016/j.laa.2017.01.018zbMath1359.65055OpenAlexW2576255697MaRDI QIDQ513233
Publication date: 3 March 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.01.018
numerical experimentsquadratic convergencelocal convergenceJacobi-Davidson methodcubic convergenceinexact iterationHermitian eigenproblemstandard Krylov subspace iteration
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items
On global convergence of subspace projection methods for Hermitian eigenvalue problems ⋮ Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation ⋮ On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems ⋮ On convergence of MRQI and IMRQI methods for Hermitian eigenvalue problems ⋮ Preconditioned inexact Jacobi-Davidson method for large symmetric eigenvalue problems ⋮ On multistep Rayleigh quotient iterations for Hermitian eigenvalue problems ⋮ An extended shift-invert residual Arnoldi method ⋮ The power method and beyond ⋮ Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces ⋮ Behavior of the correction equations in the Jacobi-Davidson method ⋮ Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems ⋮ A novel method to compute all eigenvalues of the polynomial eigenvalue problems in an open half plane ⋮ Rayleigh quotient minimization method for symmetric eigenvalue problems ⋮ Filtered Krylov-like sequence method for symmetric eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inexact inverse subspace iteration for generalized eigenvalue problems
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
- Inexact inverse iteration for generalized eigenvalue problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- Matrix Algorithms
- Jacobi Correction Equation, Line Search, and Conjugate Gradients in Hermitian Eigenvalue Computation I: Computing an Extreme Eigenvalue
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems