Rejection-free Monte Carlo technique
- 7 September 1995
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 28 (17) , 4835-4842
- https://doi.org/10.1088/0305-4470/28/17/016
Abstract
An efficient rejection-free Monte Carlo algorithm for lattice systems is presented. In the microcanonical Monte Carlo technique, the sampling time grows prohibitively large due to a high rejection rate at low energies, as the size of the system increases. In this paper we report on an algorithm which improves the sampling efficiency enormously at low energies by selecting only sites which are acceptable for a trial move, thereby reducing the rejection rate to nil.Keywords
This publication has 9 references indexed in Scilit:
- Monte Carlo Algorithms with Absorbing Markov Chains: Fast Local Algorithms for Slow DynamicsPhysical Review Letters, 1995
- A new approach to an old algorithm for the Simulation of Ising-like SystemsComputers in Physics, 1995
- Finite-size scaling in the complex temperature plane applied to the three-dimensional Ising modelPhysical Review E, 1993
- Microcanonical Monte Carlo study of a two-dimensional Blume-Capel modelJournal of Physics A: General Physics, 1993
- Monte Carlo technique for universal finite-size-scaling functions: Application to the 3-state Potts model on a square latticePhysical Review Letters, 1992
- A new efficient Monte Carlo techniqueJournal of Physics A: General Physics, 1990
- Accurate estimate ofνfor the three-dimensional Ising model from a numerical measurement of its partition functionPhysical Review Letters, 1987
- Microcanonical Monte Carlo SimulationPhysical Review Letters, 1983
- A new algorithm for Monte Carlo simulation of Ising spin systemsJournal of Computational Physics, 1975