Related papers: GPU implementation of a Landau gauge fixing algori…
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…
Graphics Processing Units (GPUs) are being used in many areas of physics, since the performance versus cost is very attractive. The GPUs can be addressed by CUDA which is a NVIDIA's parallel computing architecture. It enables dramatic…
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…
The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the devices that can be realised in the near term, uses…
This paper presents, to the author's knowledge, the first graphics processing unit (GPU) accelerated program that solves the evolution of interacting scalar fields in an expanding universe. We present the implementation in NVIDIA's Compute…
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…
A new algorithm for fixing the gauge to (direct) maximal center gauge in SU(N) lattice gauge theory is presented. We check how this method works on SU(3) configurations which are vortex-like, and show how these configurations look like when…
Incorporated with twisted boundary condition, Polyakov loop correlators can give a definition of the renormalized coupling. We employ this scheme for the step scaling method (with step size s = 2) in the search of conformal fixed point of…
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…
The starting point of any lattice QCD computation is the generation of a Markov chain of gauge field configurations. Due to the large number of lattice links and due to the matrix multiplications, generating SU(Nc) lattice QCD…
We present our implementation of the RHMC algorithm for staggered fermions on Graphics Processing Units using the NVIDIA CUDA programming language. While previous studies exclusively deal with the Dirac matrix inversion problem, our code…
The Laue diffraction microscopy experiment uses the polychromatic Laue micro-diffraction technique to examine the structure of materials with sub-micron spatial resolution in all three dimensions. During this experiment, local…
We report on our efforts to implement overlap fermions on NVIDIA GPUs using CUDA, commenting on the algorithms used, implemetation details, and the performance of our code.
Linear programming (LP) relaxation is a standard technique for solving hard combinatorial optimization (CO) problems. Here we present a gradient descent algorithm which exploits the special structure of some LP relaxations induced by CO…
Quantum simulation of synthetic dynamic gauge field has attracted much attentions in recent years. There are two traditional ways to simulate gauge theories. One is to directly simulate the full Hamiltonian of gauge theories with local…
These notes accompany the open-source code published in GitHub which implements a GPU-based line-segment, surface-triangle intersection algorithm in CUDA. It mentions some relevant works and discusses issues specific to this implementation.…
The main objective of this work consists in analyzing sub-structuring method for the parallel solution of sparse linear systems with matrices arising from the discretization of partial differential equations such as finite element, finite…
At fine lattice spacings, lattice simulations are plagued by slow (topological) modes that give rise to large autocorrelation times. These, in turn, lead to statistical and systematic errors that are difficult to estimate. We study the…
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…
Modern graphics hardware is designed for highly parallel numerical tasks and provides significant cost and performance benefits. Graphics hardware vendors are now making available development tools to support general purpose high…