REVIEW 1 cited by
An efficient algorithm for Cholesky decomposition of electron repulsion integrals
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
An efficient algorithm for Cholesky decomposition of electron repulsion integrals
read the original 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.
Forward citations
Cited by 1 Pith paper
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.