Related papers: Block Algorithms for Quark Propagator Calculation
Different recently developed Krylov space methods for solving linear systems are studied and compared for the solution of the Dirac equation on the lattice. Stabilized Biconjugate Gradient (BiCGstab2) is shown to be a robust and efficient…
I review recent progress on algorithms for calculating quark propagators and for simulating full QCD.
We present a new exact algorithm for estimating all elements of the quark propagator. The advantage of the method is that the exact all-to-all propagator is reproduced in a large but finite number of inversions. The efficacy of the…
The computational effort in the calculation of Wilson fermion quark propagators in Lattice Quantum Chromodynamics can be considerably reduced by exploiting the Wilson fermion matrix structure in inversion algorithms based on the…
In the present study, we establish two new block variants of the Conjugate Orthogonal Conjugate Gradient (COCG) and the Conjugate A-Orthogonal Conjugate Residual (COCR) Krylov subspace methods for solving complex symmetric linear systems…
A new method for computing all elements of the lattice quark propagator is proposed. The method combines the spectral decomposition of the propagator, computing the lowest eigenmodes exactly, with noisy estimators which are 'diluted', i.e.…
We consider the task of computing solutions of linear systems that only differ by a shift with the identity matrix as well as linear systems with several different right hand sides. In the past Krylov subspace methods have been developed…
Block Krylov methods have recently gained a lot of attraction. Due to their increased arithmetic intensity they offer a promising way to improve performance on modern hardware. Recently Frommer et al. presented a block Krylov framework that…
Our goal in this paper is to clarify the relationship between the block Lanczos and the block conjugate gradient (BCG) algorithms. Under the full rank assumption for the block vectors, we show the one-to-one correspondence between the…
The increasing imbalance between the computing capabilities of individual nodes and the internode bandwidth makes it highly desirable for any Lattice QCD algorithm to minimize the amount of internode communication. One of the relatively new…
The cyclic reduction (CR) algorithm is an efficient method for solving quadratic matrix equations that arise in quasi-birth-death (QBD) stochastic processes. However, its convergence is not guaranteed when the associated matrix polynomial…
Modern advances in algorithms for lattice QCD calculations have steadily driven down the resources required to generate gauge field ensembles and calculate quark propagators, such that, in cases relevant to nuclear physics, performing quark…
We discuss all-to-all quark propagator techniques in two (related) contexts within Lattice QCD: the computation of closed quark propagators, and applications to the so-called "eye diagrams" appearing in the computation of non-leptonic kaon…
Computing disconnected diagrams in Lattice QCD (operator insertion in a quark loop) entails the computationally demanding problem of taking the trace of the all to all quark propagator. We first outline the basic algorithm used to compute a…
The block Lanczos algorithm proposed by Peter Montgomery is an efficient means to tackle the sparse linear algebra problem which arises in the context of the number field sieve factoring algorithm and its predecessors. We present here a…
Block and global Krylov subspace methods have been proposed as methods adapted to the situation where one iteratively solves systems with the same matrix and several right hand sides. These methods are advantageous, since they allow to cast…
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…
Quantum field theories underlie all of our understanding of the fundamental forces of nature. The are relatively few first principles approaches to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the…
The quark propagator is at the core of lattice hadron spectrum calculations as well as studies in other nonperturbative schemes. We investigate the quark propagator with an improved staggered action (Asqtad) and an improved gluon action,…
Quadratic minimization problems with orthogonality constraints (QMPO) play an important role in many applications of science and engineering. However, some existing methods may suffer from low accuracy or heavy workload for large-scale…