Phan Quang Tuyen

Main Article Content

Abstract

In this paper, we propose and discuss numerical algorithms for solving a class of nonlinear differential-algebraic equations (DAEs). These algorithms are based on half-explicit Runge-Kutta methods (HERK) that have been studied recently for solving strangeness-free DAEs. The main idea of this work is to use the half-explicit variants of some well-known embedded Runge-Kutta methods such as Runge-Kutta-Fehlberg and Dormand-Prince pairs. Thus, we can estimate local errors and choose suitable stepsizes accordingly to a given tolerance. The cases of unstructured and structured DAEs are investigated and compared. Finally, some numerical experiences are given for illustrating the efficiency of the algorithms.

Keywords: Differential-algebraic equation, strangeness-free form, half-explicit Runge-Kutta method, Fehlberg and Dormand-Prince embedded pairs.

References

[1] U. Ascher, L. Petzold, Computer methods for Ordinary differential equations and differential-algebraic equations, SIAM, Philadelphia, 1998.
[2] P. Kunkel, V. Mehrmann, Differential-Algebraic Equations Analysis and Numerical Solution, European Mathematical Society, Zurich, 2006.
[3] V.H. Linh, V. Mehrmann, Efficient integration of strangeness-free non-stiff differential-algebraic equations by half-explicit methods, J. Comput, Appl. Math. 262 (2014) 346-360.
[4] V.H. Linh, N.D. Truong, Runge-Kutta methods revisited for a class of structured strangeness-free differential-algebraic equations, Electr. Trans. Num. Anal. 48 (2018) 131-135.