A fast minimal residual solver for overlap fermions
High Energy Physics - Lattice
2007-05-23 v1
Abstract
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\"ulich-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.
Cite
@article{arxiv.hep-lat/0602015,
title = {A fast minimal residual solver for overlap fermions},
author = {Artan Borici and Alban Allkoci},
journal= {arXiv preprint arXiv:hep-lat/0602015},
year = {2007}
}
Comments
27 pages, 6 plots, 2 MATLAB functions