Related papers: A Parallel SSOR Preconditioner for Lattice QCD
We consider two-flavor QCD in the lattice regularization with improved Wilson fermions. In this formulation chiral symmetry is explicitly broken at order a and hence the isovector axial currents require improvement as well as a finite…
We study the feasibility of a PC-based parallel computer for medium to large scale lattice QCD simulations. The E\"otv\"os Univ., Inst. Theor. Phys. cluster consists of 137 Intel P4-1.7GHz nodes with 512 MB RDRAM. The 32-bit, single…
We describe a parallel iterative least squares solver named \texttt{LSRN} that is based on random normal projection. \texttt{LSRN} computes the min-length solution to $\min_{x \in \mathbb{R}^n} \|A x - b\|_2$, where $A \in \mathbb{R}^{m…
We investigate the application of Krylov space methods to the solution of shifted linear systems of the form (A+\sigma) x - b = 0 for several values of \sigma simultaneously, using only as many matrix-vector operations as the solution of a…
The overlap operator in lattice QCD requires the computation of the sign function of a matrix, which is non-Hermitian in the presence of a quark chemical potential. In previous work we introduced an Arnoldi-based Krylov subspace…
This paper presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits the domain…
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…
Lattice QCD calculations were one of the first applications to show the potential of GPUs in the area of high performance computing. Our interest is to find ways to effectively use GPUs for lattice calculations using the overlap operator.…
Thermodynamics in the strong coupling limit of lattice QCD has features which may be similar to those of continuum QCD, such as a chiral critical end point and a nuclear liquid gas transition. Here I compare the combinatorics of staggered…
This paper introduces CKTSO (abbreviation of "circuit solver"), a novel sparse linear solver specially designed for the simulation program with integrated circuit emphasis (SPICE). CKTSO is a parallel solver and can be run on a multi-core,…
The solution of sparse linear systems constitutes the dominant computational bottleneck in interior point methods (IPMs), frequently consuming over 70% of the total solution time. As optimization problems scale to millions of variables,…
Using N=1 Supersymmetric QCD (SQCD) as a prototype model, this work presents a formulation of overlap quarks and gluinos on the lattice, with particular emphasis on the construction of chirally symmetric Yukawa terms. By incorporating the…
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…
Due to the wide separation of time scales in geophysical fluid dynamics, semi-implicit time integrators are commonly used in operational atmospheric forecast models. They guarantee the stable treatment of fast (acoustic and gravity) waves,…
In view of the existing limitations of sequential computing, parallelization has emerged as an alternative in order to improve the speedup of numerical simulations. In the framework of evolutionary problems, space-time parallel methods…
A new multifermion formulation of lattice QCD is proposed. The model is free of spectrum doubling and preserves all nonanomalous chiral symmetries up to exponentially small corrections. It is argued that a small number of fermion fields may…
We study efficiency of higher order integrator schemes for the hybrid Monte Carlo (HMC) algorithm. Numerical tests are performed for Quantum Chromo Dynamics (QCD) with two flavors of Wilson fermions. We compare 2nd, 4th and 6th order…
We develop a simple algorithmic framework to solve large-scale symmetric positive definite linear systems. At its core, the framework relies on two components: (1) a norm-convergent iterative method (i.e. smoother) and (2) a preconditioner.…
We consider practical hardware implementation of Polar decoders. To reduce latency due to the serial nature of successive cancellation (SC), existing optimizations improve parallelism with two approaches, i.e., multi-bit decision or reduced…
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…