A tupleware approach to domain decomposition methods (Q1181536)

From MaRDI portal
Revision as of 09:08, 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
A tupleware approach to domain decomposition methods
scientific article

    Statements

    A tupleware approach to domain decomposition methods (English)
    0 references
    0 references
    27 June 1992
    0 references
    The paper discusses the solution methods of domain decomposition, multigrid, and projection techniques for the elliptic boundary value problem. Results are derived measuring how much time and space can be reduced in the problem discretization phase by the use of these methods. A highly portable implementation using the Linda system for parallel or distributed programming is discussed. Linda adds a tuple data abstraction to a language, which is used to develop numerical software.
    0 references
    domain reduction method
    0 references
    time complexity
    0 references
    iterative methods
    0 references
    direct methods
    0 references
    parallel computation
    0 references
    domain decomposition
    0 references
    projection techniques
    0 references
    Linda system
    0 references
    multigrid
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references