2023
DOI: 10.1021/acs.jctc.2c00983
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Precision Approach for Accelerating Large-Scale Eigenvalue Solvers in Electronic Structure Calculations on Graphics Processing Units

Abstract: Single precision (SP) arithmetic can be greatly accelerated as compared to double precision (DP) arithmetic on graphics processing units (GPUs). However, the use of SP in the whole process of electronic structure calculations is inappropriate for the required accuracy. We propose a 3-fold dynamic precision approach for accelerated calculations but still with the accuracy of DP. Here, SP, DP, and mixed precision are dynamically switched during an iterative diagonalization process. We applied this approach to th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 51 publications
0
2
0
Order By: Relevance
“…The iterative diagonalization of the Hamiltonian matrix is a computational bottleneck in real-space DFT calculations. To facilitate efficient diagonalization of the Hamiltonian, various iterative algorithms have been applied, among which preconditioned iterative methods have been widely adopted in many real-space simulation codes. ,,,,, Despite recent advancements in iterative eigensolvers for real-space DFT, the overall efficiency is still hindered by the absence of efficient preconditioners.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The iterative diagonalization of the Hamiltonian matrix is a computational bottleneck in real-space DFT calculations. To facilitate efficient diagonalization of the Hamiltonian, various iterative algorithms have been applied, among which preconditioned iterative methods have been widely adopted in many real-space simulation codes. ,,,,, Despite recent advancements in iterative eigensolvers for real-space DFT, the overall efficiency is still hindered by the absence of efficient preconditioners.…”
Section: Introductionmentioning
confidence: 99%
“…The experiments in this study used a convergence threshold of 1e-3, so the residual sizes in the figures were plotted up to 1e-3, which corresponds to an eigenvalue error of about 1 mHartree. 38 Concerns may arise regarding the possible variation in the convergence behavior of the preconditioner at lower residual size. To address this, we conducted additional experiments on the same systems in Figure 2, using a lower convergence threshold of 1e-7 (see Figure S3).…”
mentioning
confidence: 99%