The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
From MaRDI portal
(Redirected from Publication:2216482)
Recommendations
Cites work
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A generalization of Saad's theorem on Rayleigh-Ritz approximations
- A new variant of Arnoldi method for approximation of eigenpairs
- A refined Jacobi-Davidson method and its correction equation
- Alternative correction equations in the Jacobi-Davidson method
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Computing interior eigenvalues of large matrices
- Controlling inner iterations in the Jacobi-Davidson method
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Increasing the performance of the Jacobi-Davidson method by blocking
- Interpolation-restart strategies for resilient eigensolvers
- Jacobi Correction Equation, Line Search, and Conjugate Gradients in Hermitian Eigenvalue Computation I: Computing an Extreme Eigenvalue
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Matrix algorithms. Vol. 2: Eigensystems
- On refined Ritz vectors and polynomial characterization
- On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. III: Generalized Rayleigh quotient and characteristic roots with linear elementary divisors. IV: Generalized Rayleigh quotient for nonlinear
- On the correction equation of the Jacobi-Davidson method
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- The Jacobi-Davidson method
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
Cited in
(2)
This page was built for publication: The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216482)