Realizing Effective Cubic-Scaling Coulomb Hole Plus Screened Exchange Approximation in Periodic Systems via Interpolative Separable Density Fitting with a Plane-Wave Basis Set

Low-Scaling Algorithms for GW and Constrained Random Phase Approximation Using Symmetry-Adapted Interpolative Separable Density Fitting

We present low-scaling algorithms for GW and constrained random phase approximation based on a symmetry-adapted interpolative separable density fitting (ISDF) procedure that incorporates the space-group symmetries of crystalline systems. The resulting formulations scale cubically, with respect to system size, and linearly with the number of k-points, regardless of the choice of single-particle basis and whether a quasiparticle approximation is employed. We validate these methods through comparisons with published literature and demonstrate their efficiency in treating large-scale systems through the construction of downfolded many-body Hamiltonians for carbon dimer defects embedded in hexagonal boron nitride supercells. Our work highlights the efficiency and general applicability of ISDF in the context of large-scale many-body calculations with k-point sampling beyond density functional theory.

Machine Learning K-Means Clustering of Interpolative Separable Density Fitting Algorithm for Accurate and Efficient Cubic-Scaling Exact Exchange Plus Random Phase Approximation within Plane Waves

The exact-exchange plus random-phase approximation (EXX+RPA) method has emerged as a crucial tool for precisely characterizing electronic structures in molecular and solid systems. We present an accurate and efficient implementation of EXX+RPA calculations that scale cubically and are conducted within plane waves. Our approach incorporates the interpolative separable density fitting (ISDF) algorithm, effectively mitigating the computational challenges associated with the plane wave basis set. To overcome the constraints of the conventional ISDF algorithm, characterized by the exceptionally high prefactor in QR factorization for interpolation point selection, we introduce an enhanced machine learning K-means method. This method incorporates a novel empirical weight function called "SSM+" for more precise interpolation point selection, capturing physical information more accurately across diverse systems. Our machine learning approach offers a quasiquadratic scaling alternative, effectively replacing the computationally demanding cubic-scaling QRCP algorithm in plane-wave-based EXX+RPA calculations. Furthermore, we enhance the method's capabilities by optimizing GPU acceleration using MATLAB's integrated GPU toolkit. In particular, our approach reduces the computational scaling of χ0 from 3.80 to 2.13 and the overall computational scaling of EXX from 2.74 to 2.10. We achieve a remarkable GPU acceleration speedup of up to 35×. Regarding CPU computation time, the standard quartic-scaling method requires 22 h to compute Si128, while QRCP completes the calculation in only around 1 h, achieving a speedup up to 20×. However, the utilization of the K-means algorithm reduces the time to 800 s, a substantial improvement of 100× compared to the standard algorithm. By employing the K-means algorithm, the computational time for interpolative point calculation using QRCP decreases from 1 h to 1 min, resulting in a 55× speed increase. With this improved algorithm, we successfully computed the dissociation curve of H2 and the equilibrium polyynic geometry of C18 molecules.

Machine Learning K-Means Clustering in Interpolative Separable Density Fitting Algorithm: Advancing Accurate and Efficient Cubic-Scaling Density Functional Perturbation Theory Calculations within Plane Waves

Density functional perturbation theory (DFPT) is a crucial tool for accurately describing lattice dynamics. The adaptively compressed polarizability (ACP) method reduces the computational complexity of DFPT calculations from O(N4) to O(N3) by combining the interpolative separable density fitting (ISDF) algorithm. However, the conventional QR factorization with column pivoting (QRCP) algorithm, used for selecting the interpolation points in ISDF, not only incurs a high cubic-scaling computational cost, O(N3), but also leads to suboptimal convergence. This convergence issue is particularly pronounced when considering the complex interplay between the external potential and atomic displacement in ACP-based DFPT calculations. Here, we present a machine learning K-means clustering algorithm to select the interpolation points in ISDF, which offers a more efficient quadratic-scaling O(N2) alternative to the computationally intensive cubic-scaling O(N3) QRCP algorithm. We implement this efficient K-means-based ISDF algorithm to accelerate plane-wave DFPT calculations in KSSOLV, which is a MATLAB toolbox for performing Kohn-Sham density functional theory calculations within plane waves. We demonstrate that this K-means algorithm not only offers comparable accuracy to QRCP in ISDF but also achieves better convergence for ACP-based DFPT calculations. In particular, K-means can remarkably reduce the computational cost of selecting the interpolation points by nearly 2 orders of magnitude compared to QRCP in ISDF.

Complex-Valued K-Means Clustering of Interpolative Separable Density Fitting Algorithm for Large-Scale Hybrid Functional Enabled Ab Initio Molecular Dynamics Simulations within Plane Waves

