Applications of Geometric Cluster Algorithms

We formulate the geometric cluster algorithm in terms of geometric symmetry operations, and specify the conditions that make it possible to formulate a proof of detailed balance. The nonlocal nature of this algorithm allows the construction of algorithms with a reduced critical slowing down. We disc...

Full description

Saved in:
Bibliographic Details
Published inDifferential Geometry And Physics pp. 142 - 151
Main Authors BLÖTE, H. W. J., DENG, Y., HERINGA, J. R.
Format Book Chapter
LanguageEnglish
Published WORLD SCIENTIFIC 01.12.2006
Subjects
Invited Contributions
Online AccessGet full text
ISBN9789814476584
9789812772527
9812703772
9789812703774
9812772529
9814476587
DOI10.1142/9789812772527_0008

Cover

More Information
Summary:We formulate the geometric cluster algorithm in terms of geometric symmetry operations, and specify the conditions that make it possible to formulate a proof of detailed balance. The nonlocal nature of this algorithm allows the construction of algorithms with a reduced critical slowing down. We discuss the possibilities that arise for the construction of efficient algorithms and review some phenomena that can be investigated in more detail than is possible by simulation algorithms of a local nature. In particular we focus on systems with a conserved quantity which are subject to the Fisher renormalization phenomenon.
ISBN:9789814476584
9789812772527
9812703772
9789812703774
9812772529
9814476587
DOI:10.1142/9789812772527_0008