Related papers: Fourier Accelerated Conjugate Gradient Lattice Gau…
The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalisations in the subspace…
The article proposes a Caputo fractional conjugate gradient (CFCG) method for unconstrained optimization problems which is applicable to smooth as well as non-smooth problmes. The proposed method uses a non-adaptive version of the Caputo…
Fourier acceleration is a technique used in Hybrid Monte Carlo simulations to decrease the autocorrelation between subsequent field configurations in the generated ensemble. It has been shown, in the perturbative limit, to eliminate the…
We discuss global gauge fixing on the lattice, specifically to the lattice Landau gauge, with the goal of understanding the question of why the process becomes extremely slow for large lattices. We construct an artificial "gauge-fixing"…
The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite…
Here we present the cuLGT code for gauge fixing in lattice gauge field theories with graphic processing units (GPUs). Implementations for SU(3) Coulomb, Landau and maximally Abelian gauge fixing are available and the overrelaxation,…
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 a new lattice implementation of the linear covariant gauge, recently introduced in [1]. In particular, we present details of the numerical procedure for fixing the gauge. We also report on preliminary results for the transverse…
We study the influence of Gribov copies on gluon and ghost propagators in lattice Landau gauge. For the gluon propagator, Gribov noise seems to be of the order of magnitude of the numerical accuracy. On the contrary, for the ghost…
The most efficient signal edge-preserving smoothing filters, e.g., for denoising, are non-linear. Thus, their acceleration is challenging and is often performed in practice by tuning filter parameters, such as by increasing the width of the…
We will make a link between the steepest descent method for an unconstrained minimisation problem and fixed-point iterations for its Euler-Lagrange equation. In this context, we shall rediscover the preconditioned nonlinear conjugate…
Riemannian accelerated gradient methods have been well studied for smooth optimization, typically treating geodesically convex and geodesically strongly convex cases separately. However, their extension to nonsmooth problems on manifolds…
This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function…
The Conjugate Gradient method (CGM) is known to be the fastest generic iterative method for solving linear systems with symmetric sign definite matrices. In this paper, we modify this method so that it could find fundamental solitary waves…
In this paper we present and explore the performance of Landau gauge fixing in GPUs using CUDA. We consider the steepest descent algorithm with Fourier acceleration, and compare the GPU performance with a parallel CPU implementation. Using…
We analyze the gauge fixing precision dependence of some non-local quark-blinear lattice operators interesting in computing parton physics for several measurements, using 5 lattice spacings ranging from 0.032 fm to 0.121 fm. Our results…
We adopt CUDA-capable Graphic Processing Units (GPUs) for Landau, Coulomb and maximally Abelian gauge fixing in 3+1 dimensional SU(3) and SU(2) lattice gauge field theories. A combination of simulated annealing and overrelaxation is used to…
Gauge fixing is a frequent task encountered in practical lattice gauge theory calculations. We review the performance characteristics of some standard gauging procedures for non-abelian gauge theories, implemented on the parallel machines…
Recent progress on deep learning relies heavily on the quality and efficiency of training algorithms. In this paper, we develop a fast training method motivated by the nonlinear Conjugate Gradient (CG) framework. We propose the Conjugate…
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…