Parallelization and vectorization aspects of the solution of tridiagonal linear systems (Q913446)

From MaRDI portal
Revision as of 10:35, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parallelization and vectorization aspects of the solution of tridiagonal linear systems
scientific article

    Statements

    Parallelization and vectorization aspects of the solution of tridiagonal linear systems (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    The solution of one or several tridiagonal systems is one of the basic operations in numerical computations. The authors develop, investigate and compare some parallel tridiagonal system solvers suitable for message-based MIMD computers with vector processors. The basic idea of the algorithm presented consists in subdividing the tridiagonal system into p \((=\) number of processes) parts by splitting the ``interface'' equations which couple the parts, eliminating the ``inner'' unknowns, solving the assembled ``interface'' system for the coupling unknowns, and calculating back the ``inner'' unknowns. The elimination of the ``inner'' unkowns and the back-calculation can be fully done in parallel. Only the assembling and the solution of the ``interface'' system is connected with communication between the processors. The several solution strategies discussed in the paper were tested and compared on the iPSC2-VX.
    0 references
    direct methods
    0 references
    parallel computation
    0 references
    tridiagonal systems
    0 references
    MIMD computers
    0 references
    0 references

    Identifiers