A fast minimal residual solver for overlap fermions

Details A fast minimal residual solver for overlap fermions A fast minimal residual solver for overlap fermions

2006-02-09

arxiv.org/abs/hep-lat/0602015v1

Physics

High Energy Physics

High Energy Physics - Lattice

27 pages, 6 plots, 2 MATLAB functions

Scientific paper

Computing quark propagators with overlap fermions requires the solution of a shifted unitary linear system. Jagels and Reichel have shown that for such systems it is possible to construct a minimal residual algorithm by short recurrences. The J\"ulich-Wuppertal group have found this algorithm to be the fastest among overlap solvers. In this paper we present a three-term recurrence for the Arnoldi unitary process. Using the new recurrence we construct a minimal residual solver which is the fastest among all Krylov subspace algorithms considered so far for the overlap inversion.

Affiliated with

Also associated with

No associations

Rating

A fast minimal residual solver for overlap fermions 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 A fast minimal residual solver for overlap fermions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast minimal residual solver for overlap fermions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600015