Convergence aspects of step-parallel iteration of Runge-Kutta methods (Q1902089)

From MaRDI portal
Revision as of 18:12, 23 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Convergence aspects of step-parallel iteration of Runge-Kutta methods
scientific article

    Statements

    Convergence aspects of step-parallel iteration of Runge-Kutta methods (English)
    0 references
    0 references
    0 references
    0 references
    7 January 1996
    0 references
    The nonlinear equations arising in the application of implicit Runge- Kutta methods (such as Radau IIA) have to be solved iteratively. One possibility to exploit parallel computer systems is to start the iterations in future steps already before convergence has been achieved in the actual step (parallelism across steps). This paper presents a convergence analysis (based on the test equation \(y'= \lambda y\)) for a special class of such step-parallel iteration methods.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel computation
    0 references
    parallelism across steps
    0 references
    implicit Runge-Kutta methods
    0 references
    Radau IIA
    0 references
    convergence
    0 references
    test equation
    0 references
    iteration methods
    0 references