We provide details expanding on our 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 average time taken for the algorithm to converge to a fixed, high accuracy, being reduced by a factor of 2 to 4. We show such improvement to be the case for the logarithmic definition of the gauge fields, having already shown this to be the case for a more common definition. We also discuss the implementation of an optimal Fourier accelerated steepest descent method
We explore the performance of CUDA in performing Landau gauge fixing in Lattice QCD, using the steep...
AbstractConjugate gradient methods are conjugate direction or gradient deflection methods which lie ...
The computation of the fermion propagator in lattice Quantum Chromodynamics requires the solution of...
Fourier acceleration is a useful technique which can be applied to many different numerical algorith...
An algorithm for gauge fixing to the Landau gauge in the fundamental modular region in lattice QCD i...
We present a new implementation of the Fourier acceleration method for Landau gauge fixing. By means...
Current algorithms used to put a lattice gauge configuration into Landau gauge either suffer from th...
Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing ...
Lattice discretization errors in the Landau gauge condition are examined. An improved gauge fixing a...
We present a new algorithm for inverting the quark propagator in lattice QCD that removes the critic...
We address the problem of the gauge fixing versus Gribov copies in lattice gauge theories. For the L...
The stabilized biconjugate gradient algorithm BiCGStab recently presented by van der Vorst is applie...
We discuss how the steepest descent method with Fourier acceleration for Laudau gauge fixing in latt...
Linear covariant gauges, such as Feynman gauge, are very useful in perturbative calculations. Their ...
The computation f the fermion propagator in lattice Quantum Chromodynamics requires the solution of ...
We explore the performance of CUDA in performing Landau gauge fixing in Lattice QCD, using the steep...
AbstractConjugate gradient methods are conjugate direction or gradient deflection methods which lie ...
The computation of the fermion propagator in lattice Quantum Chromodynamics requires the solution of...
Fourier acceleration is a useful technique which can be applied to many different numerical algorith...
An algorithm for gauge fixing to the Landau gauge in the fundamental modular region in lattice QCD i...
We present a new implementation of the Fourier acceleration method for Landau gauge fixing. By means...
Current algorithms used to put a lattice gauge configuration into Landau gauge either suffer from th...
Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing ...
Lattice discretization errors in the Landau gauge condition are examined. An improved gauge fixing a...
We present a new algorithm for inverting the quark propagator in lattice QCD that removes the critic...
We address the problem of the gauge fixing versus Gribov copies in lattice gauge theories. For the L...
The stabilized biconjugate gradient algorithm BiCGStab recently presented by van der Vorst is applie...
We discuss how the steepest descent method with Fourier acceleration for Laudau gauge fixing in latt...
Linear covariant gauges, such as Feynman gauge, are very useful in perturbative calculations. Their ...
The computation f the fermion propagator in lattice Quantum Chromodynamics requires the solution of ...
We explore the performance of CUDA in performing Landau gauge fixing in Lattice QCD, using the steep...
AbstractConjugate gradient methods are conjugate direction or gradient deflection methods which lie ...
The computation of the fermion propagator in lattice Quantum Chromodynamics requires the solution of...