A note on the vectorization of algebraic multigrid algorithms (Q911699)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A note on the vectorization of algebraic multigrid algorithms
scientific article

    Statements

    A note on the vectorization of algebraic multigrid algorithms (English)
    0 references
    0 references
    1988
    0 references
    The authors discuss the vectorization of the algebraic multigrid method (AMG) for solving large sparse linear systems. The implementation is based on a combination of Gauss-Seidel and Jacobi relaxations that depends on work vector length. Experiments deal with the discretization of a self-adjoint elliptic equation on a square and with a random problem; they show that vectorized AMG performs considerably better than the sequential version, with respect to total time employed. The codes have been run on a Cray XMP machine and a Fujitsu vector processor.
    0 references
    0 references
    0 references
    0 references
    0 references
    Gauss-Seidel method
    0 references
    vectorization
    0 references
    algebraic multigrid method
    0 references
    large sparse linear systems
    0 references
    Jacobi relaxations
    0 references
    Fujitsu vector processor
    0 references
    0 references
    0 references