Reliable Transition State Searches Integrated with the Growing String Method

Citations Over TimeTop 10% of 2013 papers

Abstract

The growing string method (GSM) is highly useful for locating reaction paths connecting two molecular intermediates. GSM has often been used in a two-step procedure to locate exact transition states (TS), where GSM creates a quality initial structure for a local TS search. This procedure and others like it, however, do not always converge to the desired transition state because the local search is sensitive to the quality of the initial guess. This article describes an integrated technique for simultaneous reaction path and exact transition state search. This is achieved by implementing an eigenvector following optimization algorithm in internal coordinates with Hessian update techniques. After partial convergence of the string, an exact saddle point search begins under the constraint that the maximized eigenmode of the TS node Hessian has significant overlap with the string tangent near the TS. Subsequent optimization maintains connectivity of the string to the TS as well as locks in the TS direction, all but eliminating the possibility that the local search leads to the wrong TS. To verify the robustness of this approach, reaction paths and TSs are found for a benchmark set of more than 100 elementary reactions.

Related Papers

• → Higher-accuracy schemes for approximating the Hessian from electronic structure calculations in chemical dynamics simulations(2010)39 cited
• → Structure and Efficient Hessian Calculation(1998)11 cited
• → An Evaluation of Parallel Numerical Hessian Calculations(2010)2 cited
• → Second-order adjoint sensitivities(2017)
• → On the connection between WRI and FWI: Analysis of the nonlinear term in the Hessian matrix(2022)