arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cond-mat/0411368cond-mat.stat-mech
收藏

关于路径积分的Monte Carlo高效实现

On the efficient Monte Carlo implementation of path integrals

Cristian Predescu

摘要:

我们证明了李-特罗特产品的Levy-Ciesielski实现享有几个属性,使其非常适合路径积分蒙特卡罗模拟:快速计算的路径,快速蒙特卡罗采样,并能够使用不同数量的时间片为不同的自由度,相称的量子效应。它表明,一个蒙特卡罗模拟,粒子或小团体的变量以顺序的方式更新具有统计效率,总是可比或优于所有粒子或所有变量更新采样器。如果更新一个变量的成本只有同时更新所有变量的成本的一小部分,或者如果变量是独立的,则顺序采样器会导致显著的计算节省。在Levy-Ciesielski表示中,路径变量被分组在少量的层中,来自同一层的变量在统计上是独立的。优越的性能的快速采样算法被证明是这些意见的后果。数学参数和数值模拟,以量化的顺序采样器,路径积分的Levy-Ciesielski实现的计算优势,和快速采样算法。

英文摘要:

We demonstrate that the Levy-Ciesielski implementation of Lie-Trotter products enjoys several properties that make it extremely suitable for path-integral Monte Carlo simulations: fast computation of paths, fast Monte Carlo sampling, and the ability to use different numbers of time slices for the different degrees of freedom, commensurate with the quantum effects. It is demonstrated that a Monte Carlo simulation for which particles or small groups of variables are updated in a sequential fashion has a statistical efficiency that is always comparable to or better than that of an all-particle or all-variable update sampler. The sequential sampler results in significant computational savings if updating a variable costs only a fraction of the cost for updating all variables simultaneously or if the variables are independent. In the Levy-Ciesielski representation, the path variables are grouped in a small number of layers, with the variables from the same layer being statistically independent. The superior performance of the fast sampling algorithm is shown to be a consequence of these observations. Both mathematical arguments and numerical simulations are employed in order to quantify the computational advantages of the sequential sampler, the Levy-Ciesielski implementation of path integrals, and the fast sampling algorithm.

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

↑