Efficient singular-value decomposition of the coupled-cluster triple excitation amplitudes
Michal Lesiuk

TL;DR
This paper introduces a novel SVD technique for coupled-cluster triple excitation amplitudes that efficiently compresses data and accelerates CC3 calculations, achieving chemical accuracy with minimal singular vectors.
Contribution
The paper presents a new Golub-Kahan bidiagonalisation-based SVD method for coupled-cluster amplitudes that does not require storing the full tensor, enabling efficient approximations in quantum chemistry.
Findings
Achieves chemical accuracy with only 5-15% of SVD vectors.
Compresses triple excitation amplitudes by a factor of 0.0001-0.005.
Applicable to small and medium-sized molecular systems.
Abstract
We demonstrate a novel technique to obtain singular-value decomposition (SVD) of the coupled-cluster triple excitations amplitudes, . The presented method is based on the Golub-Kahan bidiagonalisation strategy and does not require to be stored. The computational cost of the method is comparable to several CCSD iterations. Moreover, the number of singular vectors to be found can be predetermined by the user and only those singular vectors which correspond to the largest singular values are obtained at convergence. We show how the subspace of the most important singular vectors obtained from an approximate triple amplitudes tensor can be used to solve equations of the CC3 method. The new method is tested for a set of small and medium-sized molecular systems in basis sets ranging in quality from double- to quintuple-zeta. It is found that to reach the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
