Implicit Runge-Kutta methods for parallel computations
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
A comparative study of Rosenbrock-type and implicit Runge-Kutta time integration for discontinuous Galerkin method for unsteady 3D compressible Navier-Stokes equations
Implicit–explicit (IMEX) Runge–Kutta methods for non-hydrostatic atmospheric models