K-means clustering, as a classic unsupervised machine learning algorithm, is the key step to select the interpolation sampling points in interpolative separable density fitting (ISDF) decomposition for hybrid functional electronic structure calculations. Real-valued K-means clustering for accelerating the ISDF decomposition has been demonstrated for large-scale hybrid functional enabled ab initio molecular dynamics (hybrid AIMD) simulations within plane-wave basis sets where the Kohn-Sham orbitals are real-valued. However, it is unclear whether such K-means clustering works for complex-valued Kohn-Sham orbitals. Here, we propose an improved weight function defined as the sum of the square modulus of complex-valued Kohn-Sham orbitals in K-means clustering for hybrid AIMD simulations. Numerical results demonstrate that the K-means algorithm with a new weight function yields smoother and more delocalized interpolation sampling points, resulting in smoother energy potential, smaller energy drift, and longer time steps for hybrid AIMD simulations compared to the previous weight function used in the real-valued K-means algorithm. In particular, we find that this improved algorithm can obtain more accurate oxygen-oxygen radial distribution functions in liquid water molecules and a more accurate power spectrum in crystal silicon dioxide compared to the previous K-means algorithm. Finally, we describe a massively parallel implementation of this ISDF decomposition to accelerate large-scale complex-valued hybrid AIMD simulations containing thousands of atoms (2,744 atoms), which can scale up to 5,504 CPU cores on modern supercomputers.

Mixed Stochastic-Deterministic Approach for Many-Body Perturbation Theory Calculations

We present an approach for GW calculations of quasiparticle energies with quasiquadratic scaling by approximating high-energy contributions to the Green's function in its Lehmann representation with effective stochastic vectors. The method is easy to implement without altering the GW code, converges rapidly with stochastic parameters, and treats systems of various dimensionality and screening response. Our calculations on a 5.75° twisted MoS_{2} bilayer show how large-scale GW methods include geometry relaxations and electronic correlations on an equal basis in structurally nontrivial materials.

Low-Scaling Algorithm for the Random Phase Approximation Using Tensor Hypercontraction with k-point Sampling

We present a low-scaling algorithm for the random phase approximation (RPA) with k-point sampling in the framework of tensor hypercontraction (THC) for electron repulsion integrals (ERIs). The THC factorization is obtained via a revised interpolative separable density fitting (ISDF) procedure with a momentum-dependent auxiliary basis for generic single-particle Bloch orbitals. Our formulation does not require preoptimized interpolating points or auxiliary bases, and the accuracy is systematically controlled by the number of interpolating points. The resulting RPA algorithm scales linearly with the number of k-points and cubically with the system size without any assumption on sparsity or locality of orbitals. The errors of ERIs and RPA energy show rapid convergence with respect to the size of the THC auxiliary basis, suggesting a promising and robust direction to construct efficient algorithms of higher order many-body perturbation theories for large-scale systems.

Interpolative Separable Density Fitting for Accelerating Two-Electron Integrals: A Theoretical Perspective

Low-rank approximations have long been considered an efficient way to accelerate electronic structure calculations associated with the evaluation of electron repulsion integrals (ERIs). As an accurate and efficient algorithm for compressing the ERI tensor, the interpolative separable density fitting (ISDF) decomposition has recently attracted great attention in this context. In this perspective, we introduce the ISDF decomposition from the theoretical aspects and technique details. The ISDF decomposition can construct a fully separable low-rank approximation (tensor hypercontraction factorization) of ERIs in real space with a cubic cost, offering great flexibility for accelerating high-scaling electronic structure calculations. We review the typical applications of ISDF in hybrid functionals, time-dependent density functional theory, and GW approximation. Finally, we discuss the promising directions for future development of ISDF.

Low-Rank Approximations Accelerated Plane-Wave Hybrid Functional Calculations with k-Point Sampling

The low-rank approximations of the adaptively compressed exchange (ACE) operator and interpolative separable density fitting (ISDF) algorithms significantly reduce the computational cost and memory usage of hybrid functional calculations in real space, but the lack of k-point sampling hinders their implementation in reciprocal space for periodic systems with the plane-wave basis set. Here, we combine the ACE operator and ISDF decomposition into a new ACE-ISDF algorithm for periodic systems in reciprocal space with k-point sampling. On the basis of the ACE-ISDF algorithm with the improved reciprocal space ACE operator and k-point Fourier convolution, the time complexity of the hybrid functional calculation is reduced from O(Ne4Nk2) to O(Ne3Nklog(Nk)) (N_e and N_k are the number of electrons and k-points, respectively) with a much smaller prefactor and much lower memory consumption compared to the standard method for periodic systems with a plane-wave basis set.