Wang-Landau sampling: saving CPU time

DOI10.1016/J.JCP.2018.01.003MaRDI QIDQ1699501zbMATH OpenOpenAlexFDO

Authors L. S. Ferreira, L. N. Jorge, A. A. Caparica, S. A. Leão

Publication date 23 February 2018

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcp.2018.01.003

zbMATH Keywords

CPU timethreshold of convergenceWang-Landau method

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• A parallel implementation of the Wang-Landau algorithm
• Accelerated algorithms. I: Lattice models
• Efficiency of the Wang-Landau algorithm: a simple test case
• An introduction to Monte Carlo methods in statistical physics
• Wang-Landau algorithm: an adapted random walk to boost convergence

Cites work

• scientific article; zbMATH DE number 2061732 (Why is no real title available?)
• Convergence and refinement of the Wang-Landau algorithm
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
• Static critical behavior of the \(q\)-states Potts model: high-resolution entropic study
• The rubber band revisited: Wang-Landau simulation

Cited in

(2)

• A parallel implementation of the Wang-Landau algorithm
• Wang-Landau simulations with non-flat distributions

This page was built for publication: Wang-Landau sampling: saving CPU time

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