guest ::
| Home > External Publications > Vita Publications > Quark propagator on the Connection Machine |
| Home > External Publications > Vita Publications > Quark propagator on the Connection Machine |
| Journal Article | FZJ-2019-01085 |
; ;
1992
North-Holland, Elsevier Science
Amsterdam [u.a.]
This record in other databases:
Please use a persistent id in citations: doi:10.1016/0167-8191(92)90120-V
Abstract: The computation of the fermion propagator in lattice Quantum Chromodynamics requires the solution of a large system of linear equations. We discuss and compare the structure, implementation and performance of two linear equation solvers, the Jacobi algorithm and the Conjugate Gradient algorithm, on the Connection Machine CM-2. We investigate the computer time needed for next neighbor communication versus the time required for floating point operations on 84 and 164 lattices. We compare the convergence behavior of Conjugate Gradient and Jacobi as applied to gauge configurations at β = 0.0 and 6.0.
; Clarivate Analytics Master Journal List ; Current Contents - Engineering, Computing and Technology ; Ebsco Academic Search ; IF < 5 ; JCR ; SCOPUS ; Science Citation Index Expanded ; Web of Science Core Collection
|
The record appears in these collections: |