相关论文: Landau Gauge Fixing supported by Genetic Algorithm
Current algorithms used to put a lattice gauge configuration into Landau gauge either suffer from the problem of critical slowing-down or involve an additional computational expense to overcome it. Evolutionary Algorithms (EAs), which have…
An algorithm for gauge fixing to the minimal Landau gauge in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing.…
We address the problem of the gauge fixing versus Gribov copies in lattice gauge theories. For the Landau gauge, results show that a suitable combination of evolutionary algorithms with traditional steepest descent methods identifies the…
We study the problem of critical slowing-down for gauge-fixing algorithms (Landau gauge) in $SU(2)$ lattice gauge theory on $2$ and $4$ dimensional lattices, both numerically and analytically. We consider five such algorithms, and we…
We discuss how the steepest descent method with Fourier acceleration for Laudau gauge fixing in lattice SU(3) simulations can be implemented using CUDA. The scaling of the gauge fixing code was investigated using a Tesla C2070 Fermi…
In this work, we consider the GPU implementation of the steepest descent method with Fourier acceleration for Laudau gauge fixing, using CUDA. The performance of the code in a Tesla C2070 GPU is compared with a parallel CPU implementation.
We present a new method of gauge fixing to standard lattice Landau gauge, Max Re Tr $\sum_{\mu,x}U_{\mu,x}$, in which the link configuration is recursively smeared; these smeared links are then gauge fixed by standard extremization. The…
Lattice gauge fixing is required to compute gauge-variant quantities, for example those used in RI-MOM renormalization schemes or as objects of comparison for model calculations. Recently, gauge-variant quantities have also been found to be…
Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing algorithm in which order a^2 errors are removed is presented. Order a^2 improvement of the gauge fixing condition displays the secondary…
We provide details expanding on our implementation of a non-linear conjugate gradient method with Fourier acceleration for lattice Landau and Coulomb gauge fixing. We find clear improvement over the Fourier accelerated steepest descent…
We provide details of the first implementation of a non-linear conjugate gradient method for Landau and Coulomb gauge fixing with Fourier acceleration. We find clear improvement over the Fourier accelerated steepest descent method, with the…
An Algorithm is proposed for the simulation of pure SU(N) lattice gauge theories based on Genetic Algorithms(GAs). Main difference between GAs and Metropolis methods(MPs) is that GAs treat a population of points at once, while MPs treat…
The Landau gauge fixing algorithm in the new definition of gauge fields is presented. In this algorithm a new solver of the Poisson equations based on the Green's function method is used. Its numerical performance of the gauge fixing…
An algorithm is proposed for the simulation of pure SU(N) lattice gauge theories based on Genetic Algorithms(GAs). We apply GAs to SU(2) pure gauge theory on a 2 dimensional lattice and show the results, the action per plaquette and Wilson…
We recently reported that the simple genetic algorithm (SGA) is capable of performing a remarkable form of sublinear computation which has a straightforward connection with the general problem of interacting attributes in data-mining. In…
We study the problem of critical slowing-down for gauge-fixing algorithms (Landau gauge) in $SU(2)$ lattice gauge theory on a $2$-dimensional lattice. We consider five such algorithms, and lattice sizes ranging from $8^{2}$ to $36^{2}$ (up…
Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing algorithm in which ${\cal O}(a^2)$ errors are removed is presented. ${\cal O}(a^2)$ improvement of the gauge fixing condition improves…
An overrelaxed variant of simulated annealing is applied to the problem of maximally abelian gauge fixing. The superiority of this algorithm over the commonly used relaxation procedure is demonstrated. Biases on non gauge invariant…
Applying Genetic Algorithm for the Lattice Gauge Theory is formed to be an effective method to minimize the action of gauge field on a lattice. In 4 dimensions, the critical point and the Wilson loop behaviour of SU(2) lattice gauge theory…
We present a new implementation of the Fourier acceleration method for Landau gauge fixing. By means of a multigrid inversion we are able to avoid the use of the fast Fourier transform. This makes the method more flexible, and well suited…