Transition matrix cluster algorithms

We demonstrate that a series of procedures for increasing the efficiency of transition matrix calculations can be realized by integrating the standard single-spin flip transition matrix method with global cluster flipping techniques. Our calculations employ a simple and accurate method based on deta...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of modern physics. C, Computational physics, physical computation Vol. 30; no. 1; p. 1950004
Main Authors Yevick, David, Lee, Yong Hwan
Format Journal Article
LanguageEnglish
Published Singapore World Scientific Publishing Company 01.01.2019
World Scientific Publishing Co. Pte., Ltd
Subjects
Algorithms
Clusters
Computing time
Ising model
Markov analysis
phase transitions
statistical physics
cluster algorithms
Monte-Carlo methods
transition matrix methods
Online AccessGet full text
ISSN0129-1831
1793-6586
DOI10.1142/S0129183119500049

Cover

More Information
Summary:We demonstrate that a series of procedures for increasing the efficiency of transition matrix calculations can be realized by integrating the standard single-spin flip transition matrix method with global cluster flipping techniques. Our calculations employ a simple and accurate method based on detailed balance for computing the density of states from the Ising model transition matrix.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0129-1831
1793-6586
DOI:10.1142/S0129183119500049