Convergence of stochastic approximation Monte Carlo and modified Wang-Landau algorithms: tests for the Ising model
From MaRDI portal
Publication:2414426
DOI10.1016/J.CPC.2017.02.002zbMath1411.65175arXiv1702.00752OpenAlexW2587710278MaRDI QIDQ2414426
Simon Schneider, Wolfhard Janke, Marco K. Müller
Publication date: 13 May 2019
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.00752
Monte Carlo methods (65C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- A theory on flat histogram Monte Carlo algorithms
- Beitrag zur Theorie des Ferromagnetismus
- Stochastic Approximation in Monte Carlo Computation
- Stability of Stochastic Approximation under Verifiable Conditions
- Crystal Statistics. II. Partition Function Evaluated by Spinor Analysis
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
This page was built for publication: Convergence of stochastic approximation Monte Carlo and modified Wang-Landau algorithms: tests for the Ising model