Related papers: Positive and elementary stable explicit nonstandar…
Motivated by studies on fully discrete numerical schemes for linear hyperbolic conservation laws, we present a framework on analyzing the strong stability of explicit Runge-Kutta (RK) time discretizations for semi-negative autonomous linear…
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge-Kutta methods. Relative to classical Runge-Kutta methods, methods with an effective order of accuracy are designed to satisfy a relaxed set of order…
We prove that Runge-Kutta (RK) methods for numerical integration of arbitrarily large systems of Ordinary Differential Equations are linearly stable. Standard stability arguments -- based on spectral analysis, resolvent condition or strong…
Explicit Runge-Kutta methods are classical and widespread techniques in the numerical solution of ordinary differential equations (ODEs). Considering partial differential equations, spatial semidiscretisations can be used to obtain systems…
We further develop a simple modification of Runge--Kutta methods that guarantees conservation or stability with respect to any inner-product norm. The modified methods can be explicit and retain the accuracy and stability properties of the…
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 important initial value problems have the property that energy is non-increasing in time. Energy stable methods, also referred to as strongly stable methods, guarantee the same property discretely. We investigate requirements for…
High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The…
Stabilized Runge-Kutta methods are especially efficient for the numerical solution of large systems of stiff nonlinear differential equations because they are fully explicit. For semi-discrete parabolic problems, for instance, stabilized…
Modified Patankar-Runge-Kutta (MPRK) methods preserve the positivity as well as conservativity of a production-destruction system (PDS) of ordinary differential equations for all time step sizes. As a result, higher order MPRK schemes do…
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…
Strong Stability Preserving (SSP) time integration schemes maintain stability of the forward Euler method for any initial value problem. However, only a small subset of Runge-Kutta (RK) methods are SSP, and many efficient high-order time…
In this note, we connect two different topics from linear algebra and numerical analysis: hypocoercivity of semi-dissipative matrices and strong stability for explicit Runge--Kutta schemes. Linear autonomous ODE systems with a non-coercive…
Strong stability is a property of time integration schemes for ODEs that preserve temporal monotonicity of solutions in arbitrary (inner product) norms. It is proved that explicit Runge--Kutta schemes of order $p\in 4\mathbb{N}$ with $s=p$…
In this paper, two new families of fourth-order explicit exponential Runge--Kutta (ERK) methods with four stages are studied for solving first-order differential systems $y'(t)+My(t)=f(y(t))$. By comparing the Taylor series of the exact…
We provide a note on continuous-stage Runge-Kutta methods (csRK) for solving initial value problems of first-order ordinary differential equations. Such methods, as an interesting and creative extension of traditional Runge-Kutta (RK)…
A time discretization method is called strongly stable, if the norm of its numerical solution is nonincreasing. It is known that, even for linear semi-negative problems, many explicit Runge--Kutta (RK) methods fail to preserve this…
A numerical search approach is used to design high-order diagonally implicit Runge-Kutta (DIRK) schemes equipped with embedded error estimators, some of which have identical diagonal elements (SDIRK) and explicit first stage (ESDIRK). In…
A mixed accuracy framework for Runge--Kutta methods presented in Grant [JSC 2022] and applied to diagonally implicit Runge--Kutta (DIRK) methods can significantly speed up the computation by replacing the implicit solver by less expensive…
A wide range of physical phenomena exhibit auxiliary admissibility criteria, such as conservation of entropy or various energies, which arise implicitly under the exact solution of their governing PDEs. However, standard temporal schemes,…