Numerical study of tree-level improved lattice gradient flows in pure Yang-Mills theory
Norihiko Kamata, Shoichi Sasaki

TL;DR
This paper investigates tree-level improvements to the lattice Yang-Mills gradient flow method to reduce discretization errors, demonstrating significant error elimination and improved scaling behavior in numerical simulations.
Contribution
The authors develop and test a simple method for achieving $ ext{O}(a^2)$ and $ ext{O}(a^4)$ tree-level improvements in lattice gradient flows, enhancing accuracy in gauge theory computations.
Findings
Tree-level $ ext{O}(a^2)$ improvement reduces discretization errors.
Tree-level $ ext{O}(a^4)$ improvement further improves scaling.
Scaling of $oldsymbol{ ext{t}_{0.15}}oldsymbol{ ext{Lambda}}_{ ext{MS}}$ is nearly perfect after improvements.
Abstract
We study several types of tree-level improvement in the Yang-Mills gradient flow method in order to reduce the lattice discretization errors in line with Fodor et al. [arXiv:1406.0827]. The tree-level improvement can be achieved in a simple manner, where an appropriate weighted average is computed between two definitions of the action density measured at every flow time . We further develop the idea of achieving the tree-level improvement. For testing our proposal, we present numerical results for obtained on gauge configurations generated with the Wilson and Iwasaki gauge actions at three lattice spacings ( and 0.05 fm). Our results show that tree-level improved flows significantly eliminate the discretization corrections on in the relatively small-…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
