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

DOI10.1007/S10444-023-10078-4MaRDI QIDQ6063018zbMATH OpenOpenAlexFDO

Authors Cun-Qiang Miao, Lan Cheng

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

block methodChebyshev polynomialDavidson methodgeneralized eigenvalue problem

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)

Recommendations

• A block Chebyshev-Davidson method for solving symmetric eigenvalue problems
• On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
• scientific article; zbMATH DE number 701592
• scientific article; zbMATH DE number 29756
• A block Chebyshev-Davidson method for linear response eigenvalue problems
• scientific article; zbMATH DE number 238289
• Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
• A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
• A refined block conjugate gradient method for symmetric eigenvalue problems
• A block Chebyshev-Davidson method with inner-outer restart for large 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 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 Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
• A refined subspace iteration algorithm for large sparse eigenproblems
• A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
• An analysis of the Rayleigh-Ritz method for approximating eigenspaces
• An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
• Basis selection in LOBPCG
• Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
• 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
• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
• 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
• On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
• On convergence of iterative projection methods for symmetric eigenvalue problems
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• PRIMME: preconditioned iterative multimethod eigensolver -- methods and software description
• The Davidson Method
• 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

Cited in

(4)

• A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering
• Chebyshev accelerating technique for solving generalized non-symmetric 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 flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063018)