Multiple Walkers in the Wang-Landau Algorithm

Brown, G

Oak Ridge National Laboratory

关键词: Ising Model;    99 General And Miscellaneous//Mathematics, Computing, And Information Science;    36 Materials Science;    Algorithms;    Magnetic Materials;   

DOI  :  10.2172/885956
RP-ID  :  ORNL/TM-2005/1
RP-ID  :  DE-AC05-00OR22725
RP-ID  :  885956

美国|英语

来源: UNT Digital Library

【 摘 要 】

The mean cost for converging an estimated density of states using the Wang-Landau algorithm is measured for the Ising and Heisenberg models. The cost increases in a power-law fashion with the number of spins, with an exponent near 3 for one-dimensional models, and closer to 2.4 for two-dimensional models. The effect of multiple, simultaneous walkers on the cost is also measured. For the one-dimensional Ising model the cost can increase with the number of walkers for large systems. For both the Ising and Heisenberg models in two-dimensions, no adverse impact on the cost is observed. Thus multiple walkers is a strategy that should scale well in a parallel computing environment for many models of magnetic materials.