Abstract

Abstract

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.

Details

Title
A comparison of updating algorithms for large N reduced models
Author
Pérez, Margarita Garc´ia; González-arroyo, Antonio; Keegan, Liam; Okawa, Masanori; Ramos, Alberto
Pages
1-21
Publication year
2015
Publication date
Jun 2015
Publisher
Springer Nature B.V.
e-ISSN
10298479
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
1708029058
Copyright
SISSA, Trieste, Italy 2015