title: Superlinearly converging dimer method for transition state search.
abstract: Algorithmic improvements of the dimer method [G. Henkelman and H. Jonsson, J. Chem. Phys. 111, 7010 (1999)] are described in this paper. Using the limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) optimizer for the dimer translation greatly improves the convergence compared to the previously used conjugate gradient algorithm. It also saves one energy and gradient calculation per dimer iteration. Extrapolation of the gradient during repeated dimer rotations reduces the computational cost to one gradient calculation per dimer rotation. The L-BFGS algorithm also improves convergence of the rotation. Thus, three to four energy and gradient evaluations are needed per iteration at the beginning of a transition state search, while only two are required close to convergence. Moreover, we apply the dimer method in internal coordinates to reduce coupling between the degrees of freedom. Weighting the coordinates can be used to apply chemical knowledge about the system and restrict the transition state search to only part of the system while minimizing the remainder. These improvements led to an efficient method for the location of transition states without the need to calculate the Hessian. Thus, it is especially useful in large systems with expensive gradient evaluations.
authors.affiliation: Computational Science and Engineering Department, STFC Daresbury Laboratory, Daresbury, Warrington WA4 4AD, United Kingdom. j.kaestner@dl.ac.uk
authors.forename: Johannes
authors.initials: J
authors.lastname: Kästner
authors.forename: Paul
authors.initials: P
authors.lastname: Sherwood