paper

Minimizing storage in implementations of the overlap lattice-Dirac operator

arXiv:hep-lat/9811019 · doi:10.1142/S012918319900084X

Abstract

The overlap lattice-Dirac operator contains the sign function . Recent practical implementations replace by a ratio of polynomials, , and require storage of large vectors. Here I show that one can use only 4 large vectors at the cost of executing the core conjugate algorithm twice. The slow-down might be less than by a factor of 2, depending on the architecture of the computer one uses.

7 pages, plain TeX; minor errors corrected

References in corpus (3)

Cited by in corpus (23)