Related papers: Runge-Kutta methods for rough differential equatio…
In this paper, we apply rough paths techniques to provide an approximation of the solution of stochastic functional differential equations driven by fractional Brownian motion with Hurst parameter $H>1/2$. Here, the involved stochastic…
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…
An explicit stabilized additive Runge-Kutta scheme is proposed. The method is based on a splitting of the problem in severely stiff and mildly stiff subproblems, which are then independently solved using a Runge-Kutta-Chebyshev scheme. The…
Fully implicit Runge-Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the…
A linear evolving surface partial differential equation is first discretized in space by an arbitrary Lagrangian Eulerian (ALE) evolving surface finite element method, and then in time either by a Runge-Kutta method, or by a backward…
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…
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…
Runge-Kutta (RK) methods may exhibit order reduction when applied to stiff problems. For linear problems with time-independent operators, order reduction can be avoided if the method satisfies certain weak stage order (WSO) conditions,…
In this work we present a new class of Runge-Kutta (RK) methods for solving systems of hyperbolic equations with a particular structure, generalization of a wave-equation. The new methods are {\it partially implicit} in the sense that a…
Direct shooting is an efficient method to solve numerical optimal control. It utilizes the Runge-Kutta scheme to discretize a continuous-time optimal control problem making the problem solvable by nonlinear programming solvers. However,…
In this article, we study a numerical scheme for stochastic differential equations driven by fractional Brownian motion with Hurst parameter H in (1/4; 1/2). Towards this end, we apply Doss-Sussmann representation of the solution and an…
The existing discrete variational derivative method is only second-order accurate and fully implicit. In this paper, we propose a framework to construct an arbitrary high-order implicit (original) energy stable scheme and a second-order…
The application of Runge-Kutta schemes designed to enjoy a large region of absolute stability can significantly increase the efficiency of numerical methods for PDEs based on a method of lines approach. In this work we investigate the…
As a general rule, differential equations driven by a multi-dimensional irregular path $\Gamma$ are solved by constructing a rough path over $\Gamma$. The domain of definition ? and also estimates ? of the solutions depend on upper bounds…
In this work, we present approaches to rigorously certify $A$- and $A(\alpha)$-stability in Runge-Kutta methods through the solution of convex feasibility problems defined by linear matrix inequalities. We adopt two approaches. The first is…
In this work modified Patankar-Runge-Kutta (MPRK) schemes up to order four are considered and equipped with a dense output formula of appropriate accuracy. Since these time integrators are conservative and positivity preserving for any time…
In this article, we discuss the numerical solution of Boolean polynomial programs by algorithms borrowing from numerical methods for differential equations, namely the Houbolt scheme, the Lie scheme, and a Runge-Kutta scheme. We first…
In order to solve continuous-time optimal control problems, direct methods transcribe the infinite-dimensional problem to a nonlinear program (NLP) using numerical integration methods. In cases where the integration error can be manipulated…
In this paper, we study two variations of the time discrete Taylor schemes for rough differential equations and for stochastic differential equations driven by fractional Brownian motions. One is the incomplete Taylor scheme which excludes…
Neural networks have proven to be efficient surrogate models for tackling partial differential equations (PDEs). However, their applicability is often confined to specific PDEs under certain constraints, in contrast to classical PDE solvers…