Convergence improvement for coupled cluster calculations
N. Mosyagin, E. Eliav, U. Kaldor
Abstract
Convergence problems in coupled-cluster iterations are discussed, and a new iteration scheme is proposed. Whereas the Jacobi method inverts only the diagonal part of the large matrix of equation coefficients, we invert a matrix which also includes a relatively small number of off-diagonal coefficients, selected according to the excitation amplitudes undergoing the largest change in the coupled cluster iteration. A test case shows that the new IPM (inversion of partial matrix) method gives much better convergence than the straightforward Jacobi-type scheme or such well-known convergence aids as the reduced linear equations or direct inversion in iterative subspace methods.
Create a lesson
Related papers
When optimized geometries are not optimal: Implications for inverted singlet-triplet gap predictions
Atreyee Majumdar, Elamathi Selvan Samynathan, Raghunathan Ramakrishnan
Open-shell Configuration State Functions as trial states for phaseless auxiliary-field quantum Monte Carlo
Don Danilov, Hugh G. A. Burton, James Shee
Machine Learning the Complete Active-Space Wavefunction Reconstruction
Aniruddha Seal, Bhavnesh Jangid, Helen S. Clifford et al.
Brueckner Orbitals in Local Pair Natural Orbital Coupled-Cluster Theory: DLPNO-BCCD(T) and DLPNO-BCCD(T)Lambda2
Andy Jiang, Tibor Gyori, Elizabeth C. Toth et al.
Exact periodic electrostatics for latent-charge machine-learning potentials
Eslam Ibrahim
Exploiting floating point emulation in tensor contractions in relativistic coupled cluster theory
Maxime Le, Ryan Benazzouk, Jan Brandejs et al.