Abstract

The recently proposed renormalized (R) and completely renormalized (CR) coupled-cluster (CC) methods of the CCSD[T] and CCSD(T) types have been implemented using recursively generated intermediates and fast matrix multiplication routines. The details of this implementation, including the complete set of equations that have been used in writing efficient computer codes, memory requirements, and typical CPU timings, are discussed. The R-CCSD[T], R-CCSD(T), CR-CCSD[T], and CR-CCSD(T) computer codes and similar codes for the standard CC methods, including the LCCD, CCD, CCSD, CCSD[T], and CCSD(T) approaches, have been incorporated into the gamess package. Information about the main features of this new set of CC programs is provided.

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.