Parallel algorithms for coupled-cluster methods

Sathyawageeswar Subramanian, Yudong Cao

Edgar Solomonik, Devin A. Matthews, Jeff R. Hammond +2 more

Toru Shiozaki

Dipayan Datta, Mark S. Gordon

Efficient scalable implementations are presented for two single-reference coupled-cluster (CC) methods with non-iterative corrections for triple excitations, which accurately describe single bond dissociations in molecules in contrast to the standard CCSD(T) approach. These methods are (a) the completely renormalized coupled-cluster theory, CR-CC(2,3), and (b) the ΛCCSD(T) approach, the triples energy corrections in both of which are formulated using the left eigenvector of the CC similarity transformed Hamiltonian. The density fitting approximation is employed for factorizing the two-electron repulsion integrals (ERIs), which eliminates memory bottlenecks associated with the storage of the four-index ERIs by allowing an integral-direct algorithm. Massively parallel algorithms have been developed for the above methods within the GAMESS quantum chemistry program using a hybrid MPI and OpenMP based parallelization model. All compute-intensive steps in the CCSD amplitude and the left eigenvector equations, as well as the triples corrections in both methods, have been adapted to execute on graphical processing units (GPUs) using the OpenMP target directives. Performance of these codes is demonstrated on petascale supercomputers equipped with NVIDIA A100 GPUs. While the CR-CC(2,3) and ΛCCSD(T) computations take roughly twice as much time as the standard CCSD(T) method, the GPU-offloaded codes are shown to impart 3.5-5× accelerations relative to the CPU-only parallel codes, thereby significantly reducing the time-to-solution for the CR-CC(2,3) and ΛCCSD(T) methods.

J. S. Spencer, V. A. Neufeld, W. A. Vigor +2 more

Coupled cluster theory is a vital cornerstone of electronic structure theory and is being applied to ever-larger systems. Stochastic approaches to quantum chemistry have grown in importance and offer compelling advantages over traditional deterministic algorithms in terms of computational demands, theoretical flexibility, or lower scaling with system size. We present a highly parallelizable algorithm of the coupled cluster Monte Carlo method involving sampling of clusters of excitors over multiple time steps. The behavior of the algorithm is investigated on the uniform electron gas and the water dimer at coupled-cluster levels including up to quadruple excitations. We also describe two improvements to the original sampling algorithm, full non-composite, and multi-spawn sampling. A stochastic approach to coupled cluster results in an efficient and scalable implementation at arbitrary truncation levels in the coupled cluster expansion.

R. Guardiola, I. Moliner, Jesús Navarro +1 more