On local quadratic convergence of inexact simplified Jacobi-Davidson method
From MaRDI portal
(Redirected from Publication:513233)
Recommendations
- On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems
- A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
- A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
- A new justification of the Jacobi-Davidson method for large eigenproblems
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Inexact inverse iteration for generalized eigenvalue problems
- Inexact inverse subspace iteration for generalized eigenvalue problems
- Jacobi Correction Equation, Line Search, and Conjugate Gradients in Hermitian Eigenvalue Computation I: Computing an Extreme Eigenvalue
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
- Matrix algorithms. Vol. 2: Eigensystems
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- Nonlinear eigenvalue problems: Newton-type methods and nonlinear Rayleigh functionals
- Parallel iterative methods for sparse linear systems
- Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
Cited in
(20)- On greedy randomized coordinate updating iteration methods for solving symmetric eigenvalue problems
- An extended shift-invert residual Arnoldi method
- A novel method to compute all eigenvalues of the polynomial eigenvalue problems in an open half plane
- Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces
- On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems
- Rayleigh quotient minimization method for symmetric eigenvalue problems
- The power method and beyond
- Behavior of the correction equations in the Jacobi-Davidson method
- Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation
- Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems
- On steepest coordinate descent method for computing extreme eigenpairs of symmetric matrices
- On global convergence of subspace projection methods for Hermitian eigenvalue problems
- On convergence of MRQI and IMRQI methods for Hermitian eigenvalue problems
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- On global convergence of admissibly randomized coordinate descent method
- Computing interior eigenpairs in augmented Krylov subspace produced by Jacobi–Davidson correction equation
- A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
- On convergence of Jacobi–Davidson method for solving Hermitian generalized eigenvalue problems
- Preconditioned inexact Jacobi-Davidson method for large symmetric eigenvalue problems
- On multistep Rayleigh quotient iterations for Hermitian eigenvalue problems
This page was built for publication: On local quadratic convergence of inexact simplified Jacobi-Davidson method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513233)
