ﻻ يوجد ملخص باللغة العربية
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.
Recently there has been remarkable progress in the complex Langevin method, which aims at solving the complex action problem by complexifying the dynamical variables in the original path integral. In particular, a new technique called the gauge cooli
We study a random matrix model for QCD at finite density via complex Langevin dynamics. This model has a phase transition to a phase with nonzero baryon density. We study the convergence of the algorithm as a function of the quark mass and the chemic
Recently there has been remarkable progress in solving the sign problem, which occurs in investigating statistical systems with a complex weight. The two promising methods, the complex Langevin method and the Lefschetz thimble method, share the idea
The complex Langevin method and the generalized Lefschetz-thimble method are two closely related approaches to the sign problem, which are both based on complexification of the original dynamical variables. The former can be viewed as a generalizatio
The complex Langevin method (CLM) provides a promising way to perform the path integral with a complex action using a stochastic equation for complexified dynamical variables. It is known, however, that the method gives wrong results in some cases, w