Explicit Runge-Kutta-Chebyshev methods of second order with monotonic stability polynomial
By: Boris Faleichik, Andrew Moisa
Potential Business Impact:
Solves tricky math problems faster and more accurately.
A new Chebyshev-type family of stabilized explicit methods for solving mildly stiff ODEs is presented. Besides conventional conditions of order and stability we impose an additional restriction on the methods: their stability function must be monotonically increasing and positive along the largest possible interval of negative real axis. Although stability intervals of the proposed methods are smaller than those of classic Chebyshev-type methods, their stability functions are more consistent with the exponent, they have more convex stability regions and smaller error constants. These properties allow the monotonic methods to be competitive with contemporary stabilized second-order methods, as the presented results of numerical experiments demonstrate.
Similar Papers
A class of flexible and efficient partitioned Runge-Kutta-Chebyshev methods for some time-dependent partial differential equations
Numerical Analysis
Solves hard math problems faster on computers.
A class of flexible and efficient partitioned Runge-Kutta-Chebyshev methods for some time-dependent partial differential equations
Numerical Analysis
Solves hard math problems faster on computers.
Multi-order Runge-Kutta methods or how to numerically solve initial value problems of any order
Numerical Analysis
Solves math problems more accurately, faster.