Many-electron integrals over gaussian basis functions. I. Recurrence relations for three-electron integrals
Giuseppe M. J. Barca, Pierre-Fran\c{c}ois Loos, Peter M. W. Gill

TL;DR
This paper introduces a new algorithm for directly computing three-electron integrals over gaussian basis functions, enhancing the accuracy of high-precision molecular calculations without relying on resolution of the identity approximations.
Contribution
It presents a novel algorithm and recurrence relations for three-electron integrals, extending existing methods for two-electron integrals to improve accuracy in quantum chemistry calculations.
Findings
Developed a direct computation algorithm for three-electron integrals.
Derived recurrence relations for efficient integral evaluation.
Enables high-accuracy molecular calculations without RI approximations.
Abstract
Explicitly-correlated F12 methods are becoming the first choice for high-accuracy molecular orbital calculations, and can often achieve chemical accuracy with relatively small gaussian basis sets. In most calculations, the many three- and four-electron integrals that formally appear in the theory are avoided through judicious use of resolutions of the identity (RI). However, in order not to jeopardize the intrinsic accuracy of the F12 wave function, the associated RI auxiliary basis set must be large. Here, inspired by the Head-Gordon-Pople (HGP) and PRISM algorithms for two-electron integrals, we present an algorithm to compute directly three-electron integrals over gaussian basis functions and a very general class of three-electron operators, without invoking RI approximations. A general methodology to derive vertical, transfer and horizontal recurrence relations is also presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
