Note on the Vectorization of Algebraic Multigrid Algorithms

摘要

The algebraic multigrid code AMHG1R1 is a flexible sparse linear equation solver which achieves very good convergence factors. The authors discuss algorithms for vectorizing the solution phase of the code including a modification of the current Gauss-Seidel iteration and some methods for reducing the overhead associated with these techniques. High degrees of vectorization are achieved and experiments on supercomputers with hardware gather/scatter show satisfactory speed-ups. This approach can be applied to other sparse linear algebra iterations to enhance vectorization. (Copyright (c) GMD 1987.)