Related papers: Modified Block BiCGSTAB for Lattice QCD
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…
The overlap operator is a lattice discretization of the Dirac operator of quantum chromodynamics, the fundamental physical theory of the strong interaction between the quarks. As opposed to other discretizations it preserves the important…
We study the algorithmic optimization and performance tuning of the Lattice QCD clover-fermion solver for the K computer. We implement the L\"uscher's SAP preconditioner with sub-blocking in which the lattice block in a node is further…
It is well known that the block Krylov subspace solvers work efficiently for some cases of the solution of differential equations with multiple right-hand sides. In lattice QCD calculation of physical quantities on a given configuration…
Efficient algorithms for the solution of partial differential equations on parallel computers are often based on domain decomposition methods. Schwarz preconditioners combined with standard Krylov space solvers are widely used in this…
The stabilized biconjugate gradient algorithm BiCGStab recently presented by van der Vorst is applied to the inversion of the lattice fermion operator in the Wilson formulation of lattice Quantum Chromodynamics. Its computational efficiency…
The simulation of lattice QCD on massively parallel computers stimulated the development of scalable algorithms for the solution of sparse linear systems. We tackle the problem of the Wilson-Dirac operator inversion by combining a Schwarz…
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…
We propose a practical formulation of the overlap Dirac operator in lattice QCD that employs the diagonal Kenney-Laub rational iterates - expressed via their partial fraction decomposition - to approximate the matrix sign function. We…
We compute the ratio between the scale $\Lambda_L$ associated with a lattice formulation of QCD using the overlap-Dirac operator, and $\Lambda_{MS-bar}$. To this end, the one-loop relation between the lattice coupling $g_0$ and the coupling…
We present a modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD. A larger number of test vectors than that used in conventional multigrid is generated by the smoother. This set of test…
In lattice QCD computations a substantial amount of work is spent in solving discretized versions of the Dirac equation. Conventional Krylov solvers show critical slowing down for large system sizes and physically interesting parameter…
We present a parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers which proves to be efficient in lattice QCD applications involving Wilson fermions. Our preconditioner is based on a locally lexicographic…
Lattice QCD simulations are computationally expensive, with the solution of the Dirac equation being the major computational bottleneck of many calculations. We introduce a novel gauge-equivariant neural-network architecture for…
The large systems of complex linear equations that are generated in QCD problems often have multiple right-hand sides (for multiple sources) and multiple shifts (for multiple masses). Deflated GMRES methods have previously been developed…
The combination of a non-overlapping Schwarz preconditioner and the Hybrid Monte Carlo (HMC) algorithm is shown to yield an efficient simulation algorithm for two-flavour lattice QCD with Wilson quarks. Extensive tests are performed, on…
Lattice QCD calculations of disconnected quark loop operators are extremely computer time-consuming to evaluate. To compute these diagrams using lattice techniques, one generally uses stochastic noise methods. These employ a randomly…
We study a variant of the Schwarz-preconditioned HMC algorithm. In contrast to the original proposal of L\"uscher, we apply the domain decomposition in one lattice direction only. This is sufficient to reduce the condition number of the…
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…
For lattice QCD with two sea quark flavours we compute the static quark antiquark potential V(R) in the regime where string breaking is expected. In order to increase statistics, we make full use of the lattice information by including all…