Comparison of Inversion Algorithms for Wilson Fermions on the CM5
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
This talk presents results of a comparitive study of iterative algorithms like minimal residue ($MR$) and conjugate gradient ($CG$, $BiCGγ_5$, and \bicgstab) used for inverting the Dirac matrix $M$. The tests were done on the Connection Machine CM-5 using $32^3 \times 64$ lattices. The fermion action used is of Wilson type, both with and without the clover term. The overall conclusion is that preconditioned over-relaxed $MR$ is the simplest, uses the least memory, and is comparable in performance to \bicgstab. We find these two algorithms to be equally robust, $i.e.$ insensitive to the starting solution and to round-off errors.
5 pages. Package submitted in uufiles format: unpack and tex paper.tex. Modified "axis" source for figures also included. Needs macro packages lanlmac and epsf. Uses hyperbasics if available. Talk presented by Rajan Gupta at the workshop ``Accelerating Fermion Algorithms'', Jülich, Feb 1996
5 pages. Package submitted in uufiles format: unpack and tex paper.tex. Modified "axis" source for figures also included. Needs macro packages lanlmac and epsf. Uses hyperbasics if available. Talk presented by Rajan Gupta at the workshop ``Accelerating Fermion Algorithms'', Jülich, Feb 1996