A rapid dynamical Monte Carlo algorithm for glassy systems
- 21 September 1994
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 27 (18) , L715-L720
- https://doi.org/10.1088/0305-4470/27/18/012
Abstract
We present a dynamical Monte Carlo algorithm which is applicable to systems satisfying a clustering condition: during the dynamical evolution the system is mostly trapped in deep local minima (as happens in glasses, pinning problems etc). We compare the algorithm to the usual Monte Carlo algorithm using, as an example the Bernasconi model. In this model, a straightforward implementation of the algorithm gives an improvement of several orders of magnitude in computational speed with respect to a recent, already very efficient, implementation of the algorithm of Bortz et al. (1975).Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Logarithmically slow domain growth in nonrandomly frustrated systems: Ising models with competing interactionsPhysical Review B, 1992
- On a scaling law for the nonequilibrium relaxation of spin glassesJournal of Physics A: General Physics, 1992
- Low autocorrelation binary sequences : statistical mechanics and configuration space analysisJournal de Physique, 1987
- A new algorithm for Monte Carlo simulation of Ising spin systemsJournal of Computational Physics, 1975