Related papers: Runge-Kutta methods, trees, and Mathematica
A space-time fully adaptive multiresolution method for evolutionary non-linear partial differential equations is presented introducing an improved local time-stepping method. The space discretisation is based on classical finite volumes,…
The recursion tree resulting from Karatsuba's formula is built here by using an interleaved splitting scheme rather than the traditional left/right one. This allows an easier access to the nodes of the tree and $2n-1$ of them are initially…
Exponential Runge--Kutta methods have shown to be competitive for the time integration of stiff semilinear parabolic PDEs. The current construction of stiffly accurate exponential Runge--Kutta methods, however, relies on a convergence…
In this note we discuss the construction of high order asymptotic preserving numerical schemes for the Boltzmann equation. The methods are based on the use of Implicit-Explicit (IMEX) Runge-Kutta methods combined with a penalization…
An error analysis of Runge-Kutta convolution quadrature based on Gauss methods applied to hyperbolic operators is given. The order of convergence relies heavily on the parity of the number of stages, a more favourable situation arising for…
Multirate integration is an increasingly relevant tool that enables scientists to simulate multiphysics systems. Existing multirate methods are designed for equations whose fast and slow variables can be linearly separated using additive or…
Irksome is a library based on the Unified Form Language (UFL) that enables automated generation of Runge--Kutta methods for time-stepping finite element spatial discretizations of partial differential equations (PDE). Allowing users to…
In this survey, we provide an in-depth investigation of exponential Runge-Kutta methods for the numerical integration of initial-value problems. These methods offer a valuable synthesis between classical Runge-Kutta methods, introduced more…
The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique…
Machine learning on trees has been mostly focused on trees as input to algorithms. Much less research has investigated trees as output, which has many applications, such as molecule optimization for drug discovery, or hint generation for…
A novel class of explicit high-order energy-preserving methods are proposed for general Hamiltonian partial differential equations with non-canonical structure matrix. When the energy is not quadratic, it is firstly done that the original…
We deal with optimal approximation of solutions of ODEs under local Lipschitz condition and inexact discrete information about the right-hand side functions. We show that the randomized two-stage Runge-Kutta scheme is the optimal method…
The purpose of the article is to derive equations that determine the trajectory of a non-conservative natural system in configuration space in non-stationary external fields. A theorem on the change in the kinetic energy of the system is…
We look at two classical examples in the theory of numerical analysis, namely the Runge example for interpolation and Wilkinson's example (actually two examples) for rootfinding. We use the modern theory of backward error analysis and…
In \cite{BDM2003} the modified Patankar-Euler and modified Patankar-Runge-Kutta schemes were introduced to solve positive and conservative systems of ordinary differential equations. These modifications of the forward Euler scheme and…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
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…
We study the application of the generalized convolution quadrature (gCQ) based on Runge--Kutta methods to approximate the solution of an important class of sectorial problems. The gCQ generalizes Lubich's original convolution quadrature…
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…