Quark propagator on the Connection Machine (Q1310586)

The fermion propagator in lattice quantum chromodynamics (QCD) is studied. QCD cannot be solved analytically. A very promising way to evaluate such theories of elementary particles is offered by their discretization and computation on the lattice. This method is called lattice gauge theory. The basic problem which is solved is the numerical solution of the Euclidean Dirac equation. The structure and performance of two linear equation solvers, the Jacobi algorithm and the conjugate gradient algorithm, and there implementation on the connection machine CM-2 are presented. The computer time needed for next neighbour communication versus the time required for floating point operations on \(8^ 4\) and \(16^ 4\) lattices are investigated. The convergence behaviour of conjugate gradient and Jacobi as applied to gauge configurations at \(beta=0.0\) and 6.0 are compared.