We extend the local exchange (LK) algorithm [Aquilante, F.; Pedersen, T. B.; Lindh, R. J. Chem. Phys.2007, 126, 194106] to the calculation of analytical gradients with density fitting. We discuss the features of the screening procedure and demonstrate the possible advantages of using this formulation, which is easily interfaced to a standard integral-direct gradient code. With auxiliary basis sets obtained from Cholesky decomposition of atomic or molecular integral blocks with a decomposition threshold of 10–4Eh, typical errors due to the density fitting in bond lengths, bond angles, and dihedral angles are 0.1 pm, 0.1°, and 0.5°, respectively. The overall speedup of geometry optimizations is about 1 order of magnitude for atomic natural-orbital-type basis sets but much less pronounced for correlation-consistent basis sets.
Jonas Boström, Francesco Aquilante, Thomas Bondo Pedersen, Roland Lindh (2013). Analytical Gradients of Hartree–Fock Exchange with Density Fitting Approximations. JOURNAL OF CHEMICAL THEORY AND COMPUTATION, 9, 204-212 [10.1021/ct200836x].
Analytical Gradients of Hartree–Fock Exchange with Density Fitting Approximations
AQUILANTE, FRANCESCO;
2013
Abstract
We extend the local exchange (LK) algorithm [Aquilante, F.; Pedersen, T. B.; Lindh, R. J. Chem. Phys.2007, 126, 194106] to the calculation of analytical gradients with density fitting. We discuss the features of the screening procedure and demonstrate the possible advantages of using this formulation, which is easily interfaced to a standard integral-direct gradient code. With auxiliary basis sets obtained from Cholesky decomposition of atomic or molecular integral blocks with a decomposition threshold of 10–4Eh, typical errors due to the density fitting in bond lengths, bond angles, and dihedral angles are 0.1 pm, 0.1°, and 0.5°, respectively. The overall speedup of geometry optimizations is about 1 order of magnitude for atomic natural-orbital-type basis sets but much less pronounced for correlation-consistent basis sets.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.