A comparison of updating algorithms for large N reduced models

From MaRDI portal
Publication:2635535

DOI10.1007/JHEP06(2015)193zbMATH Open1388.81363arXiv1505.05784OpenAlexW1889091087MaRDI QIDQ2635535FDOQ2635535


Authors: Yanyan Li Edit this on Wikidata


Publication date: 31 May 2018

Published in: Journal of High Energy Physics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1505.05784




Recommendations




Cites Work


Cited In (5)





This page was built for publication: A comparison of updating algorithms for large \(N\) reduced models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2635535)