arXiv · 1811.12890
An efficient algorithm for Cholesky decomposition of electron repulsion integrals
Abstract
We present an algorithm where only the Cholesky basis is determined in the decomposition procedure. This allows for improved screening and a partitioned matrix decomposition scheme, both of which significantly reduce memory usage and computational cost. After the basis has been determined, an inner projection technique is used to construct the Cholesky vectors. 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 80000 atomic orbitals.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sarai D. Folkestad, Eirik F. Kjønstad, Henrik Koch. 2018-11-30. An efficient algorithm for Cholesky decomposition of electron repulsion integrals. https://doi.org/10.1063/1.5083802
Cite the original work for its findings. Save a collection to share your selection of sources.