Parallelism across the steps in iterated Runge-Kutta methods for stiff initial value problems (Q1344111)

From MaRDI portal
Revision as of 09:37, 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
Parallelism across the steps in iterated Runge-Kutta methods for stiff initial value problems
scientific article

    Statements

    Parallelism across the steps in iterated Runge-Kutta methods for stiff initial value problems (English)
    0 references
    0 references
    0 references
    0 references
    22 June 1995
    0 references
    The paper deals with the solution of the initial value problem: \(y'(t)= f(y(t))\), \(y(t_ 0)= y_ 0\), \(y,f\in \mathbb{R}^ d\) on parallel computers using step-parallel iteration methods. As corrector formula the authors adopt a classical implicit Runge-Kutta formula of Radau IIA type. For the iteration they use a parallel diagonally implicit Runge-Kutta (PDIRK) approach developed by the first two authors earlier. Because in the PDIRK procedure the number of iterations needed is high, the authors introduce preconditioning in order to reduce this number.
    0 references
    stiff initial value problems
    0 references
    parallel computation
    0 references
    parallel diagonally implicit Runge-Kutta approach
    0 references
    iteration methods
    0 references
    Runge-Kutta formula of Radau IIA type
    0 references
    preconditioning
    0 references

    Identifiers

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