Speed and Adaptability of Overlap Fermion Algorithms

Abstract

We compare the efficiency of four different algorithms to compute the overlap Dirac operator, both for the speed, i.e., time required to reach a desired numerical accuracy, and for the adaptability, i.e., the scaling of speed with the condition number of the (square of the) Wilson Dirac operator. Although orthogonal polynomial expansions give good speeds at moderate condition number, they are highly non-adaptable. One of the rational function expansions, the Zolotarev approximation, is the fastest and is adaptable. The conjugate gradient approximation is adaptable, self-tuning, and nearly as fast as the ZA.

30 Pages, 7 Figures, RevTex4, New results for Zolotarev Algorithm, causing major changes in Section V and Concluding section

References in corpus (2)

• Numerical Methods for the QCD Overlap Operator: I. Sign-Function and Error Bounds
• Quenched QCD at finite temperature with chiral Fermions

Cited by in corpus (5)

• Non-equilibrium study of the Chiral Magnetic Effect from real-time simulations with dynamical fermions
• Numerical Methods for the QCD Overlap Operator:III. Nested Iterations
• Numerical Methods for the QCD Overlap Operator IV: Hybrid Monte Carlo
• Screening correlators with chiral Fermions
• Linear Algebra with Disordered Sparse Matrices that have Spatial Structure: Theory and Computation