Efficient Sparse Matrix Algorithm to Speed Up the Calculation of the Ladder Term in Coupled Cluster Programs

摘要

A new algorithm is presented for the calculation of the ladder-type term of the coupled cluster singles and doubles (CCSD) equations using two-electron integrals in atomic orbital (AO) basis. The method is based on an orbital grouping scheme, which results in an optimal partitioning of the AO integral matrix into sparse and dense blocks allowing efficient matrix multiplication. Carefully chosen numerical tests have been performed to analyze the performance of all aspects of the new algorithm. It is shown that the suggested scheme allows an efficient utilization of modern highly parallel architectures and devices in CCSD calculations. Details of the implementation in the development version of CFOUR quantum chemical program package are also presented.