A comparison of updating algorithms for large $N$ reduced models

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

Descripción completa

Detalles Bibliográficos
Autores principales: Pérez, Margarita García, González-Arroyo, Antonio, Keegan, Liam, Okawa, Masanori, Ramos, Alberto
Lenguaje:eng
Publicado: 2015
Materias:
Particle Physics - Lattice
Acceso en línea:https://dx.doi.org/10.1007/JHEP06(2015)193
http://cds.cern.ch/record/2017949
_version_ 1780946748139634688
author Pérez, Margarita García
González-Arroyo, Antonio
Keegan, Liam
Okawa, Masanori
Ramos, Alberto
author_facet Pérez, Margarita García
González-Arroyo, Antonio
Keegan, Liam
Okawa, Masanori
Ramos, Alberto
author_sort Pérez, Margarita García
collection CERN
description 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.
id cern-2017949
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2015
record_format invenio
spelling cern-20179492023-10-04T07:45:54Zdoi:10.1007/JHEP06(2015)193http://cds.cern.ch/record/2017949engPérez, Margarita GarcíaGonzález-Arroyo, AntonioKeegan, LiamOkawa, MasanoriRamos, AlbertoA comparison of updating algorithms for large $N$ reduced modelsParticle Physics - LatticeWe 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.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.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:1505.05784CERN-PH-TH-2015-030IFT-UAM-CSIC-15-032FTUAM-15-10HUPD-1502CERN-PH-TH-2015-030IFT-UAM-CSIC-15-032FTUAM-15-10HUPD-1502oai:cds.cern.ch:20179492015-05-21
spellingShingle Particle Physics - Lattice
Pérez, Margarita García
González-Arroyo, Antonio
Keegan, Liam
Okawa, Masanori
Ramos, Alberto
A comparison of updating algorithms for large $N$ reduced models
title A comparison of updating algorithms for large $N$ reduced models
title_full A comparison of updating algorithms for large $N$ reduced models
title_fullStr A comparison of updating algorithms for large $N$ reduced models
title_full_unstemmed A comparison of updating algorithms for large $N$ reduced models
title_short A comparison of updating algorithms for large $N$ reduced models
title_sort comparison of updating algorithms for large $n$ reduced models
topic Particle Physics - Lattice
url https://dx.doi.org/10.1007/JHEP06(2015)193
http://cds.cern.ch/record/2017949
work_keys_str_mv AT perezmargaritagarcia acomparisonofupdatingalgorithmsforlargenreducedmodels
AT gonzalezarroyoantonio acomparisonofupdatingalgorithmsforlargenreducedmodels
AT keeganliam acomparisonofupdatingalgorithmsforlargenreducedmodels
AT okawamasanori acomparisonofupdatingalgorithmsforlargenreducedmodels
AT ramosalberto acomparisonofupdatingalgorithmsforlargenreducedmodels
AT perezmargaritagarcia comparisonofupdatingalgorithmsforlargenreducedmodels
AT gonzalezarroyoantonio comparisonofupdatingalgorithmsforlargenreducedmodels
AT keeganliam comparisonofupdatingalgorithmsforlargenreducedmodels
AT okawamasanori comparisonofupdatingalgorithmsforlargenreducedmodels
AT ramosalberto comparisonofupdatingalgorithmsforlargenreducedmodels

Ejemplares similares