Name
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0167-8191(99)00055-1 | Parallel Computing |
Keywords | Field | DocType |
parallel preconditioning,ordering,linear solvers,lattice quantum chromodynamics,parallel ssor preconditioning,ssor algorithm,lattice qcd,quantum chromodynamics | Lattice gauge theory,Discrete mathematics,Algebra,Preconditioner,Computer science,Parallel computing,Lattice QCD,Lexicographical order | Journal |
Volume | Issue | ISSN |
25 | 10-11 | Parallel Computing |
Citations | PageRank | References |
4 | 0.72 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Th. Lippert | 1 | 6 | 1.11 |