Related papers: Dynamic Computation of Runge Kutta Fourth Order Al…
The idea of neural Ordinary Differential Equations (ODE) is to approximate the derivative of a function (data model) instead of the function itself. In residual networks, instead of having a discrete sequence of hidden layers, the…
Numerical ordinary differential equation (ODE) solvers are indispensable tools in various engineering domains, enabling the simulation and analysis of dynamic systems. In this work, we utilize 5 different numerical ODE solvers namely:…
Runge-Kutta formulas are some of the workhorses of numerical solving of differential equations. However, they are extremely difficult to generate; the algebra involved can be very complicated indeed. It is now standard, following the work…
Many important differential equations model quantities whose value must remain positive or stay in some bounded interval. These bounds may not be preserved when the model is solved numerically. We propose to ensure positivity or other…
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…
We consider parameter estimation of ordinary differential equation (ODE) models from noisy observations. For this problem, one conventional approach is to fit numerical solutions (e.g., Euler, Runge--Kutta) of ODEs to data. However, such a…
A fourth-order exponential time differencing (ETD) Runge-Kutta scheme with dimensional splitting is developed to solve multidimensional non-linear systems of reaction-diffusion equations (RDE). By approximating the matrix exponential in the…
This study computes the gradient of a function of numerical solutions of ordinary differential equations (ODEs) with respect to the initial condition. The adjoint method computes the gradient approximately by solving the corresponding…
Fractional Differential Equations (FDEs) are essential tools for modelling complex systems in science and engineering. They extend the traditional concepts of differentiation and integration to non-integer orders, enabling a more precise…
A practical and new Runge--Kutta numerical scheme for stochastic differential equations is explored. Numerical examples demonstrate the strong convergence of the method. The first order strong convergence is then proved using Ito integrals…
A C++ library for sensitivity analysis of optimisation problems involving ordinary differential equations (ODEs) enabled by automatic differentiation (AD) and SIMD (Single Instruction, Multiple data) vectorization is presented. The discrete…
Several widely-used first-order saddle-point optimization methods yield an identical continuous-time ordinary differential equation (ODE) that is identical to that of the Gradient Descent Ascent (GDA) method when derived naively. However,…
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…
In a previous paper, a technique was suggested to avoid order reduction with any explicit exponential Runge-Kutta method when integrating initial boundary value nonlinear problems with time-dependent boundary conditions. In this paper, we…
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…
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…
The Obreshkov method is a single-step multi-derivative method used in the numerical solution of differential equations and has been used in recent years in efficient circuit simulation. It has been shown that it can be made of arbitrary…
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 4-th order Runge-Kutta method in the complex plane is proposed for numerically advancing the solutions of a system of first order differential equations in one external invariant satisfied by the master integrals related to a Feynman…
We consider a linear inhomogeneous fractional evolution equation which is obtained from a Cauchy problem by replacing its first-order time derivative with Caputo's fractional derivative. The operator in the fractional evolution equation is…