Journal Article

FZJ-2019-01083

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Parallel SSOR preconditioning for lattice QCD

Lippert, T.FZJ*

1999
North-Holland, Elsevier Science Amsterdam [u.a.]

This record in other databases:

Please use a persistent id in citations: doi:10.1016/S0167-8191(99)00055-1

Abstract: The locally lexicographic symmetric successive overrelaxation algorithm (ll-SSOR) is the most effective parallel preconditioner known for iterative solvers used in lattice gauge theory. After reviewing the basic properties of ll-SSOR, the focus of this contribution is put on its parallel aspects: the administrative overhead of the parallel implementation of ll-SSOR, which is due to many conditional operations, decreases its efficiency by a factor of up to one third. A simple generalization of the algorithm is proposed that allows the application of the lexicographic ordering along specified axes, while along the other dimensions odd–even preconditioning is used. In this way one can tune the preconditioner towards optimal performance by balancing ll-SSOR effectivity and administrative overhead.

---

---

Database coverage:
; 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

---