Related papers: Runge-Kutta methods, trees, and Mathematica
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…
We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive…
We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference. The learning algorithm is provided with a term rewriting system that specifies properties of the target tree language…
The work deals with two major topics concerning the numerical analysis of Runge-Kutta-like (RK-like) methods, namely their stability and order of convergence. RK-like methods differ from additive RK methods in that their coefficients are…
An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of…
The Butcher group is a powerful tool to analyse integration methods for ordinary differential equations, in particular Runge--Kutta methods. Recently, a natural Lie group structure has been constructed for this group. Unfortunately, the…
We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…
Finite element methods provide accurate and efficient methods for the numerical solution of partial differential equations by means of restricting variational problems to finite-dimensional approximating spaces. However, they do not…
Applied to the master equation, the usual numerical integration methods, such as Runge-Kutta, become inefficient when the rates associated with various transitions differ by several orders of magnitude. We introduce an integration scheme…
This paper considers the numerical integration of semilinear evolution PDEs using the high order linearly implicit methods developped in a previous paper in the ODE setting. These methods use a collocation Runge--Kutta method as a basis,…
We analyze a family of Runge-Kutta based quadrature algorithms for the approximation of the gramians of linear time invariant dynamical systems. The approximated gramians are used to obtain an approximate balancing transformation similar to…
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…
In this paper we discuss the use of implicit Runge-Kutta schemes for the time discretization of optimal control problems with evolution equations. The specialty of the considered discretizations is that the discretizations schemes for the…
Recently, an approach known as relaxation has been developed for preserving the correct evolution of a functional in the numerical solution of initial-value problems, using Runge-Kutta methods. We generalize this approach to multistep…
Using a recent characterization of energy-preserving B-series, we derive the explicit conditions on the coefficients of a Runge-Kutta method that ensure energy preservation (for Hamiltonian systems) up to a given order in the step size,…
We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…
This work constructs a new class of multirate schemes based on the recently developed generalized additive Runge-Kutta (GARK) methods (Sandu and Guenther, 2013). Multirate schemes use different step sizes for different components and for…
A new format for commutator-free Lie group methods is proposed based on explicit classical Runge-Kutta schemes. In this format exponentials are reused at every stage and the storage is required only for two quantities: the right hand side…
A novel class of high-order linearly implicit energy-preserving integrating factor Runge-Kutta methods are proposed for the nonlinear Schr\"odinger equation. Based on the idea of the scalar auxiliary variable approach, the original equation…
One can elucidate integrability properties of ordinary differential equations (ODEs) by knowing the existence of second integrals (also known as weak integrals or Darboux polynomials for polynomial ODEs). However, little is known about how…