Larini L, Mannella R, Leporini D
Dipartimento di Fisica Enrico Fermi, Università di Pisa, Largo B. Pontecorvo 3, I-56127 Pisa, Italy.
J Chem Phys. 2007 Mar 14;126(10):104101. doi: 10.1063/1.2464095.
Algorithms for the numerical integration of Langevin equations are compared in detail from the point of view of their accuracy, numerical efficiency, and stability to assess them as potential candidates for molecular-dynamics simulations of polymeric systems. Some algorithms are symplectic in the deterministic frictionless limit and prove to stabilize long time-step integrators. They are tested against other popular algorithms. The optimal algorithm depends on the main goal: accuracy or efficiency. The former depends on the observable of interest. A recently developed quasisymplectic algorithm with great accuracy in the position evaluation exhibits better overall accuracy and stability than the other ones. On the other hand, the well-known BrunGer-Brooks-Karplus [Chem. Phys. Lett. 105, 495 (1982)] algorithm is found to be faster with limited accuracy loss but less stable. It is also found that using higher-order algorithms does not necessarily improve the accuracy. Moreover, they usually require more force evaluations per single step, thus leading to poorer performances.
从准确性、数值效率和稳定性的角度,对朗之万方程数值积分算法进行了详细比较,以评估它们作为聚合物系统分子动力学模拟潜在候选算法的性能。一些算法在确定性无摩擦极限下是辛算法,并被证明能稳定长时间步长积分器。它们与其他常用算法进行了测试比较。最优算法取决于主要目标:准确性或效率。前者取决于感兴趣的可观测量。最近开发的一种在位置评估方面具有高精度的拟辛算法,与其他算法相比,具有更好的整体准确性和稳定性。另一方面,著名的BrunGer - Brooks - Karplus[《化学物理快报》105, 495 (1982)]算法在精度损失有限的情况下速度更快,但稳定性较差。还发现使用高阶算法不一定能提高准确性。此外,它们通常在每一步需要更多的力评估,从而导致性能较差。