Cluster algorithms
Ferenc Niedermayer
Abstract
Cluster algorithms for classical and quantum spin systems are discussed. In particular, the cluster algorithm is applied to classical O(N) lattice actions containing interactions of more than two spins. The performance of the multi-cluster and single--cluster methods, and of the standard and improved estimators are compared. (Lecture given at the summer school on `Advances in Computer Simulations', Budapest, July 1996.)
Create a lesson
Related papers
Evidence of Taste-Symmetry restoration for Kähler-Dirac fermions on Euclidean Dynamical Triangulations
Mingwei Dai, Walter Freeman, Mason Grieb et al.
Hamiltonian framework for Chiral Gauge Theories on a Disk Boundary
Srimoyee Sen
Finite-size scaling analysis of three dimensional Z(2) and O(2) spin models with non-vanishing symmetry breaking parameter
Jishnu Goswami, Frithjof Karsch, Sabarnya Mitra
Bjorken sum rule down to the elastic region from the lattice
J. A. Crawford, A. Hannaford-Gunn, R. Horsley et al.
Performance Portable SU(N) Lattice Gauge Theory Simulation with Kokkos
Wei Sun
Sampling SU(N) gauge theory on a 2D lattice from independent plaquettes via holonomies and corner reweighting
Javad Komijani