arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.01241cond-mat.dis-nncond-mat.mtrl-scicond-mat.softcond-mat.stat-mech
收藏

复杂景观中鞍点的定位方法

Methods to locate Saddle Points in Complex Landscapes

Silvia Bonfanti, Walter Kob

摘要:

我们提出了一类简单的算法,可以找到一个复杂的势能景观系统中的反应路径。该方法不需要任何关于产品状态的知识,也不需要计算任何二阶导数。其基本思想是使用配置空间中的两个邻近点来定位最慢上升的路径。通过引入弱噪声项,该算法能够找到最慢上升路径所不能到达的低位鞍点,并且由于该算法只利用了势的值及其梯度,因此,如果势是短程的,则寻找鞍点的计算量与自由度成线性关系。我们测试了两个势能景观的算法的性能。对于Müller-Brown曲面,我们发现该算法总能找到正确的鞍点。对于修正的Müller-Brown曲面,它有一个鞍点,是不能通过最慢的上升路径到达,该算法仍然能够找到这个鞍点的概率很高。

英文摘要:

We present a class of simple algorithms that allows to find the reaction path in systems with a complex potential energy landscape. The approach does not need any knowledge on the product state and does not require the calculation of any second derivatives. The underlying idea is to use two nearby points in configuration space to locate the path of slowest ascent. By introducing a weak noise term, the algorithm is able to find even low-lying saddle points that are not reachable by means of a slowest ascent path. Since the algorithm makes only use of the value of the potential and its gradient, the computational effort to find saddles is linear in the number of degrees of freedom, if the potential is short-ranged. We test the performance of the algorithm for two potential energy landscapes. For the Müller-Brown surface we find that the algorithm always finds the correct saddle point. For the modified Müller-Brown surface, which has a saddle point that is not reachable by means of a slowest ascent path, the algorithm is still able to find this saddle point with high probability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