Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC
From MaRDI portal
Publication:6040777
DOI10.1016/j.cpc.2020.107330OpenAlexW3021595049WikidataQ115036683 ScholiaQ115036683MaRDI QIDQ6040777
James R. Chelikowsky, Chao Yang, Kai-Hsin Liou
Publication date: 22 May 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2020.107330
eigenvalue problemparallel algorithmdensity functional theoryelectronic structurepolynomial filteringspectrum slicing
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the evolution of electronic properties in nanocrystals
- Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation
- RESCU: a real space electronic structure method
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- SPARC: accurate and efficient finite-difference formulation and parallel implementation of density functional theory: isolated clusters
- On the use of harmonic Ritz pairs in approximating internal eigenpairs
- A comparative study on methods for convergence acceleration of iterative vector sequences
- A spectrum slicing method for the Kohn-Sham problem
- Matrix Algorithms
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Approximating Spectral Densities of Large Matrices
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
- ARPACK Users' Guide
- A Robust and Efficient Implementation of LOBPCG
- ChASE
This page was built for publication: Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC
