Block Algorithms for Quark Propagator Calculation

Details Block Algorithms for Quark Propagator Calculation Block Algorithms for Quark Propagator Calculation

1997-09-22

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

Nucl.Phys.Proc.Suppl. 63 (1998) 961-963

Physics

High Energy Physics

High Energy Physics - Lattice

3 pages, 1 figure, LaTeX2e, uses espcrc2 and epsf. Poster presented at Lattice '97

Scientific paper

10.1016/S0920-5632(97)00955-9

Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the multiple systems simultaneously. This paper compares a block generalisation of the quasi-minimal residual method (QMR), Block Conjugate Gradient on the normal equation, Block Lanczos and ($\gamma_5$-symmetric) Block BiConjugate Gradient.

Affiliated with

Also associated with

No associations

Rating

Block Algorithms for Quark Propagator Calculation 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 Block Algorithms for Quark Propagator Calculation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block Algorithms for Quark Propagator Calculation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-504470