Convergence aspects of step-parallel iteration of Runge-Kutta methods (Q1902089): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3830493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel ODE-solvers with stepsize control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and pseudo-eigenvalues of Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Runge–Kutta Methods on Parallel Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iteration across the steps of high-order Runge-Kutta methods for nonstiff initial value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism across the steps in iterated Runge-Kutta methods for stiff initial value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Step-parallel algorithms for stiff initial value problems / rank
 
Normal rank

Latest revision as of 18:12, 23 May 2024

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