On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems

DOI10.1007/s10444-023-10078-4OpenAlexW4387895237MaRDI QIDQ6063018

Lan Cheng, Cun-Qiang Miao

Publication date: 2 December 2023

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-023-10078-4

zbMATH Keywords

generalized eigenvalue problemDavidson methodblock methodChebyshev polynomial

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Related Items (1)

A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering

Cites Work

• Unnamed Item
• PRIMME
• A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
• A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
• On convergence of iterative projection methods for symmetric eigenvalue problems
• Basis selection in LOBPCG
• Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• A refined subspace iteration algorithm for large sparse eigenproblems
• On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
• Filtered Krylov-like sequence method for symmetric eigenvalue problems
• New iterative methods for solution of the eigenproblem
• A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
• An analysis of the Rayleigh--Ritz method for approximating eigenspaces
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
• Numerical Methods for Large Eigenvalue Problems
• A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
• Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
• Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• The Davidson Method
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems

This page was built for publication: On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems