Related papers: Error Bounds for the Sign Function
We develop a systematic sign-embedding framework of operator-output quantum algorithms for matrix equations and matrix functions. Differing from the contour-integral treatment, we start with the matrix-sign embedding route: an augmented…
For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…
A parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers in lattice QCD applications involving Wilson fermions is presented. In actual Hybrid Monte Carlo and quark propagator calculations it helps to reduce the…
The Lanczos algorithm is evaluated for solving the time-independent as well as the time-dependent Dirac equation with arbitrary electromagnetic fields. We demonstrate that the Lanczos algorithm can yield very precise eigenenergies and…
We derive the effective action of the light fermion field of the domain-wall fermion, which is referred as q(x) and \bar q(x) by Furman and Shamir. The inverse of the effective Dirac operator turns out to be identical to the inverse of the…
The $O(a)$ improved Wilson quark action on the anisotropic lattice is investigated. We carry out numerical simulations in the quenched approximation at three values of lattice spacing ($a_{\sigma}^{-1}=1$--2 GeV) with the anisotropy…
This work introduces a method for determining the energy spectrum of lattice quantum chromodynamics (LQCD) by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to…
An obvious way to simulate a L\'evy process $X$ is to sample its increments over time $1/n$, thus constructing an approximating random walk $X^{(n)}$. This paper considers the error of such approximation after the two-sided reflection map…
We provide tools to help automate the error analysis of algorithms that evaluate simple functions over the floating-point numbers. The aim is to obtain tight relative error bounds for these algorithms, expressed as a function of the unit…
We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). Traditionally, all the CG iteration vectors could be…
A deflated restarted Lanczos algorithm is given for both solving symmetric linear equations and computing eigenvalues and eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Meanwhile, the deflating…
We study quenched QCD just above the phase transition temperature using overlap Fermions. Exact zero modes of the overlap operator are localized. Chiral symmetry is restored, as indicated by the behavior of the chiral condensate after…
A well-know drawback of l_1-penalized estimators is the systematic shrinkage of the large coefficients towards zero. A simple remedy is to treat Lasso as a model-selection procedure and to perform a second refitting step on the selected…
This paper investigates the mean square error optimal estimation of scale invariant Wigner spectrum for the class of Gaussian locally self-similar processes, by the multitaper method. In this method, the spectrum is estimated as a weighted…
A classical problem that arises in numerous signal processing applications asks for the reconstruction of an unknown, $k$-sparse signal $x_0\in R^n$ from underdetermined, noisy, linear measurements $y=Ax_0+z\in R^m$. One standard approach…
A practical implementation of the Overlap-Dirac operator ${{1+\gamma_5\epsilon(H)}\over 2}$ is presented. The implementation exploits the sparseness of $H$ and does not require full storage. A simple application to parity invariant three…
In this paper, several modifications are introduced to the functional approximation method iterLap to reduce the approximation error, including stopping rule adjustment, proposal of new residual function, starting point selection for…
In a previous paper I showed how the ideal SLAC derivative and second-derivative operators for an infinite lattice can be obtained in simple closed form in position space, and implemented very efficiently in a stochastic fashion for…
Scalar and pseudo-scalar resonances decaying to top quarks are common predictions in several scenarios beyond the standard model (SM) and are extensively searched for by LHC experiments. Challenges on the experimental side require…
We review a number of topics related to block variable renormalisation group transformations of quantum fields on the lattice, and to the emerging perfect lattice actions. We first illustrate this procedure by considering scalar fields.…