2015
DOI: 10.1063/1.4923369
|View full text |Cite
|
Sign up to set email alerts
|

Fast, accurate evaluation of exact exchange: The occ-RI-K algorithm

Abstract: Construction of the exact exchange matrix, K, is typically the rate-determining step in hybrid density functional theory, and therefore, new approaches with increased efficiency are highly desirable. We present a framework with potential for greatly improved efficiency by computing a compressed exchange matrix that yields the exact exchange energy, gradient, and direct inversion of the iterative subspace (DIIS) error vector. The compressed exchange matrix is constructed with one index in the compact molecular … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
83
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 50 publications
(85 citation statements)
references
References 116 publications
(100 reference statements)
2
83
0
Order By: Relevance
“…Total timings for an SCF iteration and timings for the far-field exchange evaluation were averaged over the first 5 iterations. The cost of the far-field exchange evaluation for C 96 H 24 , which was about 10% of the total cost per SCF iteration, was 188 sec with 1 compute node, and reduced to 99, 52, 29, 15, 10, and 9 sec using 2, 4, 8, 16, 32, and 64 compute nodes. The timings for C 150 H 30 were 216, 111, 62, 37, 21, and 16 sec using 2, 4, 8, 16, 32, and 64 compute nodes.…”
Section: B Parallel Scalabilitymentioning
confidence: 99%
See 2 more Smart Citations
“…Total timings for an SCF iteration and timings for the far-field exchange evaluation were averaged over the first 5 iterations. The cost of the far-field exchange evaluation for C 96 H 24 , which was about 10% of the total cost per SCF iteration, was 188 sec with 1 compute node, and reduced to 99, 52, 29, 15, 10, and 9 sec using 2, 4, 8, 16, 32, and 64 compute nodes. The timings for C 150 H 30 were 216, 111, 62, 37, 21, and 16 sec using 2, 4, 8, 16, 32, and 64 compute nodes.…”
Section: B Parallel Scalabilitymentioning
confidence: 99%
“…24 As shown below, this trick is essential for utilizing a hierarchy of boxes with upward and downward translation of multipoles in the FMM algorithm. We report an efficient, parallel implementation of the algorithm, which is publicly available as part of the bagel package.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Indeed, DFT based ab initio molecular dynamics calculations of pure water and aqueous solutions using fully converged discrete variable representation basis sets show that both structural and dynamical properties are sensitive to the size of the basis set [131][132][133][134][135][136][137] . Examples of existing approaches that help defray the computational cost are the use of resolution of the identity (RI) approximations for the Coulomb and exchange interactions [138][139][140][141] , which are nowadays standard, as well as the dual-basis SCF methods. [142][143] In order to approach the basis set limit with potentially lower computational effort, we have been working on a new SCF scheme using a minimal adaptive basis (MAB) consisting of functions that are variationally optimized on each atomic site.…”
Section: Section 33 New Formulations Of Electrostatic Multipolar Intmentioning
confidence: 99%
“…Several attempts and discussions have therefore revolved around improving the RI approach. [14][15][16][17] While a lot of effort has been put into advancing upon the approximation formula itself [18][19][20][21][22][23] as well as the auxiliary basis sets, [24][25][26] the null space structure of the physical models remains more or less opaque.…”
Section: Introductionmentioning
confidence: 99%