Cucheb: a GPU implementation of the filtered Lanczos procedure
From MaRDI portal
Publication:1737460
DOI10.1016/j.cpc.2017.06.016zbMath1411.65005OpenAlexW2727864131MaRDI QIDQ1737460
Yousef Saad, Vassilis Kalantzis, Jared Lee Aurentz
Publication date: 23 April 2019
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2017.06.016
eigenvalueseigenvectorsquantum mechanicsdensity functional theoryelectronic structure calculationsGPU
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items
Cucheb, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software, Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral Schur complement techniques for symmetric eigenvalue problems
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Electronic structure calculations for plane-wave codes without diagonalization
- Kernel polynomial approximations for densities of states and spectral functions
- Solution of large eigenvalue problems in electronic structure calculations
- A spectrum slicing method for the Kohn-Sham problem
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
- Computing Partial Spectra with Least-Squares Rational Filters
- The university of Florida sparse matrix collection
- Numerical Methods for Large Eigenvalue Problems
- The kernel polynomial method
- A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
- The Lanczos Algorithm With Partial Reorthogonalization
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- The Lanczos Algorithm with Selective Orthogonalization
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Filtered Conjugate Residual‐type Algorithms with Applications
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- The Matrix Eigenvalue Problem
- The principle of minimized iterations in the solution of the matrix eigenvalue problem