相关论文: Multi-mass solvers for lattice QCD on GPUs

A new scheme for calculating masses and boost-invariant wave functions of heavy quarkonia is developed in a light-front Hamiltonian formulation of QCD. Only the simplest approximate version with one flavor of quarks and an ansatz for the…

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…

There exist two major problems in application of the conventional block BiCGSTAB method to the O(a)-improved Wilson-Dirac equation with multiple right-hand-sides: One is the deviation between the true and the recursive residuals. The other…

In master-field simulations of lattice QCD, the expectation values of interest are obtained from a single or at most a few representative gauge-field configurations on very large lattices. If the light quarks are included, the generation of…

Considering Ginsparg-Wilson type fermions dynamically in lattice QCD simulations is a challenging task. The hope is to be able to approach smaller pion masses and to eventually reach physical situations. The price to pay is substantially…

Lattice field theory (LFT) is the standard non-perturbative method to perform numerical calculations of quantum field theory. However, the typical bottleneck of fermionic lattice calculations is the inversion of the Dirac matrix. This…

Adaptive finite elements combined with geometric multigrid solvers are one of the most efficient numerical methods for problems such as the instationary Navier-Stokes equations. Yet despite their efficiency, computations remain expensive…

We propose improved estimators to compute the reweighting factors which are needed for lattice QCD calculations that rely on twisted-mass reweighting for the light quark contribution and the Rational Hybrid Monte Carlo (RHMC) algorithm for…

A previously introduced multi-boson technique for the simulation of QCD with dynamical quarks is described and some results of first test runs on a $6^3\times12$ lattice with Wilson quarks and gauge group SU(2) are reported.

Lattice QCD simulations at small lattice spacings and quark masses close to their physical values are technically challenging. In particular, the simulations can get trapped in the topological charge sectors of field space or may run into…

Mass preconditioned HMC and DD-HMC are among the most popular algorithms to simulate Wilson fermions. We present a comparison of the performance of the two algorithms for realistic quark masses and lattice sizes. In particular, we use the…

We implement lattice QCD using the Fortran 90 language. We have designed machine independent modules that define fields (gauge, fermions, scalars, etc...) and have defined overloaded operators for all possible operations between fields,…

The exact quantum dynamics of lattice models can be computationally intensive, especially when aiming for large system sizes and extended simulation times necessary to converge transport coefficients. By leveraging finite memory times to…

HiRep allows flexible simulations of higher representations of Wilson Fermions with various actions and gauge groups and a range of inverters and integrators. This is particularly important for enabling evaluations of observables relevant…

Lattice simulations of Quantum Chromodynamics (QCD) enable one to calculate the low-energy properties of the strong interaction among quarks and gluons based on the first principle. The most time-consuming part of the numerical simulations…

We investigate the use of half-precision floating-point numbers (FP16) in mixed-precision linear solvers for lattice QCD simulations. Since the emergence of GPUs for general-purpose, mixed-precision algorithms that combine single-precision…

QPACE is a novel massively parallel architecture optimized for lattice QCD simulations. A single QPACE node is based on the IBM PowerXCell 8i processor. The nodes are interconnected by a custom 3-dimensional torus network implemented on an…

Recently, graphics processors (GPUs) have been increasingly leveraged in a variety of scientific computing applications. However, architectural differences between CPUs and GPUs necessitate the development of algorithms that take advantage…

We present a general method to construct multiple mass solvers from standard algorithms. As an example, the BiCGstab-M algorithm is derived.

Quantum optimal control problems are typically solved by gradient-based algorithms such as GRAPE, which suffer from exponential growth in storage with increasing number of qubits and linear growth in memory requirements with increasing…