Implicit Runge-Kutta methods for parallel computations
Technical Report
·
OSTI ID:5701539
Implicit Runge-Kutta methods which are well-suited for parallel computations are characterized. It is claimed that such methods are first of all, those for which the associated rational approximation to the exponential has distinct poles, and these are called multiply explicit (MIRK) methods. Also, because of the so-called order reduction phenomenon, there is reason to require that these poles be real. Then, it is proved that a necessary condition for a q-stage, real MIRK to be A sub 0-stable with maximal order q + 1 is that q = 1, 2, 3, or 5. Nevertheless, it is shown that for every positive integer q, there exists a q-stage, real MIRK which is I-stable with order q. Finally, some useful examples of algebraically stable MIRKs are given.
- Research Organization:
- National Aeronautics and Space Administration, Hampton, VA (USA). Langley Research Center
- OSTI ID:
- 5701539
- Report Number(s):
- N-87-30114; NASA-CR-178366; ICASE-87-58; NAS-1.26:178366
- Country of Publication:
- United States
- Language:
- English
Similar Records
Additive semi-implicit Runge-Kutta methods for computing high-speed nonequilibrium reactive flows
Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. II. Implicit Methods
Implicit and Implicit–Explicit Strong Stability Preserving Runge–Kutta Methods with High Linear Order
Journal Article
·
Tue Oct 01 00:00:00 EDT 1996
· Journal of Computational Physics
·
OSTI ID:508264
Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. II. Implicit Methods
Journal Article
·
Mon Jan 14 23:00:00 EST 2019
· Journal of Mathematical Sciences
·
OSTI ID:22773577
Implicit and Implicit–Explicit Strong Stability Preserving Runge–Kutta Methods with High Linear Order
Journal Article
·
Sun Sep 17 20:00:00 EDT 2017
· Journal of Scientific Computing
·
OSTI ID:1574706