NOTE ON THE METROPOLIS MONTE-CARLO METHOD ON RANDOM LATTICES

被引：2
|
作者：
TSUDA, N [1 ]
FUJITSU, A [1 ]
YUKAWA, T [1 ]
机构：
[1] NATL LAB HIGH ENERGY PHYS,KEK,TSUKUBA,IBARAKI 305,JAPAN
来源：
COMPUTER PHYSICS COMMUNICATIONS | 1995年 / 87卷 / 03期
关键词：
D O I：
10.1016/0010-4655(94)00129-P
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Efficiency of algorithms in the Metropolis Monte Carlo method is examined for the problem of random walks on random lattices. Three types of algorithms, which satisfy the detailed balance, are considered. The efficiency mainly depends on the relative ease in obtaining geometrical factors and Boltzmann factors. The most efficient algorithm for the dynamical triangulation of random surfaces is suggested.
引用
收藏
页码：372 / 374
页数：3
相关论文
共 50 条
12345