Related papers: Short-recurrence Krylov subspace methods for the o…
The computation of the partial generalized singular value decomposition (GSVD) of large-scale matrix pairs can be approached by means of iterative methods based on expanding subspaces, particularly Krylov subspaces. We consider the joint…
We propose a new class of short matrix recurrences for the solution of nonsymmetric linear equations of the type $\mathbf{A}_1\mathbf{X}\mathbf{B}_1+\ldots+\mathbf{A}_p\mathbf{X}\mathbf{B}_p=CD^T$. These iterative methods combine local…
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…
A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations…
We review the numerical analysis' understanding of Krylov subspace methods for solving (non-hermitian) systems of equations and discuss its implications for lattice gauge theory computations using the example of the Wilson fermion matrix.…
In this paper, we consider the problem of minimizing the sum of two convex functions subject to linear linking constraints. The classical alternating direction type methods usually assume that the two convex functions have relatively easy…
The overlap hypercube fermion is a variant of a chirally symmetric lattice fermion, which is endowed with a higher level of locality than the standard overlap fermion. We apply this formulation in quenched QCD simulations with light quarks.…
In the present paper, we consider large scale nonsymmetric differential matrix Riccati equations with low rank right hand sides. These matrix equations appear in many applications such as control theory, transport theory, applied…
We study QCD at finite density and low temperature by using the complex Langevin method. We employ the gauge cooling to control the unitarity norm and introduce a deformation parameter in the Dirac operator to avoid the singular-drift…
In this paper, we present a new Hyperfast Second-Order Method with convergence rate $O(N^{-5})$ up to a logarithmic factor for the convex function with Lipshitz the third derivative. This method based on two ideas. The first comes from the…
As an important algorithm in deep reinforcement learning, advantage actor critic (A2C) has been widely succeeded in both discrete and continuous control tasks with raw pixel inputs, but its sample efficiency still needs to improve more. In…
This paper presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits the domain…
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 method is one of the standard approaches for computing a few eigenpairs of a large, sparse, symmetric matrix. It is typically used with restarting to avoid unbounded growth of memory and computational requirements. Thick-restart…
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 eigenvalue spectrum $\rho(\lambda)$ of the Dirac operator is numerically calculated in lattice QCD with 2+1 flavors of dynamical domain-wall fermions. In the high-energy regime, the discretization effects become significant. We subtract…
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.
This work develops novel rational Krylov methods for updating a large-scale matrix function f(A) when A is subject to low-rank modifications. It extends our previous work in this context on polynomial Krylov methods, for which we present a…
All approaches currently used to study finite baryon density lattice QCD suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We formulate and test an algorithm, sign reweighting, that works directly…
We compare the behavior of different lattice Dirac operators in gauge backgrounds which are lattice discretizations of a classical instanton. In particular we analyze the standard Wilson operator, a chirally improved Dirac operator and the…