Multiple Walkers in the Wang-Landau Algorithm
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.
- Research Organization:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- DE-AC05-00OR22725
- OSTI ID:
- 885956
- Report Number(s):
- ORNL/TM-2005/1; TRN: US200617%%269
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance of Replica-Exchange Wang-Landau Sampling for the 2D Ising Model: A Brief Survey
Phase transitions in a Ginzburg-Landau model and a kagome antiferromagnet