A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
From MaRDI portal
Publication:3516137
DOI10.1137/050630404zbMath1151.65321OpenAlexW2028162538MaRDI QIDQ3516137
Publication date: 1 August 2008
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050630404
global convergenceeigenproblemKrylov subspace methodpolynomial filterDavidson-type methodcorrection-equation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (24)
A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices ⋮ Block iterative eigensolvers for sequences of correlated eigenvalue problems ⋮ Accelerating large partial EVD/SVD calculations by filtered block Davidson methods ⋮ Trace-penalty minimization for large-scale eigenspace computation ⋮ A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems ⋮ Dual vibration configuration interaction (DVCI). An efficient factorization of molecular Hamiltonian for high performance infrared spectrum computation ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering ⋮ Weighted Trace-Penalty Minimization for Full Configuration Interaction ⋮ A spectrum slicing method for the Kohn-Sham problem ⋮ Practical acceleration for computing the HITS expertrank vectors ⋮ A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ Efficient computation of matrix power-vector products: application for space-fractional diffusion problems ⋮ Cucheb: a GPU implementation of the filtered Lanczos procedure ⋮ A block Chebyshev-Davidson method for linear response eigenvalue problems ⋮ Bounding the spectrum of large Hermitian matrices ⋮ Saving flops in LU based shift-and-invert strategy ⋮ Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems ⋮ More robust Chebyshev filtering for SCF iteration, with applications in real-space DFT ⋮ A fast algorithm for Brownian dynamics simulation with hydrodynamic interactions ⋮ An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations ⋮ Filtered Krylov-like sequence method for symmetric eigenvalue problems
Uses Software
This page was built for publication: A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
