Sparsity of the electron repulsion integral tensor using different localized virtual orbital representations in local second-order Møller–Plesset theory
Zhenling Wang, Abdulrahman Aldossary, Martin Head‐Gordon
Utilizing localized orbitals, local correlation theory can reduce the unphysically high system-size scaling of post-Hartree-Fock (post-HF) methods to linear scaling in insulating molecules. The sparsity of the four-index electron repulsion integral (ERI) tensor is central to achieving this reduction. For second-order Møller-Plesset theory (MP2), one of the simplest post-HF methods, only the (ia|jb) ERIs are needed, coupling occupied orbitals i, j and virtuals a, b. In this paper, we compare the numerical sparsity (called the "ragged list") and two other approaches revealing the low-rank sparsity of the ERI. The ragged list requires only one set of (localized) virtual orbitals, and we find that the orthogonal valence virtual-hard virtual set of virtuals originally proposed by Subotnik et al. gives the sparsest ERI tensor. To further compress the ERI tensor, the pair natural orbital (PNO) type representation uses different sets of virtual orbitals for different occupied orbital pairs, while the occupied-specific virtual (OSV) approach uses different virtuals for each occupied orbital. Our results indicate that while the low-rank PNO representation achieves significant rank reduction, it also requires more memory than the ragged list. The OSV approach requires similar memory to that of the ragged list, but it involves greater algorithmic complexity. An approximation (called the "fixed sparsity pattern") for solving the local MP2 equations using the numerically sparse ERI tensor is proposed and tested to be sufficiently accurate and to have highly controllable error. A low-scaling local MP2 algorithm based on the ragged list and the fixed sparsity pattern is therefore promising.
Utilizing localized orbitals, local correlation theory can reduce the unphysically high system-size scaling of post-Hartree-Fock (post-HF) methods to linear scaling in insulating molecules. The sparsity of the four-index electron repulsion integral (ERI) tensor is central to achieving this reduction. For second-order Møller-Plesset theory (MP2), one of the simplest post-HF methods, only the (ia|jb) ERIs are needed, coupling occupied orbitals i, j and virtuals a, b. In this paper, we compare the numerical sparsity (called the "ragged list") and two other approaches revealing the low-rank sparsity of the ERI. The ragged list requires only one set of (localized) virtual orbitals, and we find that the orthogonal valence virtual-hard virtual set of virtuals originally proposed by Subotnik et al. gives the sparsest ERI tensor. To further compress the ERI tensor, the pair natural orbital (PNO) type representation uses different sets of virtual orbitals for different occupied orbital pairs, while the occupied-specific virtual (OSV) approach uses different virtuals for each occupied orbital. Our results indicate that while the low-rank PNO representation achieves significant rank reduction, it also requires more memory than the ragged list. The OSV approach requires similar memory to that of the ragged list, but it involves greater algorithmic complexity. An approximation (called the "fixed sparsity pattern") for solving the local MP2 equations using the numerically sparse ERI tensor is proposed and tested to be sufficiently accurate and to have highly controllable error. A low-scaling local MP2 algorithm based on the ragged list and the fixed sparsity pattern is therefore promising.
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.
We present a formulation of the explicitly correlated second-order Møller-Plesset (MP2-F12) energy in which all nontrivial post-mean-field steps are formulated with linear computational complexity in system size. The two key ideas are the use of pair-natural orbitals for compact representation of wave function amplitudes and the use of domain approximation to impose the block sparsity. This development utilizes the concepts for sparse representation of tensors described in the context of the domain based local pair-natural orbital-MP2 (DLPNO-MP2) method by us recently [Pinski et al., J. Chem. Phys. 143, 034108 (2015)]. Novel developments reported here include the use of domains not only for the projected atomic orbitals, but also for the complementary auxiliary basis set (CABS) used to approximate the three- and four-electron integrals of the F12 theory, and a simplification of the standard B intermediate of the F12 theory that avoids computation of four-index two-electron integrals that involve two CABS indices. For quasi-1-dimensional systems (n-alkanes), the ON DLPNO-MP2-F12 method becomes less expensive than the conventional ON(5) MP2-F12 for n between 10 and 15, for double- and triple-zeta basis sets; for the largest alkane, C200H402, in def2-TZVP basis, the observed computational complexity is N(∼1.6), largely due to the cubic cost of computing the mean-field operators. The method reproduces the canonical MP2-F12 energy with high precision: 99.9% of the canonical correlation energy is recovered with the default truncation parameters. Although its cost is significantly higher than that of DLPNO-MP2 method, the cost increase is compensated by the great reduction of the basis set error due to explicit correlation.
In this proof-of-principle study, we discuss the application of various tensor representation formats and their implications on memory requirements and computational effort for tensor manipulations as they occur in typical post-Hartree–Fock (post-HF) methods. A successive tensor decomposition/rank reduction scheme in the matrix product state (MPS) format for the two-electron integrals in the AO and MO bases and an estimate of the t 2 amplitudes as obtained from second-order many-body perturbation theory (MP2) are described. Furthermore, the AO–MO integral transformation, the calculation of the MP2 energy and the potential usage of tensors in low-rank MPS representation for the tensor contractions in coupled cluster theory are discussed in detail. We are able to show that the overall scaling of the memory requirements is reduced from the conventional N 4 scaling to approximately N 3 and the scaling of computational effort for tensor contractions in post-HF methods can be reduced to roughly N 4 while the decomposition itself scales as N 5. While efficient algorithms with low prefactor for the tensor decomposition have yet to be devised, this ansatz offers the possibility to find a robust approximation with low-scaling behaviour with system and basis-set size for post-HF ab initio methods.
In this thesis the application of novel tensor decomposition and tensor representation techniques in highly accurate post Hartree-Fock methods is evaluated. These representation techniques can help to overcome the steep scaling behaviour of high level ab-initio calculations with increasing system size and therefore break the "curse of dimensionality". After a comparison of various tensor formats the application of the "canonical polyadic" format (CP) is described in detail. There, especially the casting of a normal, index based tensor into the CP format (tensor decomposition) and a method for a low rank approximation (rank reduction) of the two-electron integrals in the AO basis are investigated. The decisive quantity for the applicability of the CP format is the scaling of the rank with increasing system and basis set size. The memory requirements and the computational effort for tensor manipulations in the CP format are only linear in the number of dimensions but still depend on the expansion length (rank) of the approximation. Furthermore, the AO-MO transformation and a MP2 algorithm with decomposed tensors in the CP format is evaluated and the scaling with increasing system and basis set size is investigated. Finally, a Coupled-Cluster algorithm based only on low-rank CP representation of the MO integrals is developed. There, especially the successive tensor contraction during the iterative solution of the amplitude equations and the error propagation upon multiple application of the reduction procedure are discussed. In conclusion the overall complexity of a Coupled-Cluster procedure with tensors in CP format is evaluated and some possibilities for improvements of the rank reduction procedure tailored to the needs in electronic structure calculations are shown.
In a previous publication, we have discussed the usage of tensor decomposition in the canonical polyadic (CP) tensor format for electronic structure methods. There, we focused on two-electron integrals and second order Møller-Plesset perturbation theory (MP2). In this work, we discuss the CP format for Coupled Cluster (CC) theory and present a pilot implementation for the Coupled Cluster Doubles method. We discuss the iterative solution of the CC amplitude equations using tensors in CP representation and present a tensor contraction scheme that minimizes the effort necessary for the rank reductions during the iterations. Furthermore, several details concerning the reduction of complexity of the algorithm, convergence of the CC iterations, truncation errors, and the choice of threshold for chemical accuracy are discussed.
One of the major obstacles in modern quantum chemistry is the need to employ exceedingly large one-electron basis sets in electron correlation methods to obtain reliably accurate results. The family of explicitly correlated wave function methods circumvents this issue by introducing terms that explicitly depend on the interelectronic distance, thereby enforcing the correct electron–electron cusp behavior, albeit at the cost of additional complicated many-electron integrals when evaluated without further approximation. The main focus of the present work is the efficient, low-scaling evaluation of explicitly correlated approaches, examined here through the explicitly correlated correction to second-order Møller–Plesset perturbation theory (MP2-F12) as a representative example. While these methods are highly effective in reducing the basis set incompleteness error, the cost associated with the corresponding correction often far exceeds that of the underlying correlation method. To overcome these limitations, several techniques and strategies are introduced to significantly reduce computational demand and resolve the main bottlenecks that arise. A particularly straightforward approach is provided by the scaled MP2-F12 ansatz, which introduces a single empirically determined factor that scales the direct-type geminal–geminal terms to closely reproduce the MP2-F12 correction, thereby omitting the most expensive exchange-type contributions. Furthermore, the computation of Fock matrix elements spanning multiple orbital spaces is drastically accelerated by extending techniques originally developed for Hartree–Fock and density functional theory. The direct contributions are evaluated using a modified resolution-of-the-identity Coulomb (RI-J) approach employing the J-engine ansatz for integral construction, while the exchange contributions are treated via three-dimensional numerical quadrature in the form of the seminumerical sn-LinK method. These approaches reduce the computational cost by more than three orders of magnitude compared to the approximation-free evaluation while maintaining high accuracy, with additional speedups achieved by exploiting the massive parallelism of graphics processing units. The central focus of this work is the efficient decomposition of complicated exchange-type multi-electron integrals, where numerical quadrature plays a key role in improving performance. The complementary auxiliary basis set resolution of the identity (CABS-RI) reduces the most expensive exchange-type integral to a three-electron integral, which is then efficiently decomposed via numerical quadrature. In this context, a highly efficient batch-wise, distance-dependent integral screening exploiting the short-range behavior of F12 operators is introduced, significantly improving performance and enabling near-linear-scaling evaluations while retaining high accuracy. These strategies are extended to all exchange-type contributions in F12 theory, leading to an alternative formulation of integrals better suited for efficient factorization. A novel combination of numerical quadrature with density fitting is presented for the efficient computation of products of four-center two-electron integrals, alongside algorithms covering all exchange-type contributions, including advantageous batching strategies. In general, the formal computational cost with system size M is reduced from O(M⁵) to O(M⁴), with further improvements appearing feasible through the use of localized molecular orbitals combined with advanced integral screening techniques.