Speed and Adaptability of Overlap Fermion Algorithms

Details Speed and Adaptability of Overlap Fermion Algorithms Speed and Adaptability of Overlap Fermion Algorithms

2002-07-11

arxiv.org/abs/hep-lat/0207005v2

Comput.Phys.Commun. 154 (2003) 143-158

Physics

High Energy Physics

High Energy Physics - Lattice

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

Scientific paper

10.1016/S0010-4655(03)00297-2

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.

Affiliated with

Also associated with

No associations

Rating

Speed and Adaptability of Overlap Fermion Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Speed and Adaptability of Overlap Fermion Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speed and Adaptability of Overlap Fermion Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-185276