Related papers: Embedded error estimation and adaptive step-size c…
We investigate the strong stability preserving (SSP) property of two-step Runge-Kutta (TSRK) methods. We prove that all SSP TSRK methods belong to a particularly simple subclass of TSRK methods, in which stages from the previous step are…
Many time-dependent differential equations are equipped with invariants. Preserving such invariants under discretization can be important, e.g., to improve the qualitative and quantitative properties of numerical solutions. Recently,…
When a high dimension system of ordinary differential equations is solved numerically, the computer memory capacity may be compromised. Thus, for such systems, it is important to incorporate low memory usage to some other properties of the…
In this paper, we extend the Paired-Explicit Runge-Kutta schemes by Vermeire et. al. to fourth-order of consistency. Based on the order conditions for partitioned Runge-Kutta methods we motivate a specific form of the Butcher arrays which…
We study spatially partitioned embedded Runge--Kutta (SPERK) schemes for partial differential equations (PDEs), in which each of the component schemes is applied over a different part of the spatial domain. Such methods may be convenient…
In this technical note a general procedure is described to construct internally consistent splitting methods for the numerical solution of differential equations, starting from matching pairs of explicit and diagonally implicit Runge-Kutta…
It is difficult to design high order numerical schemes which could preserve both the maximum bound property (MBP) and energy dissipation law for certain phase field equations. Strong stability preserving (SSP) Runge-Kutta methods have been…
A posteriori error estimates based on residuals can be used for reliable error control of numerical methods. Here, we consider them in the context of ordinary differential equations and Runge-Kutta methods. In particular, we take the…
In this paper, Runge-Kutta-Gegenbauer (RKG) stability polynomials of arbitrarily high order of accuracy are introduced in closed form. The stability domain of RKG polynomials extends in the the real direction with the square of polynomial…
Deep neural networks have achieved state-of-the-art performance in a variety of fields. Recent works observe that a class of widely used neural networks can be viewed as the Euler method of numerical discretization. From the numerical…
Stabilized methods (also called Chebyshev methods) are explicit methods with extended stability domains along the negative real axis. These methods are intended for large mildly stiff problems, originating mainly from parabolic PDEs. In…
In this paper we derive and analyze the properties of explicit singly diagonal implicit Runge-Kutta (ESDIRK) integration methods. We discuss the principles for construction of Runge-Kutta methods with embedded methods of different order for…
The analysis of strong-stability-preserving (SSP) linear multistep methods is extended to semi-discretized problems for which different terms on the right-hand side satisfy different forward Euler (or circle) conditions. Optimal additive…
We develop error-control based time integration algorithms for compressible fluid dynamics (CFD) applications and show that they are efficient and robust in both the accuracy-limited and stability-limited regime. Focusing on discontinuous…
We investigate dense output formulae (also known as continuous extensions) for strong stability preserving (SSP) Runge-Kutta methods. We require that the dense output formula also possess the SSP property, ideally under the same step-size…
This paper deals with stability of classical Runge-Kutta collocation methods. When such methods are embedded in linearly implicit methods as developed in [12] and used in [13] for the time integration of nonlinear evolution PDEs, the…
High order strong stability preserving (SSP) time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs. Over the past decade…
Exponential integrators are explicit methods for solving ordinary differential equations that treat linear behaviour exactly. The stiff-order conditions for exponential integrators derived in a Banach space framework by Hochbruck and…
As supercomputers grow in hardware complexity, their susceptibility to faults increases and measures need to be taken to ensure the correctness of results. Some numerical algorithms have certain characteristics that allow them to recover…
This paper proposes an implicit family of sub-step integration algorithms grounded in the explicit singly diagonally implicit Runge-Kutta (ESDIRK) method. The proposed methods achieve third-order consistency per sub-step and thus the…