Related papers: Multi-Order Runge-Kutta Methods or how to numerica…

Runge--Kutta (RK) methods are widely used techniques for solving a class of initial value problems. In this article, we introduce an adaptive multiquadratic (MQ) radial basis function (RBF)-based method to develop enhanced explicit RK…

It is well known that Lawson methods suffer from a severe order reduction when integrating initial boundary value problems where the solutions are not periodic in space or do not satisfy enough conditions of annihilation on the boundary.…

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…

We present an approach for the efficient implementation of self-adjusting multi-rate Runge-Kutta methods and we introduce a novel stability analysis, that covers the multi-rate extensions of all standard Runge-Kutta methods and allows to…

We are studying Runge-Kutta methods along complex paths of integration from a geometric point of view. Thereby we derive special complex time grids, which applied to the problem of integrating a linear autonomous system of ordinary…

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…

We consider the efficient numerical solution of coupled dynamical systems, consisting of a small nonlinear part and a large linear time invariant part, possibly stemming from spatial discretization of an underlying partial differential…

This paper studies the spatial manifestations of order reduction that occur when time-stepping initial-boundary-value problems (IBVPs) with high-order Runge-Kutta methods. For such IBVPs, geometric structures arise that do not have an…

We compare the three main types of high-order one-step initial value solvers: extrapolation, spectral deferred correction, and embedded Runge--Kutta pairs. We consider orders four through twelve, including both serial and parallel…

This article extends the theory of dual-consistent summation-by-parts (SBP) and generalized SBP (GSBP) time-marching methods by showing that they are implicit Runge-Kutta schemes. Through this connection, the accuracy theory for the…

A methodology that can generate the optimal coefficients of a numerical method with the use of an artificial neural network is presented in this work. The network can be designed to produce a finite difference algorithm that solves a…

Isospectral Runge-Kutta methods are well-suited for the numerical solution of isospectral systems such as the rigid body and the Toda lattice. More recently, these integrators have been applied to geophysical fluid models, where their…

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…

The design of numerical integrators for solving stochastic dynamics with high weak order relies on tedious calculations and is subject to a high number of order conditions. The original approaches from the literature consider strong…

Optimal Strong Stability Preserving (SSP) Runge--Kutta methods has been widely investegated in the last decade and many open conjectures have been formulated. The iterated implicit midpoint rule has been observed numerically optimal in…

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, a recently published method [Hussain, Ismail, Senua, Solving directly special fourth-order ordinary differential equations using Runge-Kutta type method, J. Comput. Appl. Math. 306 (2016) 179-199] for solving fourth-order…

We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These…

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…

Perturbed Runge--Kutta methods (also referred to as downwind Runge--Kutta methods) can guarantee monotonicity preservation under larger step sizes relative to their traditional Runge--Kutta counterparts. In this paper we study, the question…