• DOI:10.1063/1.4984322
• Corpus ID: 22969376

Optimization of the linear-scaling local natural orbital CCSD(T) method: Redundancy-free triples correction using Laplace transform.

@article{Nagy2017OptimizationOT,
  title={Optimization of the linear-scaling local natural orbital CCSD(T) method: Redundancy-free triples correction using Laplace transform.},
  author={P{\'e}ter R. Nagy and Mih{\'a}ly K{\'a}llay},
  journal={The Journal of chemical physics},
  year={2017},
  volume={146 21},
  pages={
          214106
        }
}

• P. Nagy, Mihály Kállay
• Published 1 June 2017
• Chemistry
• The Journal of chemical physics

An improved algorithm is presented for the evaluation of the (T) correction as a part of our local natural orbital (LNO) coupled-cluster singles and doubles with perturbative triples [LNO-CCSD(T)] scheme [Z. Rolik et al., J. Chem. Phys. 139, 094105 (2013)]. The new algorithm is an order of magnitude faster than our previous one and removes the bottleneck related to the calculation of the (T) contribution. First, a numerical Laplace transformed expression for the (T) fragment energy is introduced, which requires on average 3 to 4 times fewer floating point operations with negligible compromise in accuracy eliminating the redundancy among the evaluated triples amplitudes. Second, an additional speedup factor of 3 is achieved by the optimization of our canonical (T) algorithm, which is also executed in the local case. These developments can also be integrated into canonical as well as alternative fragmentation-based local CCSD(T) approaches with minor modifications. As it is demonstrated by our benchmark calculations, the evaluation of the new Laplace transformed (T) correction can always be performed if the preceding CCSD iterations are feasible, and the new scheme enables the computation of LNO-CCSD(T) correlation energies with at least triple-zeta quality basis sets for realistic three-dimensional molecules with more than 600 atoms and 12 000 basis functions in a matter of days on a single processor.