Efficient acceleration of the convergence of the Minimum Free Energy Path via path-planning generated initial guess

06 March 2024, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

We demonstrate how the combination of a shifted clustering algorithm and a fast-marching- based algorithm is able to generate good approximations of the Minimum Free Energy Path (MFEP) if a Free Energy Landscape (FEL) is given. Then, we show that using this kind of approximation as the MFEP’s first guess and the string method for further refinement (also called the FMT-string combined approach) cuts down on the number of iterations needed for the MFEP to converge by a large amount. This saves a lot of time compared to using a linear interpolation as the first guess. Such a method provides an efficient alternative to the growing string method for obtaining a good initial guess of the MFEP.

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.