Related papers: Error Bounds for the Sign Function
In continuum QCD, nontrivial gauge topologies give rise to zero eigenvalues of the massless Dirac operator. In lattice QCD with Wilson fermions, these zero modes appear as exactly real eigenvalues of the Wilson-Dirac operator and hence as…
Diffusion maps is a manifold learning algorithm widely used for dimensionality reduction. Using a sample from a distribution, it approximates the eigenvalues and eigenfunctions of associated Laplace-Beltrami operators. Theoretical bounds on…
In this talk, we shall assess the finite ma errors from the overlap fermion. We shall present results on the speed of light from the dispersion relation and hyperfine splitting between the vector and pseudoscalar mesons as a function to ma…
The ubiquitous Lanczos method can approximate $f(A)x$ for any symmetric $n \times n$ matrix $A$, vector $x$, and function $f$. In exact arithmetic, the method's error after $k$ iterations is bounded by the error of the best degree-$k$…
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…
We define a sparse hermitian lattice Dirac matrix, $H$, coupling $2n+1$ Dirac fermions. When $2n$ fermions are integrated out the induced action for the last fermion is a rational approximation to the hermitian overlap Dirac operator. We…
It is known that Green's functions can be expressed as continued fractions; the content at the $n$-th level of the fraction is encoded in a coefficient $b_n$, which can be recursively obtained using the Lanczos algorithm. We present a…
We investigate the eigenvalues of nearly chiral lattice Dirac operators constructed with five-dimensional implementations. Allowing small violation of the Ginsparg-Wilson relation, the HMC simulation is made much faster while the…
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…
We give a novel spectral approximation algorithm for the balanced separator problem that, given a graph G, a constant balance b \in (0,1/2], and a parameter \gamma, either finds an \Omega(b)-balanced cut of conductance O(\sqrt(\gamma)) in…
We propose a novel, machine-learning-based framework for constructing lattice fermions using Physics-Informed Neural Networks (PINNs). Our approach treats the formulation of the Dirac operator as an optimization problem guided by physical…
Quadratic forms of Hermitian matrix resolvents involve the solutions of shifted linear systems. Efficient iterative solutions use the shift-invariance property of Krylov subspaces The Hermitian Lanczos method reduces a given vector and…
We propose a lattice action including unphysical Wilson fermions with a negative mass m_0 of the order of the inverse lattice spacing. With this action, the exact zero mode of the hermitian Wilson-Dirac operator H_W(m_0) cannot appear and…
The problem of how to compute accurately and efficiently the sign of the overlap between two general HFB wave functions is addressed. The results obtained can easily be extrapolated to the evaluation of the sign of the trace of a density…
Two numerical algorithms for the computation of eigenvalues of Dirac operators in lattice gauge theories are described: one is an accelerated conjugate gradient method, the other one a standard Lanczos method. Results obtained by Cullum's…
Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywhere in the spectrum. This paper describes a technique for…
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 forward-backward operator splitting algorithm is one of the most important methods for solving the optimization problem of the sum of two convex functions, where one is differentiable with a Lipschitz continuous gradient and the other…
An outstanding problem when computing a function of a matrix, $f(A)$, by using a Krylov method is to accurately estimate errors when convergence is slow. Apart from the case of the exponential function which has been extensively studied in…
We derive an augmented Krylov subspace method with subspace recycling for computing a sequence of matrix function applications on a set of vectors. The matrix is either fixed or changes as the sequence progresses. We assume consecutive…