Related papers: Local Linearization-Runge Kutta Methods: a class o…
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…
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…
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…
This paper is devoted to examining the stability of Runge-Kutta methods for solving nonlinear Volterra delay-integro-differential-algebraic equations (DIDAEs) with constant delay. Hybrid numerical schemes combining Runge-Kutta methods and…
Explicit stabilized methods are an efficient alternative to implicit schemes for the time integration of stiff systems of differential equations in large dimension. In this paper, we derive explicit stabilized integrators of orders one and…
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…
Explicit Runge-Kutta schemes with large stable step sizes are developed for integration of high order spectral difference spatial discretization on quadrilateral grids. The new schemes permit an effective time step that is substantially…
Differential equations arise in mathematics, physics,medicine, pharmacology, communications, image processing and animation, etc. An Ordinary Differential Equation (ODE) is a differential equation if it involves derivatives with respect to…
We note a fact that stiff systems or differential equations that have highly oscillatory solutions cannot be solved efficiently using conventional methods. In this paper, we study two new classes of exponential Runge-Kutta (ERK) integrators…
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…
We study the learning of numerical algorithms for scientific computing, which combines mathematically driven, handcrafted design of general algorithm structure with a data-driven adaptation to specific classes of tasks. This represents a…
In this paper we consider an approach to improve the performance of exponential Runge--Kutta integrators and Lawson schemes} in cases where the solution of a related, but usually much simpler, problem can be computed efficiently. While for…
We study Runge-Kutta methods for rough differential equations which can be used to calculate solutions to stochastic differential equations driven by processes that are rougher than a Brownian motion. We use a Taylor series representation…
This paper investigates the performance of a subclass of exponential integrators, specifically explicit exponential Runge--Kutta methods. It is well known that third-order methods can suffer from order reduction when applied to linearized…
In this work, we introduce high-order Basis-Update & Galerkin (BUG) integrators based on explicit Runge-Kutta methods for large-scale matrix differential equations. These dynamical low-rank integrators extend the BUG integrator to arbitrary…
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…
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…
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…
Implicit Runge--Kutta (IRK) methods are highly effective for solving stiff ordinary differential equations (ODEs) but can be computationally expensive for large-scale problems due to the need of solving coupled algebraic equations at each…
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…