Related papers: Stage-Parallel Implicit Runge--Kutta methods via l…
The ability to accurately approximate trajectories of dynamical systems enables their analysis, prediction, and control. Neural network (NN)-based approximations have attracted significant interest due to fast evaluation with good accuracy…
Deriving analytical solutions of ordinary differential equations is usually restricted to a small subset of problems and numerical techniques are considered. Inevitably, a numerical simulation of a differential equation will then always be…
Many time-dependent partial differential equations (PDEs) can be transformed into an ordinary differential equations (ODEs) containing moderately stiff and non-stiff terms after spatial semi-discretization. In the present paper, we…
Runge-Kutta methods have an irreplaceable position among numerical methods designed to solve ordinary differential equations. Especially, implicit ones are suitable for approximating solutions of stiff initial value problems. We propose a…
Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were proposed and analyzed in [8]. These specially designed methods use reduced precision or the implicit computations and full…
The Runge--Kutta (RK) discontinuous Galerkin (DG) method is a mainstream numerical algorithm for solving hyperbolic equations. In this paper, we use the linear advection equation in one and two dimensions as a model problem to prove the…
This work generalizes the additively partitioned Runge-Kutta methods by allowing for different stage values as arguments of different components of the right hand side. An order conditions theory is developed for the new family of…
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…
Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art. Like most numerical methods, they return point estimates. We construct a family of probabilistic…
In this paper, we study the uniform accuracy of implicit-explicit (IMEX) Runge-Kutta (RK) schemes for general linear hyperbolic relaxation systems satisfying the structural stability condition proposed in \cite{yong_singular_1999}. We…
An additive Runge-Kutta method is used for the time stepping, which integrates the linear stiff terms by an explicit singly diagonally implicit Runge-Kutta (ESDIRK) method and the nonlinear terms by an explicit Runge-Kutta (ERK) method. In…
This paper investigates, a new class of fractional order Runge-Kutta (FORK) methods for numerical approximation to the solution of fractional differential equations (FDEs). By using the Caputo generalizedTaylor formula and the total…
Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve efficiently large systems of differential equations that have a stiff linear part, e.g. reaction-diffusion systems. However, the use of approximate…
This work introduces a new class of Runge-Kutta methods for solving nonlinearly partitioned initial value problems. These new methods, named nonlinearly partitioned Runge-Kutta (NPRK), generalize existing additive and component-partitioned…
This work deals with two groups of spectral analysis results for matrices arising in fully implicit Runge-Kutta methods used for linear time-dependent partial differential equations. These were applied for different formulations of the same…
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…
We develop continuous-stage Runge-Kutta methods based on weighted orthogonal polynomials in this paper. There are two main highlighted merits for developing such methods: Firstly, we do not need to study the tedious solution of…
In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with…
Fully implicit timestepping methods have several potential advantages for atmosphere/ocean simulation. First, being unconditionally stable, they degrade more gracefully as the Courant number increases, typically requiring more solver…
The aim of this paper is to construct and analyze explicit exponential Runge-Kutta methods for the temporal discretization of linear and semilinear integro-differential equations. By expanding the errors of the numerical method in terms of…