Memory efficient finite volume schemes with twisted boundary conditions
In this paper we explore a finite volume renormalization scheme that combines three main ingredients: a coupling based on the gradient flow, the use of twisted boundary conditions and a particular asymmetric geometry, that for SU(N) gauge theories consists on a hypercubic box of size l2× (Nl) 2, a c...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2021 |
| País: | España |
| Institución: | Universidad Autónoma de Madrid |
| Repositorio: | Biblos-e Archivo. Repositorio Institucional de la UAM |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.uam.es:10486/704409 |
| Acceso en línea: | http://hdl.handle.net/10486/704409 https://dx.doi.org/10.1140/epjc/s10052-021-09718-0 |
| Access Level: | acceso abierto |
| Palabra clave: | Lattice QCD Meson Quantum Chromodynamics Física |
| Sumario: | In this paper we explore a finite volume renormalization scheme that combines three main ingredients: a coupling based on the gradient flow, the use of twisted boundary conditions and a particular asymmetric geometry, that for SU(N) gauge theories consists on a hypercubic box of size l2× (Nl) 2, a choice motivated by the study of volume independence in large N gauge theories. We argue that this scheme has several advantages that make it particularly suited for precision determinations of the strong coupling, among them translational invariance, an analytic expansion in the coupling and a reduced memory footprint with respect to standard simulations on symmetric lattices, allowing for a more efficient use of current GPU clusters. We test this scheme numerically with a determination of the Λ parameter in the SU(3) pure gauge theory. We show that the use of an asymmetric geometry has no significant impact in the size of scaling violations, obtaining a value ΛMS¯8t0=0.603(17) in good agreement with the existing literature. The role of topology freezing, that is relevant for the determination of the coupling in this particular scheme and for large N applications, is discussed in detail |
|---|