Abstract

We introduce a non-iterative energy correction, added on top of the rank-reduced coupled-cluster method with single, double, and triple substitutions, that accounts for excitations excluded from the parent triple excitation subspace. The formula for the correction is derived by employing the coupled-cluster Lagrangian formalism, with an additional assumption that the parent excitation subspace is closed under the action of the Fock operator. Owing to the rank-reduced form of the triple excitation amplitudes tensor, the computational cost of evaluating the correction scales as N7, where N is the system size. The accuracy and computational efficiency of the proposed method is assessed for both total and relative correlation energies. We show that the non-iterative correction can fulfill two separate roles. If the accuracy level of a fraction of kJ/mol is sufficient for a given system, the correction significantly reduces the dimension of the parent triple excitation subspace needed in the iterative part of the calculations. Simultaneously, it enables reproducing the exact CCSDT results to an accuracy level below 0.1 kJ/mol, with a larger, yet still reasonable, dimension of the parent excitation subspace. This typically can be achieved at a computational cost only several times larger than required for the CCSD(T) method. The proposed method retains the black-box features of the single-reference coupled-cluster theory; the dimension of the parent excitation subspace remains the only additional parameter that has to be specified.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.