On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
From MaRDI portal
Publication:2219639
Recommendations
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems
- A block Chebyshev-Davidson method for solving symmetric eigenvalue problems
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- A filtered Lanczos procedure for extreme and interior eigenvalue problems
Cites work
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
- A filtered Lanczos procedure for extreme and interior eigenvalue problems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- A projection method for generalized eigenvalue problems using numerical integration.
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Computing partial spectra with least-squares rational filters
- Error bounds of Rayleigh-Ritz type contour integral-based eigensolver for solving generalized eigenvalue problems
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- New iterative methods for solution of the eigenproblem
- Numerical methods for large eigenvalue problems
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
Cited in
(13)- On a deflation method for the symmetric generalized eigenvalue problem
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- Filters consist of a few resolvents to solve real symmetric definite generalized eigenproblems
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- scientific article; zbMATH DE number 1780132 (Why is no real title available?)
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering
- Chebyshev accelerating technique for solving generalized non-symmetric eigenvalue problems
- On convergence of Jacobi–Davidson method for solving Hermitian generalized eigenvalue problems
- A new subspace iteration algorithm for solving generalized eigenvalue problems in vibration analysis
- A shifted Laplace rational filter for large-scale eigenvalue problems
- EigenWave: an optimal O(N) method for computing eigenvalues and eigenvectors by time-filtering the wave equation
- Residual-based Chebyshev filtered subspace iteration for Hermitian eigenvalue problems tolerant to inexact matrix-vector products
This page was built for publication: On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219639)
