Related papers: Seed methods for linear equations in lattice qcd p…
The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalisations in the subspace…
In lattice QCD computations a substantial amount of work is spent in solving linear systems arising in Wilson's discretization of the Dirac equations. We show first numerical results of the extension of the two-level DD-\alpha AMG method to…
We review the recent progress in new lattice fermion formulations. We focus on the following three types which have possibility of improving lattice simulations. (1) Flavored-mass fermions are a generalization of Wilson fermions with…
We discuss the implementation of a Sheikholeslami-Wohlert term for simulations of lattice QCD with dynamical Wilson fermions as required by Symanzik's improvement program. We show that for the Hybrid Monte Carlo or Kramers equation…
Many observables of interest in lattice QCD are extracted from correlation functions involving the vector current. If Wilson fermions are used, it is therefore of practical importance that, besides the action, the current be O($a$) improved…
A new variant of the GMRES method is presented for solving linear systems with the same matrix and subsequently obtained multiple right-hand sides. The new method keeps such properties of the classical GMRES algorithm as follows. Both bases…
In this article, we introduce and study accelerated Landweber methods for linear ill-posed problems obtained by an alteration of the coefficients in the three-term recurrence relation of the \nu-methods. The residual polynomials of the…
We discuss the successes and limitations of statistical sampling for a sequence of models studied in the context of lattice QCD and emphasize the need for new methods to deal with finite-density and real-time evolution. We show that these…
This paper presents the XAMG library for solving large sparse systems of linear algebraic equations with multiple right-hand side vectors. The library specializes but is not limited to the solution of linear systems obtained from the…
Rational approximations of the matrix sign function lead to multishift methods. For non-Hermitian matrices long recurrences can cause storage problems, which can be circumvented with restarts. Together with deflation we obtain efficient…
We present higher-order piecewise continuous finite element methods for solving a class of interface problems in two dimensions. The method is based on correction terms added to the right-hand side in the standard variational formulation of…
Numerical simulations of quantum chromodynamics (QCD) on a lattice require the frequent solution of linear systems of equations with large, sparse and typically ill-conditioned matrices. Algebraic multigrid methods are meanwhile the…
We discuss how the peculiar properties of maximally twisted Wilson fermions can be exploited to set up a consistent LQCD computational scheme in which the CP-conserving matrix elements of the $\Delta S =1,2$ effective weak Hamiltonian can…
We present an adaptive multigrid Dirac solver developed for Wilson clover fermions which offers order-of-magnitude reductions in solution time compared to conventional Krylov solvers. The solver incorporates even-odd preconditioning and…
We apply a recent proposal to speed up the Hybrid-Monte-Carlo simulation of systems with dynamical fermions to two flavour QCD with clover-improvement. The basic idea of our proposal is to split the fermion matrix into two factors with a…
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…
We study the use of Krylov subspace recycling for the solution of a sequence of slowly-changing families of linear systems, where each family consists of shifted linear systems that differ in the coefficient matrix only by multiples of the…
The (classical) problem of characterizing and enumerating permutations that can be sorted using two stacks connected in series is still largely open. In the present paper we address a related problem, in which we impose restrictions both on…
We propose a method to improve lattice operators composed of Wilson fermions which allows the removal of all corrections of $O(a)$, including those proportional to the quark mass. It requires off-shell improvement of quark fields and…
We present an adaptive multigrid solver for application to the non-Hermitian Wilson-Dirac system of QCD. The key components leading to the success of our proposed algorithm are the use of an adaptive projection onto coarse grids that…