Speed and adaptability of overlap fermion algorithms

Gavai, Rajiv V. ; Gupta, Sourendu ; Lacaze, Robert (2003) Speed and adaptability of overlap fermion algorithms Computer Physics Communications, 154 (2). pp. 143-158. ISSN 0010-4655

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/S...

Related URL: http://dx.doi.org/10.1016/S0010-4655(03)00297-2

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.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:66142
Deposited On:21 Oct 2011 09:33
Last Modified:12 Jul 2012 10:10

Repository Staff Only: item control page