A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods (Q1964103)

From MaRDI portal
Revision as of 00:04, 26 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127571017, #quickstatements; #temporary_batch_1721947978549)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods
scientific article

    Statements

    A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods (English)
    0 references
    0 references
    0 references
    1999
    0 references
    This article is concerned with the implementation of implicit Runge-Kutta (RK) methods such as those based on Gauss, Radon and Lobatto points applied to (stiff) ordinary differential equations. The use of a preconditioner, whose decomposition cost for parallel implementation is equivalent to the cost for the implicit-Euler method, is proposed. The preconditioner is based on the \(W\)-transformation of the RK coefficient-matrices. At the end numerical results are presented.
    0 references
    Gauss points
    0 references
    Radon points
    0 references
    Lobatto points
    0 references
    stiff equations
    0 references
    parallel computation
    0 references
    implicit Runge-Kutta methods
    0 references
    preconditioner
    0 references
    implicit-Euler method
    0 references
    \(W\)-transformation
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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