arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0903.2954cond-mat.stat-mech
收藏

硬球系统的事件链蒙特卡罗算法

Event-chain Monte Carlo algorithms for hard-sphere systems

Etienne P. Bernard, Werner Krauth, David B. Wilson

摘要:

本文提出了事件链算法,这是硬球及相关系统的快速马尔可夫链蒙特卡罗方法。在这些无排斥方法的单个移动中,任意长的粒子链被移位,并且可以诱导长距离相干运动。数值模拟表明,事件链算法明显优于传统的大都会方法。算法的不可逆版本违反了细致平衡,进一步提高了方法的速度。我们还比较了我们的方法与最近实现的分子动力学算法。

英文摘要:

In this paper we present the event-chain algorithms, which are fast Markov-chain Monte Carlo methods for hard spheres and related systems. In a single move of these rejection-free methods, an arbitrarily long chain of particles is displaced, and long-range coherent motion can be induced. Numerical simulations show that event-chain algorithms clearly outperform the conventional Metropolis method. Irreversible versions of the algorithms, which violate detailed balance, improve the speed of the method even further. We also compare our method with a recent implementations of the molecular-dynamics algorithm.

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

↑