A fast minimal residual solver for overlap fermions
| dc.creator | Borici, Artan | |
| dc.creator | Allkoci, Alban | |
| dc.date | 2006-02-09 | |
| dc.date.accessioned | 2026-07-07T07:02:41Z | |
| dc.date.available | 2026-07-07T07:02:41Z | |
| dc.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. | |
| dc.description | 27 pages, 6 plots, 2 MATLAB functions | |
| dc.identifier | https://arxiv.org/abs/hep-lat/0602015 | |
| dc.identifier | http://arxiv.org/abs/hep-lat/0602015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/108689 | |
| dc.subject | High Energy Physics - Lattice | |
| dc.title | A fast minimal residual solver for overlap fermions | |
| dc.type | text |