Related papers: Fourier Accelerated Conjugate Gradient Lattice Gau…
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 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…
For an asymptotically free theory, a promising strategy for eliminating Critical Slowing Down (CSD) is na\"ive Fourier acceleration. This requires the introduction of gauge-fixing into the action, in order to isolate the asymptotically…
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.
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 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…
A class of algorithms for the Landau gauge fixing is proposed, which makes the steepest ascent (SA) method be more efficient by concepts of genetic algorithm. Main concern is how to incorporate random gauge transformation (RGT) %, mutation…
We propose a non-perturbative procedure to fix generic covariant gauges on the lattice. Varying the gauge parameter, this gauge fixing provides a concrete method to check numerically the gauge dependence of correlators measured on the…
Gauge fixing is an essential step in lattice QCD calculations, particularly for studying gauge-dependent observables. Traditional iterative algorithms are computationally expensive and often suffer from critical slowing down and scaling…
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…
The focus of this paper is on the analysis of the Conjugate Gradient method applied to a non-symmetric system of linear equations, arising from a Fast Fourier Transform-based homogenization method due to (Moulinec and Suquet, 1994).…
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 propose a method which allows the generalization of the Landau lattice gauge-fixing procedure to generic covariant gauges. We report preliminary numerical results showing how the procedure works for $SU(2)$ and $SU(3)$. We also report…
In this work, we present the GPU implementation of the overrelaxation and steepest descent method with Fourier acceleration methods for Laudau and Coulomb gauge fixing using CUDA for SU(N) with N>2. A multi-GPU implementation of the…
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…
The method of nonlinear conjugate gradients (NCG) is widely used in practice for unconstrained optimization, but it satisfies weak complexity bounds at best when applied to smooth convex functions. In contrast, Nesterov's accelerated…
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 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…
We explore the performance of CUDA in performing Landau gauge fixing in Lattice QCD, using the steepest descent method with Fourier acceleration. The code performance was tested in a Tesla C2070, Fermi architecture. We also present a study…
A scaled conjugate gradient method that accelerates existing adaptive methods utilizing stochastic gradients is proposed for solving nonconvex optimization problems with deep neural networks. It is shown theoretically that, whether with…