Title of article
Efficient cluster algorithm for image models Original Research Article
Author/Authors
B.B. Beard، نويسنده , , M. Pepe، نويسنده , , S. Riederer، نويسنده , , U.-J. Wiese، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2006
Pages
6
From page
629
To page
634
Abstract
Despite several attempts, no efficient cluster algorithm has been constructed for image models in the standard Wilson formulation of lattice field theory. In fact, there is a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm. In this paper, we construct an efficient cluster algorithm for ferromagnetic image-symmetric quantum spin systems. Such systems provide a regularization for image models in the framework of D-theory. We present detailed studies of the autocorrelations and find a dynamical critical exponent that is consistent with image.
Keywords
Spontaneous symmetry breaking , Critical slowing down , CP(N?1) models , Cluster algorithm , Dimensional reduction
Journal title
Computer Physics Communications
Serial Year
2006
Journal title
Computer Physics Communications
Record number
1137125
Link To Document