Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Modern Physics C

LATTICE SPIN MODELS AND NEW ALGORITHMS — A REVIEW OF MONTE CARLO COMPUTER SIMULATIONS

CLIVE F. BAILLIE

Published Apr 1, 1990• 27 citations
Publisher

Abstract

We review Monte Carlo computer simulations of spin models — both discrete and continuous. We explain the phenomenon of critical slowing which seriously degrades the efficiency of standard local Monte Carlo algorithms such as the Metropolis algorithm near phase transitions. We then go onto describe in detail the new algorithms which ameliorate the problem of critical slowing down, and give their dynamical critical exponent values.

DOI
10.1142/s0129183190000050

Related papers

HIGH SPEED ALGORITHMS AND SIMULATIONS OF THE CRITICAL DYNAMICS OF THE ISING MODEL

Hans-Otto Heuer

We review the development of Monte Carlo algorithms for the simulation of the Ising model with local dynamics. The multi lattice coding algorithm for the pure and for the site-disordered Ising model is described in detail. Application of these algorithms on fast vector computers have led to new progress concerning the critical dynamics of the pure Ising model leading to the critical exponent z = 2:05. The importance of disorder for the critical dynamics of the Ising model has been investigated recently. We review the numerical results and compare with theoretical predictions. A crossover scenario is found as for the static behavior with an effective dynamical exponent z = 1:75 fl. 1 Introduction The Ising model is a standard model in statistical physics for the description of a ferromagnet in an extremely simplified manner. It is assumed that quantum spin operators may be replaced by classical spins S i = \\Sigma 1 which are oriented parallel or antiparallel to a magnetic filed H: H...

WORLD SCIENTIFIC eBooks•May 1, 1996•1 citation

Nonuniversal critical dynamics in Monte Carlo simulations

Robert H. Swendsen, Jian‐Sheng Wang

A new approach to Monte Carlo simulations is presented, giving a highly efficient method of simulation for large systems near criticality. The algorithm violates dynamic universality at second-order phase transitions, producing unusually small values of the dynamical critical exponent.

Physical Review Letters•Jan 12, 1987•2,848 citations

Cluster Algorithms for Spin Models on MIMD Parallel Computers

Paul David Coddington, CLIVE F. BAILLIE

Parallel computers are ideally suited to the Monte Carlo simulation of spin models using the standard Metropolis algorithm, since it is regular and local. However local algorithms have the major drawback that near a phase transition the number of sweeps needed to generate a statistically independent configuration increases as the square of the lattice size. New algorithms have recently been developed which dramatically reduce this `critical slowing down' by updating clusters of spins at a time. The highly irregular and non-local nature of these algorithms means that they are much more difficult to parallelize efficiently. Here we introduce the new cluster algorithms, explain some sequential algorithms for identifying and labelling connected clusters of spins, and then outline some parallel algorithms which have been implemented on MIMD machines. 1. Introduction Computer simulations are extremely useful in the study of spin models in condensed matter physics. In these models the spins ...

Distributed Memory Computing Conference•Aug 24, 2005•7 citations

QUANTUM MONTE-CARLO SIMULATIONS - ALGORITHMS, LIMITATIONS AND APPLICATIONS

Hans A. De Raedt

A survey is given of Quantum Monte Carlo methods currently used to simulate quantum lattice models. The formalisms employed to construct the simulation algorithms are sketched. The origin of fundamental (minus sign) problems which limit the applicability of the Quantum Monte Carlo approach is shown to be a generic feature of the formalisms used to devise the simulation algorithms. A brief overview of recent new developments is given.

Helvetica Physica Acta (Switzerland)•Jan 1, 1992•0 citations

Acceleration Algorithms in Monte Carlo Simulations in Statistical Physics

Robert H. Swendsen

Monte Carlo simulations of thermodynamic phase transitions are usually hampered by long relaxation times due to the phenomenon of “critical slowing down.” Using a mapping due to Fortuin and Kasteleyn, a cluster approach to Monte Carlo simulations has been developed, which greatly reduces relaxation times, improving efficiency by up to two or three orders of magnitude. New developments and extensions of this approach are also discussed.

International Journal of Modern Physics C•Mar 1, 1991•1 citation

MONTE CARLO STUDIES OF DYNAMIC CRITICAL PHENOMENA

D. P. Landau, Simon Y. Tang, Stephan Wansleben

We review the current state of knowledge of dynamic critical phenomena in simple magnetic models and present high statistics Monte Carlo data for critical slowing down in Ising and Potts models in two and three dimensions. By fitting the relaxation functions to multi-exponential decays at the critical temperature and applying finite size scaling we are able to extract very accurate estimates for the dynamical critical exponent z. Our results are compared with previous numerical estimates and with the predictions of renormalization group theory.

Le Journal de Physique Colloques•Dec 1, 1988•10 citations
We review Monte Carlo computer simulations of spin models — both discrete and continuous. We explain the phenomenon of critical slowing which seriously degrades the efficiency of standard local Monte Carlo algorithms such as the Metropolis algorithm near phase transitions. We then go onto describe in detail the new algorithms which ameliorate the problem of critical slowing down, and give their dynamical critical exponent values.
We review the development of Monte Carlo algorithms for the simulation of the Ising model with local dynamics. The multi lattice coding algorithm for the pure and for the site-disordered Ising model is described in detail. Application of these algorithms on fast vector computers have led to new progress concerning the critical dynamics of the pure Ising model leading to the critical exponent z = 2:05. The importance of disorder for the critical dynamics of the Ising model has been investigated recently. We review the numerical results and compare with theoretical predictions. A crossover scenario is found as for the static behavior with an effective dynamical exponent z = 1:75 fl. 1 Introduction The Ising model is a standard model in statistical physics for the description of a ferromagnet in an extremely simplified manner. It is assumed that quantum spin operators may be replaced by classical spins S i = \\Sigma 1 which are oriented parallel or antiparallel to a magnetic filed H: H...
Parallel computers are ideally suited to the Monte Carlo simulation of spin models using the standard Metropolis algorithm, since it is regular and local. However local algorithms have the major drawback that near a phase transition the number of sweeps needed to generate a statistically independent configuration increases as the square of the lattice size. New algorithms have recently been developed which dramatically reduce this `critical slowing down' by updating clusters of spins at a time. The highly irregular and non-local nature of these algorithms means that they are much more difficult to parallelize efficiently. Here we introduce the new cluster algorithms, explain some sequential algorithms for identifying and labelling connected clusters of spins, and then outline some parallel algorithms which have been implemented on MIMD machines. 1. Introduction Computer simulations are extremely useful in the study of spin models in condensed matter physics. In these models the spins ...
We review the current state of knowledge of dynamic critical phenomena in simple magnetic models and present high statistics Monte Carlo data for critical slowing down in Ising and Potts models in two and three dimensions. By fitting the relaxation functions to multi-exponential decays at the critical temperature and applying finite size scaling we are able to extract very accurate estimates for the dynamical critical exponent z. Our results are compared with previous numerical estimates and with the predictions of renormalization group theory.