A comparison of updating algorithms for large N reduced models
May 21, 2015
21 pages
Published in:
- JHEP 06 (2015) 193
- Published: Jun 29, 2015
e-Print:
- 1505.05784 [hep-lat]
Report number:
- CERN-PH-TH-2015-030,
- IFT-UAM-CSIC-15-032,
- FTUAM-15-10,
- HUPD-1502
Citations per year
Abstract: (Springer)
We investigate Monte Carlo updating algorithms for simulating SU(N ) YangMills 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.Note:
- 21 pages, 4 figures
- Matrix Models
- Wilson
- ’t Hooft and Polyakov loops
- Lattice Gauge Field Theories
- 1/N Expansion
- Eguchi-Kawai model: twist
- gauge field theory: SU(N)
- critical phenomena
- expansion 1/N
- numerical calculations: Monte Carlo
References(40)
Figures(4)
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]