We present an efficient implementation of ground and excited state coupled cluster singles and doubles (CCSD) gradients based on Cholesky-decomposed electron repulsion integrals. Cholesky decomposition and density fitting are both inner projection methods, and, thus, similar implementation schemes can be applied for both methods. One well-known advantage of inner projection methods, which we exploit in our implementation, is that one can avoid storing large VO and V arrays by instead considering three-index intermediates. Furthermore, our implementation does not require the formation and storage of Cholesky vector derivatives. The new implementation is shown to perform well, with less than 10% of the time spent calculating the gradients in geometry optimizations. Furthermore, the computational time per optimization cycle is significantly lower compared to other implementations based on an inner projection method. We showcase the capabilities of the implementation by optimizing the geometry of the retinal molecule (CHO) at the CCSD/aug-cc-pVDZ level of theory.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1063/5.0087261 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!