Related papers: Issues in the software implementation of stochasti…

This paper introduces a novel framework for the solution of (large-scale) Lyapunov and Sylvester equations derived from numerical integration methods. Suitable systems of ordinary differential equations are introduced. Low-rank…

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 paper we present a general procedure for designing higher strong order methods for It\^o stochastic differential equations on matrix Lie groups and illustrate this strategy with two novel schemes that have a strong convergence order…

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…

Cell collective migration plays a crucial role in a variety of physiological processes. In this work, we propose the Runge-Kutta random feature method to solve the nonlinear and strongly coupled multiphase flow problems of cells, in which…

The recently-introduced relaxation approach for Runge-Kutta methods can be used to enforce conservation of energy in the integration of Hamiltonian systems. We study the behavior of implicit and explicit relaxation Runge-Kutta methods in…

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…

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…

The aim of this paper is to construct and analyze exponential Runge-Kutta methods for the temporal discretization of a class of semilinear parabolic problems with arbitrary state-dependent delay. First, the well-posedness of the problem is…

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 propose a numerical scheme for partitioned systems of index 2 DAEs, such as those arising from nonholonomic mechanical problems and prove the order of a certain class of Runge-Kutta methods we call of Lobatto-type. The…

This work proposes and analyzes a new class of numerical integrators for computing low-rank approximations to solutions of matrix differential equation. We combine an explicit Runge-Kutta method with repeated randomized low-rank…

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…

Gamma distributed delay differential equations (DDEs) arise naturally in many modelling applications. However, appropriate numerical methods for generic Gamma distributed DDEs are not currently available. Accordingly, modellers often resort…

Space discretization of some time-dependent partial differential equations gives rise to systems of ordinary differential equations in additive form whose terms have different stiffness properties. In these cases, implicit methods should be…

We propose a new probabilistic scheme which combines deep learning techniques with high order schemes for backward stochastic differential equations belonging to the class of Runge-Kutta methods to solve high-dimensional semi-linear…

We propose an implementation of symplectic implicit Runge-Kutta schemes for highly accurate numerical integration of non-stiff Hamiltonian systems based on fixed point iteration. Provided that the computations are done in a given floating…

Based on the combinatory theory of rooted colored trees, we investigate the conditions for the explicit stochastic Runge-Kutta (SRK) methods to preserve quadratic invariants (QI) up to certain orders of accuracy. These conditions can supply…

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…

We present a C++ implementation of a fifth order semi-implicit Runge-Kutta algorithm for solving Ordinary Differential Equations. This algorithm can be used for studying many different problems and in particular it can be applied for…