arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0102094math.NAcs.NA
收藏

后向蒙特卡洛方法的精度与收敛性

Accuracy and convergence of the backward Monte-Carlo method

Johan Carlsson

AI总结:

该论文验证并比较了后向与前向蒙特卡洛方法,指出后向方法在局部区域解中减少统计误差且避免插值误差,并通过修改运动方程改善时间收敛性。

摘要:

最近提出的后向蒙特卡洛方法[Johan Carlsson, arXiv:math.NA/0010118]通过分析简单模型方程的蒙特卡洛解的误差,进行了验证、基准测试,并与传统的前向蒙特卡洛方法进行了比较。特别地,展示了在仅对相空间一小部分区域的解感兴趣这一常见情况下,后向方法如何减少统计误差。前向方法需要对粒子进行分箱,而箱之间的线性插值会引入额外误差。通过减小箱尺寸来降低此误差会增加统计误差。后向方法不受此冲突影响。最后,展示了通过对控制随机粒子轨迹的蒙特卡洛运动方程进行微小修改,可以改善后向方法较差的时间收敛性。该方案不适用于传统的前向方法。

英文摘要:

The recently introduced backward Monte-Carlo method [Johan Carlsson, arXiv:math.NA/0010118] is validated, benchmarked, and compared to the conventional, forward Monte-Carlo method by analyzing the error in the Monte-Carlo solutions to a simple model equation. In particular, it is shown how the backward method reduces the statistical error in the common case where the solution is of interest in only a small part of phase space. The forward method requires binning of particles, and linear interpolation between the bins introduces an additional error. Reducing this error by decreasing the bin size increases the statistical error. The backward method is not afflicted by this conflict. Finally, it is shown how the poor time convergence can be improved for the backward method by a minor modification of the Monte-Carlo equation of motion that governs the stochastic particle trajectories. This scheme does not work for the conventional, forward method.

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

↑