Related papers: Error Bounds for the Sign Function
We compute Neuberger's overlap operator by the Lanczos algorithm applied to the Wilson-Dirac operator. Locality of the operator for quenched QCD data and its eigenvalue spectrum in an instanton background are studied.
The overlap Dirac operator, which satisfies the Ginsparg-Wilson relation, realizes exact chiral symmetry on the lattice without any unphysical doubler modes. To perform the path integrals, one should, however, note that the overlap fermion…
We show that it is possible to improve the chiral behaviour and the approach to the continuum limit of correlation functions in lattice QCD with Wilson fermions by taking arithmetic averages of correlators computed in theories regularized…
We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single…
This paper revisits the error analysis of the Stochastic Lanczos Quadrature (SLQ) method for approximating the trace of matrix functions, with a specific focus on asymmetric Lanczos quadrature rules. We reexplain an existing theoretical…
The Lanczos method is one of the most powerful and fundamental techniques for solving an extremal symmetric eigenvalue problem. Convergence-based error estimates depend heavily on the eigenvalue gap. In practice, this gap is often…
We construct a number of lattice fermions, which fulfill the Ginsparg-Wilson relation either exactly or approximately, and test them in the framework of the 2-flavor Schwinger model. We start from explicit approximations within a short…
Numerical evaluation of the overlap Dirac operator is difficult since it contains the sign function $\epsilon(H_w)$ of the Hermitian Wilson-Dirac operator $H_w$ with a negative mass term. The problems are due to $H_w$ having very small…
We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single…
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the overlap Dirac operator at both zero and nonzero baryon…
It is possible to improve the chiral behaviour and the approach to the continuum limit of correlation functions in lattice QCD with standard and twisted Wilson fermions by taking arithmetic averages of correlators computed in theories…
Approximating the action of a matrix function $f(\mathbf{A})$ on a vector $\mathbf{b}$ is an increasingly important primitive in machine learning, data science, and statistics, with applications such as sampling high dimensional Gaussians,…
We extend the error bounds from [SIMAX, Vol. 43, Iss. 2, pp. 787-811 (2022)] for the Lanczos method for matrix function approximation to the block algorithm. Numerical experiments suggest that our bounds are fairly robust to changing block…
We compare the efficiency of four different algorithms to compute the overlap Dirac operator, both for the speed, i.e., time required to reach a desired numerical accuracy, and for the adaptability, i.e., the scaling of speed with the…
We discuss the usage and applicability of deflation methods for the overlap lattice Dirac operator, focussing on calculating the eigenvalues using a method similar to the eigCG algorithm used for other Dirac operators. The overlap operator,…
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…
A common approach to approximating quadratic forms of matrix functions is to use a quadrature rule derived from the Lanczos process, known as a Lanczos quadrature. Although symmetric quadrature rules are computationally favorable, it has…
We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm for computing $f(\mathbf{A}) \mathbf{b}$ when $\mathbf{A}$ is a Hermitian matrix and $\mathbf{b}$ is a given vector. Assuming that $f :…
Polynomial Krylov subspace methods are among the most widely used methods for approximating $f(A)b$, the action of a matrix function on a vector, in particular when $A$ is large and sparse. When $A$ is Hermitian positive definite, the…
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)…