Three-center Coulomb Integrals Research Articles

Efficient Evaluation of Two-Center Gaussian Integrals in Periodic Systems.

By using Poisson's summation formula, we calculate periodic integrals over Gaussian basis functions by partitioning the lattice summations between the real and reciprocal space, where both sums converge exponentially fast with a large exponent. We demonstrate that the summation can be performed efficiently to calculate two-center Gaussian integrals over various kernels including overlap, kinetic, and Coulomb. The summation in real space is performed using an efficient flavor of the McMurchie-Davidson recurrence relation. The expressions for performing summation in the reciprocal space are also derived and implemented. The algorithm for reciprocal space summation allows us to reuse several terms and leads to a significant improvement in efficiency when highly contracted basis functions with large exponents are used. We find that the resulting algorithm is only between a factor of 5 and 15 slower than that for molecular integrals, indicating the very small number of terms needed in both the real and reciprocal space summations. An outline of the algorithm for calculating three-center Coulomb integrals is also provided.

Comment on "A tight distance-dependent estimator for screening three-center Coulomb integrals over Gaussian basis functions" [J. Chem. Phys. 142, 154106 (2015)

We extend the tight distance-dependent estimator proposed by Hollman et al. [J. Chem. Phys. 142, 154106 (2015)] for the three-center Coulomb integrals over Gaussian atomic orbitals to handle the two-center case. We also propose minor modifications of the original three-center estimator for the case of contracted ket Gaussians and concentric bra Gaussians.

Efficient evaluation of the geometrical first derivatives of three-center Coulomb integrals.

The calculation of the geometrical derivatives of three-center electron repulsion integrals (ERIs) over contracted spherical harmonic Gaussians has been optimized. We compared various methods based on the Obara-Saika, McMurchie-Davidson, Gill-Head-Gordon-Pople, and Rys polynomial algorithms using Cartesian, Hermite, and mixed Gaussian integrals for each scheme. The latter ERIs contain both Hermite and Cartesian Gaussians, and they combine the advantageous properties of both types of basis functions. Furthermore, prescreening of the ERI derivatives is discussed, and an efficient approximation of the Cauchy-Schwarz bound for first derivatives is presented. Based on the estimated operation counts, the most promising schemes were implemented by automated code generation, and their relative performances were evaluated. We analyzed the benefits of computing all of the derivatives of a shell triplet simultaneously compared to calculating them just for one degree of freedom at a time, and it was found that the former scheme offers a speedup close to an order of magnitude with a triple-zeta quality basis when appropriate prescreening is applied. In these cases, the Obara-Saika method with Cartesian Gaussians proved to be the best approach, but when derivatives for one degree of freedom are required at a time the mixed Gaussian Obara-Saika and Gill-Head-Gordon-Pople algorithms are predicted to be the best performing ones.

Efficient evaluation of three-center Coulomb integrals.

In this study we pursue the most efficient paths for the evaluation of three-center electron repulsion integrals (ERIs) over solid harmonic Gaussian functions of various angular momenta. First, the adaptation of the well-established techniques developed for four-center ERIs, such as the Obara-Saika, McMurchie-Davidson, Gill-Head-Gordon-Pople, and Rys quadrature schemes, and the combinations thereof for three-center ERIs is discussed. Several algorithmic aspects, such as the order of the various operations and primitive loops as well as prescreening strategies, are analyzed. Second, the number of floating point operations (FLOPs) is estimated for the various algorithms derived, and based on these results the most promising ones are selected. We report the efficient implementation of the latter algorithms invoking automated programming techniques and also evaluate their practical performance. We conclude that the simplified Obara-Saika scheme of Ahlrichs is the most cost-effective one in the majority of cases, but the modified Gill-Head-Gordon-Pople and Rys algorithms proposed herein are preferred for particular shell triplets. Our numerical experiments also show that even though the solid harmonic transformation and the horizontal recurrence require significantly fewer FLOPs if performed at the contracted level, this approach does not improve the efficiency in practical cases. Instead, it is more advantageous to carry out these operations at the primitive level, which allows for more efficient integral prescreening and memory layout.

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. I. An efficient and simple linear scaling local MP2 method that uses an intermediate basis of pair natural orbitals.

In this work, a systematic infrastructure is described that formalizes concepts implicit in previous work and greatly simplifies computer implementation of reduced-scaling electronic structure methods. The key concept is sparse representation of tensors using chains of sparse maps between two index sets. Sparse map representation can be viewed as a generalization of compressed sparse row, a common representation of a sparse matrix, to tensor data. By combining few elementary operations on sparse maps (inversion, chaining, intersection, etc.), complex algorithms can be developed, illustrated here by a linear-scaling transformation of three-center Coulomb integrals based on our compact code library that implements sparse maps and operations on them. The sparsity of the three-center integrals arises from spatial locality of the basis functions and domain density fitting approximation. A novel feature of our approach is the use of differential overlap integrals computed in linear-scaling fashion for screening products of basis functions. Finally, a robust linear scaling domain based local pair natural orbital second-order Möller-Plesset (DLPNO-MP2) method is described based on the sparse map infrastructure that only depends on a minimal number of cutoff parameters that can be systematically tightened to approach 100% of the canonical MP2 correlation energy. With default truncation thresholds, DLPNO-MP2 recovers more than 99.9% of the canonical resolution of the identity MP2 (RI-MP2) energy while still showing a very early crossover with respect to the computational effort. Based on extensive benchmark calculations, relative energies are reproduced with an error of typically <0.2 kcal/mol. The efficiency of the local MP2 (LMP2) method can be drastically improved by carrying out the LMP2 iterations in a basis of pair natural orbitals. While the present work focuses on local electron correlation, it is of much broader applicability to computation with sparse tensors in quantum chemistry and beyond.

A tight distance-dependent estimator for screening three-center Coulomb integrals over Gaussian basis functions.

A new estimator for three-center two-particle Coulomb integrals is presented. Our estimator is exact for some classes of integrals and is much more efficient than the standard Schwartz counterpart due to the proper account of distance decay. Although it is not a rigorous upper bound, the maximum degree of underestimation can be controlled by two adjustable parameters. We also give numerical evidence of the excellent tightness of the estimator. The use of the estimator will lead to increased efficiency in reduced-scaling one- and many-body electronic structure theories.

A systematic way for the cost reduction of density fitting methods.

We present a simple approach for the reduction of the size of auxiliary basis sets used in methods exploiting the density fitting (resolution of identity) approximation for electron repulsion integrals. Starting out of the singular value decomposition of three-center two-electron integrals, new auxiliary functions are constructed as linear combinations of the original fitting functions. The new functions, which we term natural auxiliary functions (NAFs), are analogous to the natural orbitals widely used for the cost reduction of correlation methods. The use of the NAF basis enables the systematic truncation of the fitting basis, and thereby potentially the reduction of the computational expenses of the methods, though the scaling with the system size is not altered. The performance of the new approach has been tested for several quantum chemical methods. It is demonstrated that the most pronounced gain in computational efficiency can be expected for iterative models which scale quadratically with the size of the fitting basis set, such as the direct random phase approximation. The approach also has the promise of accelerating local correlation methods, for which the processing of three-center Coulomb integrals is a bottleneck.

Computer‐generated formulas for some three‐center molecular integrals over Slater‐type orbitals

AbstractExact computer‐generated formulas can be produced for each term of an infinite series that gives the value of three‐center Coulomb integrals over Slater‐type orbitals of the s‐type with equal screening constants. As a specific example, the Coulomb energy of an equilateral triangular arrangement of all 1s orbitals is calculated using seven terms of an infinite expansion to obtain an answer comparable to earlier work in elliptic coordinates. Generalization to all three‐center cases of this implementation of the Löwdin α‐function method is straightforward.