Domain decomposition improvement of quark propagator estimation

Physics – High Energy Physics – High Energy Physics - Lattice

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, 8 figures, version to appear in Computer Physics Communications

Scientific paper

10.1016/j.cpc.2006.09.001

Applying domain decomposition to the lattice Dirac operator and the associated quark propagator, we arrive at expressions which, with the proper insertion of random sources therein, can provide improvement to the estimation of the propagator. Schemes are presented for both open and closed (or loop) propagators. In the end, our technique for improving open contributions is similar to the ``maximal variance reduction'' approach of Michael and Peisa, but contains the advantage, especially for improved actions, of dealing directly with the Dirac operator. Using these improved open propagators for the Chirally Improved operator, we present preliminary results for the static-light meson spectrum. The improvement of closed propagators is modest: on some configurations there are signs of significant noise reduction of disconnected correlators; on others, the improvement amounts to a smoothening of the same correlators.

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

Domain decomposition improvement of quark propagator estimation 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 Domain decomposition improvement of quark propagator estimation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domain decomposition improvement of quark propagator estimation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-79047

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