An efficient algorithm for Cholesky decomposition of electron repulsion integrals
Journal article, Peer reviewed
Accepted version
![Thumbnail](/ntnu-xmlui/bitstream/handle/11250/2625000/A_novel_algorithm_for_Cholesky_decomposition_of_electron_replusion_integrals-84.pdf.jpg?sequence=5&isAllowed=y)
View/ Open
Date
2019Metadata
Show full item recordCollections
- Institutt for kjemi [1397]
- Publikasjoner fra CRIStin - NTNU [38294]
Abstract
Approximating the electron repulsion integrals using inner projections is a well-established approach to reduce the computational demands of electronic structure calculations. Here, we present a two-step Cholesky decomposition algorithm where only the elements of the Cholesky basis (the pivots) are determined in the pivoting procedure. This allows for improved screening, significantly reducing memory usage and computational cost. After the pivots have been determined, the Cholesky vectors are constructed using the inner projection formulation. We also propose a partitioned decomposition approach where the Cholesky basis is chosen from a reduced set generated by decomposing diagonal blocks of the matrix. The algorithm extends the application range of the methodology and is well suited for multilevel methods. We apply the algorithm to systems with up to 80 000 atomic orbitals. The accuracy of the integral approximations is demonstrated for a formaldehyde-water system using a new Cholesky-based CCSD implementation.