HMC algorithm for two-flavour lattice QCD: Schwarz-preconditioning with a one-dimensional domain decomposition

Physics – High Energy Physics – High Energy Physics - Lattice

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages Contribution to XXV International Symposium on Lattice Field Theory, July 2007 Regensburg, Germany

Scientific paper

We study a variant of the Schwarz-preconditioned HMC algorithm. In contrast to the original proposal of L\"uscher, we apply the domain decomposition in one lattice direction only. This is sufficient to reduce the condition number of the fermion matrix restricted to the domains compared with the full fermion matrix. For the same linear extension of the domain, less links reside on the boundaries of the domains. Therefore it becomes e.g. practical to iterate the decomposition. We perform numerical tests for two degenerate flavours of Wilson fermions. The standard Wilson gauge action at $\beta=5.6$ is used. The performance of our implementation is compared with other recent studies using various types of preconditioning.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

HMC algorithm for two-flavour lattice QCD: Schwarz-preconditioning with a one-dimensional domain decomposition 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 HMC algorithm for two-flavour lattice QCD: Schwarz-preconditioning with a one-dimensional domain decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and HMC algorithm for two-flavour lattice QCD: Schwarz-preconditioning with a one-dimensional domain decomposition will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-462187

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.