Abstract
We study the gauge cooling technique for the complex Langevin method applied to the computation in lattice quantum chromodynamics. We propose a new solver of the minimization problem that optimizes the gauge, which does not include any parameter in each iteration, and shows better performance than the classical gradient descent method especially when the lattice size is large. Two numerical tests are carried out to show the effectiveness of the new algorithm.
Highlights
Lattice QCD is the standard nonperturbative tool for quantum chromodynamics (QCD)
We study the gauge cooling technique for the complex Langevin method applied to the computation in lattice quantum chromodynamics
We propose a new solver of the minimization problem that optimizes the gauge, which does not include any parameter in each iteration, and shows better performance than the classical gradient descent method especially when the lattice size is large
Summary
Lattice QCD is the standard nonperturbative tool for quantum chromodynamics (QCD). The link variables. The gauge cooling method utilizes the redundant degrees of freedom in the gauge field, and it does not introduce any biases to the expectation values Such a method has been formally justified in [10,15], and it has been successfully applied to a number of problems [16,17]. The gauge cooling method requires to choose an optimal gauge for the complexified field, which minimizes the distance between the current field and SUð3Þ. In one dimension, it has been figured out in [18] that the problem can be solved analytically since the field is essentially equivalent to the one-link model.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
