A fast minimal residual solver for overlap fermions

2006/02/09 by Artan Boriçi, Artan Borici, Borici, Artan +2
Chemistry · Physics and Astronomy · #Advanced NMR Techniques and Applications #FOS: Physical sciences #High Energy Physics - Lattice (hep-lat) #Particle physics theoretical and experimental studies #Quantum Chromodynamics and Particle Interactions #hep-lat

paper · pdf · doi:10.48550/arxiv.hep-lat/0602015

27 pages, 6 plots, 2 MATLAB functions

arxiv created 2006/02/09 · openalex publication_date 2006/02/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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ü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.

Related

• Numerical Methods for the QCD Overlap Operator: II. Optimal Krylov Subspace Methods
• Krylov space solvers for shifted linear systems
• First numerical experiences with overlap fermions based on the Brillouin\n kernel
• On the suitability of the Brillouin action as a kernel to the overlap procedure
• Computational methods for the fermion determinant and the link between overlap and domain wall fermions