Second-order stabilized explicit Runge–Kutta methods for stiff problems

Stabilized Runge–Kutta methods (they have also been called Chebyshev–Runge–Kutta methods) are explicit methods with extended stability domains, usually along the negative real axis. They are easy to use (they do not require algebra routines) and are especially suited for MOL discretizations of two-...

Full description

Saved in:
Bibliographic Details
Published in:Computer physics communications 2009-10, Vol.180 (10), p.1802-1810
Main Authors: Martín-Vaquero, J., Janssen, B.
Format: Article
Language:English
Subjects:
Stabilized explicit Runge–Kutta methods
Stiff problems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Stabilized Runge–Kutta methods (they have also been called Chebyshev–Runge–Kutta methods) are explicit methods with extended stability domains, usually along the negative real axis. They are easy to use (they do not require algebra routines) and are especially suited for MOL discretizations of two- and three-dimensional parabolic partial differential equations. Previous codes based on stabilized Runge–Kutta algorithms were tested with mildly stiff problems. In this paper we show that they have some difficulties to solve efficiently problems where the eigenvalues are very large in absolute value (over 10 5). We also develop a new procedure to build this kind of algorithms and we derive second-order methods with up to 320 stages and good stability properties. These methods are efficient numerical integrators of very large stiff ordinary differential equations. Numerical experiments support the effectiveness of the new algorithms compared to well-known methods as RKC, ROCK2, DUMKA3 and ROCK4.
ISSN:0010-4655
1879-2944
DOI:10.1016/j.cpc.2009.05.006