Parallel-tempering cluster algorithm for computer simulations of critical phenomena

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an adaptive routine to find the temperature window of interest,...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2011-07
Main Authors: Bittner, Elmar, Janke, Wolfhard
Format: Article
Language:English
Subjects:
Adaptive algorithms
Algorithms
Clusters
Computer simulation
Critical phenomena
Critical point
Ising model
Monte Carlo simulation
Phase transitions
Tempering
Three dimensional models
Two dimensional models
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an adaptive routine to find the temperature window of interest, we introduce a flexible and powerful method for systematic investigations of critical phenomena. As a result, we gain one to two orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.
ISSN:2331-8422
DOI:10.48550/arxiv.1107.5640