Morozov Alexander N, Lin Sheng Hsien
Institute of Atomic and Molecular Sciences, Academia Sinica, P.O. Box 23-166, Taipei, Taiwan, Republic of China.
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Aug;76(2 Pt 2):026701. doi: 10.1103/PhysRevE.76.026701. Epub 2007 Aug 1.
We present estimations of the accuracy and convergence of the Wang-Landau algorithm. Both accuracy and the related length of the Monte Carlo run depend on the modification parameter f and the density of states. The analytical solution obtained for the two-level system was checked numerically on the two-dimensional Ising model. Although the two-level system is a very simple one, it appears that the proposed solution describes the generic features of the Wang-Landau algorithm. The estimations should prove useful in Monte Carlo calculations of protein folding, first-order transitions, and other systems with a rough energy landscape.
我们给出了王-兰道算法的精度和收敛性估计。精度以及蒙特卡罗模拟运行的相关时长均取决于修正参数f和态密度。针对两能级系统得到的解析解在二维伊辛模型上进行了数值检验。尽管两能级系统非常简单，但所提出的解似乎描述了王-兰道算法的一般特征。这些估计在蛋白质折叠、一级相变以及其他具有粗糙能量景观的系统的蒙特卡罗计算中应会证明是有用的。
