Related papers: The eigSUMR inverter for overlap fermion
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
We present simulation results for lattice QCD with light pions. For the quark fields we apply chirally symmetric lattice Dirac operators, in particular the overlap hypercube operator, along with the standard overlap operator for comparison.…
We measure the low lying eigenmodes of an overlap Dirac operator on 2--flavor staggered configurations. By comparing the eigenmode distribution to the predictions of Random Matrix Theory we test to what accuracy staggered configurations…
Many fields of science and engineering require finding eigenvalues and eigenvectors of large matrices. The solutions can represent oscillatory modes of a bridge, a violin, the disposition of electrons around an atom or molecule, the…
Using overlap as well as Wilson fermions, we have computed the one-loop renormalization factors of ten non-singlet operators which measure the third moment of quark momentum and helicity distributions (the lowest two having been computed in…
In this paper we present an improved dqds algorithm for computing all the singular values of a bidiagonal matrix to high relative accuracy. There are two key contributions: a novel deflation strategy that improves the convergence for badly…
The spontaneous breaking of chiral symmetry in QCD is known to be linked to a non-zero density of eigenvalues of the massless Dirac operator near the origin. Numerical studies of two-flavour QCD now suggest that the low quark modes are…
We consider the renormalisation of composite quark-antiquark operators with one and two lattice covariant derivatives related to the lowest moments of generalised parton distributions (GPDs) and meson distribution amplitudes (DAs). Their…
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 discuss the application of hybrid over-relaxation, even-odd preconditioning and a modified local updating procedure to the local bosonic fermion algorithm. Studies on autocorrelation times and the tuning of the parameters of the…
A simple alternative to the conjugate gradient(CG) method is presented; this method is developed as a special case of the more general iterated Ritz method (IRM) for solving a system of linear equations. This novel algorithm is not based on…
The overlap lattice-Dirac operator contains the sign function $\epsilon (H)$. Recent practical implementations replace $\epsilon (H)$ by a ratio of polynomials, $H P_n (H^2)/Q_n (H^2)$, and require storage of $2n+2$ large vectors. Here I…
Simulating quantum systems with their environments often requires non-unitary operations, and mapping these to quantum devices often involves expensive dilations or prohibitive measurement costs to achieve desired precisions. Building on…
In this paper we present several additions to the quaternion QR algorithm, including algorithms for eigenvector computation and eigenvalue reordering. A key outcome of the eigenvalue reordering algorithm is that the aggressive early…
Recently various new concepts for the construction of Dirac operators in lattice Quantum Chromodynamics (QCD) have been introduced. These operators satisfy the so-called Ginsparg-Wilson condition (GWC), thus obeying the Atiyah-Singer index…
Lattice QCD calculations including the effects of one or more non-degenerate sea quark flavors are conventionally performed using the Rational Hybrid Monte Carlo (RHMC) algorithm, which computes the square root of the determinant of…
Lattice QCD calculations require significant computational effort, with the dominant fraction of resources typically spent in the numerical inversion of the Dirac operator. One of the simplest methods to solve such large and sparse linear…
This paper is concerned with computations of a few smaller eigenvalues (in absolute value) of a large extremely ill-conditioned matrix. It is shown that smaller eigenvalues can be accurately computed for a diagonally dominant matrix or a…
State-of-the-art LiDAR calibration frameworks mainly use non-probabilistic registration methods such as Iterative Closest Point (ICP) and its variants. These methods suffer from biased results due to their pair-wise registration procedure…
In this paper I describe a new optimal Krylov subspace solver for shifted unitary matrices called the Shifted Unitary Orthogonal Method (SUOM). This algorithm is used as a benchmark against any improvement like the two-grid algorithm. I use…