Isomeric trees and the order of Runge–Kutta methods

12/02/2021
by   John C. Butcher, et al.
0

The conditions for a Runge–Kutta method to be of order p with p≥ 5 for a scalar non-autonomous problem are a proper subset of the order conditions for a vector problem. Nevertheless, Runge–Kutta methods that were derived historically only for scalar problems happened to be of the same order for vector problems. We relate the order conditions for scalar problems to factorisations of the Runge–Kutta trees into "atomic stumps" and enumerate those conditions up to p=20. Using a special search procedure over unsatisfied order conditions, new Runge–Kutta methods of "ambiguous orders" five and six are constructed. These are used to verify the validity of the results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2022

Algebraic Structure of the Weak Stage Order Conditions for Runge-Kutta Methods

Runge-Kutta (RK) methods may exhibit order reduction when applied to sti...
research
08/10/2021

Scalar actions in Lean's mathlib

Scalar actions are ubiquitous in mathematics, and therefore it is valuab...
research
10/10/2022

Hierarchical Learning in Euclidean Neural Networks

Equivariant machine learning methods have shown wide success at 3D learn...
research
05/12/2022

Multigrid methods for 3D H(𝐜𝐮𝐫𝐥) problems with nonoverlapping domain decomposition smoothers

We propose V–cycle multigrid methods for vector field problems arising f...
research
04/10/2019

On the Scalar-Help-Vector Source Coding Problem

In this paper, we consider a scalar-help-vector problem for L+1 correlat...
research
11/08/2020

Quadratization of ODEs: Monomial vs. Non-Monomial

Quadratization is a transform of a system of ODEs with polynomial right-...
research
01/16/2020

Compactly Supported Quasi-tight Multiframelets with High Balancing Orders and Compact Framelet Transforms

Framelets (a.k.a. wavelet frames) are of interest in both theory and app...

Please sign up or login with your details

Forgot password? Click here to reset