Cluster algorithms

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.)

17 pages, Latex

References in corpus (6)

• Cluster Algorithm for Vertex Models
• Perfect lattice action for asymptotically free theories
• Multibondic Cluster Algorithm for Monte Carlo Simulations of First-Order Phase Transitions
• Multi-Grid Monte Carlo III. Two-Dimensional O(4)-Symmetric Nonlinear $\sigma$-Model
• Microcanonical cluster algorithms
• High precision single-cluster Monte Carlo measurement of the critical exponents of the classical 3D Heisenberg model

Cited by in corpus (3)

• Green's Functions from Quantum Cluster Algorithms
• On the efficient numerical solution of lattice systems with low-order couplings
• Recent progress on cluster and meron algorithms for strongly correlated systems