Implicit-Explicit Runge-Kutta-Rosenbrock Methods with Error Analysis for Nonlinear Stiff Differential Equations

2021 ◽  
Vol 39 (4) ◽  
pp. 569-590
Author(s):  
global sci
2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
M. Y. Liu ◽  
L. Zhang ◽  
C. F. Zhang

The implicit Runge–Kutta method with A-stability is suitable for solving stiff differential equations. However, the fully implicit Runge–Kutta method is very expensive in solving large system problems. Although some implicit Runge–Kutta methods can reduce the cost of computation, their accuracy and stability are also adversely affected. Therefore, an effective banded implicit Runge–Kutta method with high accuracy and high stability is proposed, which reduces the computation cost by changing the Jacobian matrix from a full coefficient matrix to a banded matrix. Numerical solutions and results of stiff equations obtained by the methods involved are compared, and the results show that the banded implicit Runge–Kutta method is advantageous to solve large stiff problems and conducive to the development of simulation.


2017 ◽  
Vol 17 (3) ◽  
pp. 479-498 ◽  
Author(s):  
Raphael Kruse ◽  
Yue Wu

AbstractThis paper contains an error analysis of two randomized explicit Runge–Kutta schemes for ordinary differential equations (ODEs) with time-irregular coefficient functions. In particular, the methods are applicable to ODEs of Carathéodory type, whose coefficient functions are only integrable with respect to the time variable but are not assumed to be continuous. A further field of application are ODEs with coefficient functions that contain weak singularities with respect to the time variable. The main result consists of precise bounds for the discretization error with respect to the {L^{p}(\Omega;{\mathbb{R}}^{d})}-norm. In addition, convergence rates are also derived in the almost sure sense. An important ingredient in the analysis are corresponding error bounds for the randomized Riemann sum quadrature rule. The theoretical results are illustrated through a few numerical experiments.


1970 ◽  
Vol 30 ◽  
pp. 122-132
Author(s):  
Sharaban Thohura ◽  
Azad Rahman

Special classes of Initial value problem of differential equations termed as stiff differential equations occur naturally in a wide variety of applications including the studies of spring and damping systems, chemical kinetics, electrical circuits, and so on. Most realistic stiff systems do not have analytical solutions so that a numerical procedure must be used. In this paper we have discussed the phenomenon of stiffness and the general purpose procedures for the solution of stiff differential equation. Because of their applications in many branches of engineering and science, many algorithms have been proposed to solve such problems. In this study we have focused on some conventional methods namely Runge-Kutta method, Adaptive Stepsize Control for Runge-Kutta and an ODE Solver package, EPISODE. We describe the characteristics shared by these methods. We compare the performance and the computational effort of such methods. In order to achieve higher accuracy in the solution, the traditional numerical methods such as Euler, explicit Runge-Kutta and Adams –Moulton methods step size need to be very small. This however introduces enough round-off errors to cause instability of the solution. To overcome this problem we have used two other algorithms namely Adaptive Stepsize Control for Runge-Kutta and EPISODE. The results are compared with exact one to determine the efficiency of the above mentioned method. GANIT J. Bangladesh Math. Soc. (ISSN 1606-3694) 30 (2010) 121-132  DOI: http://dx.doi.org/10.3329/ganit.v30i0.8509


Sign in / Sign up

Export Citation Format

Share Document