A parallel implementation of the Wang-Landau algorithm

DOI10.1016/J.CPC.2008.04.002zbMATH Open1197.82018OpenAlexW1966683416MaRDI QIDQ711142FDOQ711142

Authors: Lixin Zhan 

Publication date: 25 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2008.04.002

Recommendations

• Wang-Landau algorithm: an adapted random walk to boost convergence
• Wang-Landau sampling: saving CPU time
• Convergence and refinement of the Wang-Landau algorithm
• Stochastic Approximation in Monte Carlo Computation
• An introduction to Monte Carlo methods in statistical physics

zbMATH Keywords

Monte Carlodistributed computingWang-Landau

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Software, source code, etc. for problems pertaining to statistical mechanics (82-04) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Transition matrix Monte Carlo method
• Determining the density of states for classical statistical models by a flat-histogram random walk

Cited In (8)

• Computer simulation of two continuous spin models using Wang-Landau-transition-matrix Monte Carlo algorithm
• Multicanonical MCMC for sampling rare events: an illustrative review
• Application of Wang-Landau sampling to a protein model using SMMP
• Density of states of the Ising model in the field
• Simple parallel algorithms for single-site dynamics
• Polymer collapse of a self-avoiding trail model on a two-dimensional inhomogeneous lattice
• A portable and flexible implementation of the Wang-Landau algorithm in order to determine the density of states
• Wang-Landau sampling: saving CPU time

This page was built for publication: A parallel implementation of the Wang-Landau algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711142)