A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm (Q1570339)

From MaRDI portal
Revision as of 21:34, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm
scientific article

    Statements

    A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm (English)
    0 references
    0 references
    0 references
    18 April 2001
    0 references
    The authors propose a method to parallelize high-order compact numerical algorithms for the solution of three-dimensional partial differential equations in a space-time domain. This method is compared with the basic pipelined Thomas algorithm. In the proposed algorithm, the processors are used for the next computational tasks, whereas in the basic pipelined Thomas algorithm they stay idle waiting for the data from neighboring processors at the forward and the backward steps of the Thomas algorithm.
    0 references
    parallel computing
    0 references
    higher-order numerical method
    0 references
    compact scheme
    0 references
    pipelined Gauss elimination
    0 references
    Thomas algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references