相关论文: Speed and Adaptability of Overlap Fermion Algorith…
Three possibilities to speed up the Hybrid Monte Carlo algorithm are investigated. Changing the step-size adaptively brings no practical gain. On the other hand, substantial improvements result from using an approximate Hamiltonian or a…
In order to construct improved overlap fermions, we start from a short ranged approximate Ginsparg-Wilson fermion and insert it into the overlap formula. We show that its polynomial evaluation is accelerated considerably compared to the…
We determine the free field hypercubic Dirac operator which is optimally close to satisfying the Ginsparg-Wilson relation. Inserting this operator into the overlap formula, we show that the analytic locality bound on the resulting overlap…
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…
We summarize our recent investigations of lattice QCD with dynamical overlap fermions. We sketch algorithmic issues and our approach to solving them. We show our measurement of the topological susceptibility. We describe a computation of…
We propose new techniques for the numerical implementation of the overlap-Dirac operator, which exploit the physical properties of the underlying theory to avoid nested algorithms. We test these procedures in the two-dimensional Schwinger…
The action of the overlap-Dirac operator on a vector is typically implemented in directly through a multi-shift conjugate gradient solver. The compute-time this takes to evaluate depends upon the condition number $\kappa$ of the matrix that…
The Overlap operator fulfills the Ginsparg-Wilson relation exactly and therefore represents an optimal discretization of the QCD Dirac operator with respect to chiral symmetry. When computing propagators or in HMC simulations, where one has…
We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally)…
We study three practical implementations of the Overlap-Dirac operator $D_o= (1/2) [1 + \gamma_5\epsilon(H_w)]$ in four dimensions. Two implementations are based on different representations of $\epsilon(H_w)$ as a sum over poles. One of…
We present first, exploratory results of a hybrid Monte-Carlo algorithm for dynamical, n_f=2, four-dimensional QCD with overlap fermions. As expected, the computational requirements are typically two orders of magnitude larger for the…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
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…
The overlap hypercube fermion is constructed by inserting a lattice fermion with hypercubic couplings into the overlap formula. One obtains an exact Ginsparg-Wilson fermion, which is more complicated than the standard overlap fermion, but…
In this paper, we consider the problem of accelerating the numerical simulation of time dependent problems by time domain decomposition. The available algorithms enabling such decompositions present severe efficiency limitations and are an…
The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…
We launched a project to perform dymanical fermion simulations using the overlap fermion formulation for sea quarks. In order to avoid the appearace of near-zero modes of the hermitian Wilson-Dirac operator $H_W$, we introduce a pair of…
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…
We consider adaptive approximations of the parameter-to-solution map for elliptic operator equations depending on a large or infinite number of parameters, comparing approximation strategies of different degrees of nonlinearity: sparse…
The overlap operator is just the simplest of a class of Dirac operators with an exact chiral symmetry. I demonstrate how a general class of chiral Dirac operators can be constructed, show that they have no fermion doublers and that they are…