A fast minimal residual solver for overlap fermions
Abstract
Description
Computing quark propagators with overlap fermions requires the solution of a shifted unitary linear system. Jagels and Reichel have shown that for such systems it is possible to construct a minimal residual algorithm by short recurrences. The Jülich-Wuppertal group have found this algorithm to be the fastest among overlap solvers. In this paper we present a three-term recurrence for the Arnoldi unitary process. Using the new recurrence we construct a minimal residual solver which is the fastest among all Krylov subspace algorithms considered so far for the overlap inversion.
27 pages, 6 plots, 2 MATLAB functions
27 pages, 6 plots, 2 MATLAB functions