Minimizing storage in implementations of the overlap lattice-Dirac operator

Details Minimizing storage in implementations of the overlap lattice-Dirac operator Minimizing storage in implementations of the overlap lattice-Dirac operator

1998-11-13

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

Int.J.Mod.Phys. C10 (1999) 1051-1058

Physics

High Energy Physics

High Energy Physics - Lattice

7 pages, plain TeX; minor errors corrected

Scientific paper

The overlap lattice-Dirac operator contains the sign function $\epsilon (H)$. Recent practical implementations replace $\epsilon (H)$ by a ratio of polynomials, $H P_n (H^2)/Q_n (H^2)$, and require storage of $2n+2$ 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.

Affiliated with

Also associated with

No associations

Rating

Minimizing storage in implementations of the overlap lattice-Dirac operator 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 Minimizing storage in implementations of the overlap lattice-Dirac operator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing storage in implementations of the overlap lattice-Dirac operator will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157539