Related papers: Algebraic Conditions for Stability in Runge-Kutta …

Strong stability preserving (SSP) Runge-Kutta methods are often desired when evolving in time problems that have two components that have very different time scales. Where the SSP property is needed, it has been shown that implicit and…

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…

The use of high order fully implicit Runge-Kutta methods is of significant importance in the context of the numerical solution of transient partial differential equations, in particular when solving large scale problems due to fine space…

Some properties of numerical time integration methods using summation by parts operators and simultaneous approximation terms are studied. These schemes can be interpreted as implicit Runge-Kutta methods with desirable stability properties…

A new approach for the construction of high order A-stable explicit integrators for ordinary differential equations (ODEs) is theoretically studied. Basically, the integrators are obtained by splitting, at each time step, the solution of…

The issues of robust stability for two types of uncertain fractional-order systems of order $\alpha \in (0,1)$ are dealt with in this paper. For the polytope-type uncertainty case, a less conservative sufficient condition of robust…

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…

High-order spatial discretizations with strong stability properties (such as monotonicity) are desirable for the solution of hyperbolic PDEs. Methods may be compared in terms of the strong stability preserving (SSP) time-step. We prove an…

Many control, optimization, and learning algorithms rely on discretizations of continuous-time contracting systems, where preservation of contractivity under numerical integration is key for stability, robustness, and reliable fixed-point…

Classical convergence theory of Runge-Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic…

We apply Runge-Kutta methods to linear partial differential-algebraic equations of the form $Au_t(t,x) + B(u_{xx}(t,x)+ru_x(t,x))+Cu(t,x) = f(t,x)$, where $A,B,C\in\R^{n,n}$ and the matrix $A$ is singular. We prove that under certain…

With this short note, we close a gap in the linear stability theory of block predictor-corrector Runge-Kutta schemes originally proposed for the parallel solution of ODEs.

In [Baeza et al., Computers and Fluids, 159, 156--166 (2017)] a new method for the numerical solution of ODEs is presented. This methods can be regarded as an approximate formulation of the Taylor methods and it follows an approach that has…

In this paper, we perform stability analysis for a class of second and third order accurate strong-stability-preserving modified Patankar Runge-Kutta (SSPMPRK) schemes, which were introduced in [4,5] and can be used to solve convection…

The problem of solving stochastic differential-algebraic equations (SDAEs) of index one with a scalar driving Brownian motion is considered. Recently, the authors proposed a class of stiffly accurate stochastic Runge-Kutta (SRK) methods…

This paper introduces a novel paradigm for constructing linearly implicit and high-order unconditionally energy-stable schemes for general gradient flows, utilizing the scalar auxiliary variable (SAV) approach and the additive Runge-Kutta…

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…

Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were proposed and analyzed in 4. These specially designed methods use reduced precision for the implicit computations and full…

In this paper, we present a framework to construct general stochastic Runge-Kutta Lawson schemes. We prove that the schemes inherit the consistency and convergence properties of the underlying Runge-Kutta scheme, and confirm this in some…

We propose a better method to determine the stability region of an L-stable implicit-explicit Runge-Kutta scheme. This method always provides the correct result, while other methods sometimes give wrong result. It is useful in the analysis…