Convergence and refinement of the Wang–Landau algorithm
- 1 July 2006
- journal article
- Published by Elsevier in Computer Physics Communications
- Vol. 175 (1) , 36-40
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- A new approach to Monte Carlo simulations in statistical physics: Wang-Landau samplingAmerican Journal of Physics, 2004
- Broad histogram relation for the bond number and its applicationsPhysical Review E, 2002
- Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogramPhysical Review E, 2001
- Three-dimensional antiferromagneticq-state Potts models: application of the Wang-Landau algorithmJournal of Physics A: General Physics, 2001
- Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of StatesPhysical Review Letters, 2001
- Monte Carlo algorithms based on the number of potential movesComputer Physics Communications, 2000
- Broad histogram Monte CarloThe European Physical Journal B, 1998
- New Monte Carlo algorithm: Entropic samplingPhysical Review Letters, 1993
- Multicanonical algorithms for first order phase transitionsPhysics Letters B, 1991
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953