A comparison of updating algorithms for large N reduced models

Abstract

We investigate Monte Carlo updating algorithms for simulating $SU(N)$ Yang-Mills fields on a single-site lattice, such as for the Twisted Eguchi-Kawai model (TEK). We show that performing only over-relaxation (OR) updates of the gauge links is a valid simulation algorithm for the Fabricius and Haan formulation of this model, and that this decorrelates observables faster than using heat-bath updates. We consider two different methods of implementing the OR update: either updating the whole $SU(N)$ matrix at once, or iterating through $SU(2)$ subgroups of the $SU(N)$ matrix, we find the same critical exponent in both cases, and only a slight difference between the two.

arXiv comment21 pages, 4 figures

References in corpus (12)

• SU(N) gauge theories at large N
• Critical slowing down and error analysis in lattice QCD simulations
• Volume independence in large Nc QCD-like gauge theories
• Nonperturbative Dynamics of Noncommutative Gauge Theory
• Large $N$ reduction with the Twisted Eguchi-Kawai model
• The string tension from smeared Wilson loops at large N
• Large-N reduction in QCD-like theories with massive adjoint fermions
• Testing volume independence of SU(N) pure gauge theories at large N
• Twisted space-time reduced model of large N QCD with two adjoint Wilson fermions
• Monte Carlo Algorithms For Reduced Lattices, Mixed Actions, And Double-Trace Deformations
• Spatial volume dependence for 2+1 dimensional SU(N) Yang-Mills theory
• The $SU(\infty )$ twisted gradient flow running coupling

Cited by in corpus (1)

• Background field method in the gradient flow