Diagonally implicit Runge-Kutta (DIRK) methods are a prominent class of numerical methods for solving stiff systems of ordinary differential equations (ODEs). Stiffness does not only impose stability challenges on Runge-Kutta methods; it can also degrade the order of convergence. This so-called order reduction phenomenon occurs when assumptions used for classical convergence analysis, e.g., an asymptotically small step size, fail to hold. In a prior paper by the authors, sharp order conditions and global error bounds for Runge-Kutta methods were developed, which hold uniformly with respect to stiffness when applied to a wide class of semilinear ODEs. In this work, those conditions are leveraged to construct the first DIRK methods of order four and five which satisfy these conditions and thus do not exhibit order reduction. Numerical results demonstrate that for a broad class of relevant nonlinear test problems, these new methods successfully mitigate order reduction, accurately estimate local error via an embedding for adaptive step size control, and can outperform classical DIRK methods.
Peer two-step methods are attractive for the numerical solution of stiff initial value problems because they combine favorable features of Runge-Kutta and multi-step methods, including high-order accuracy, strong stability properties, and the avoidance of order reduction. This paper develops rigorous norm estimates for...
This paper extends the convergence analysis of explicit exponential Runge--Kutta methods for linear parabolic problems $u'(t) + Au(t) = Bu(t)$, where $A$ generates an analytic semigroup and $B$ is relatively bounded with respect to $A$, from the third-order case to fourth-order schemes. By establishing the global error...
T. Dang, P. A. Gazca-Orozco, T. Hoang· 0 citations
Nonlinear stabilization is indispensable for discontinuous Galerkin (DG) discretizations of hyperbolic conservation laws, yet it typically disrupts the delicate error structure required for superconvergence analysis. Consequently, existing theory has largely been restricted to linear or semi-discrete schemes lacking os...
In this work, we investigate implicit-explicit (IMEX) arbitrary high-order Deferred Correction (DeC) methods for the approximation of ordinary differential equations (ODEs). Such schemes are characterized by an iterative procedure that increases the order of accuracy by one at each iteration. More precisely, we study a...
Lorenzo Micalizzi, Davide Torlo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.