2022Journal of Computational and Applied MathematicsOpen access

Isomeric trees and the order of Runge–Kutta methods

J. C. Butcher, Helmut Podhaisky

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Runge–Kutta methods, Scalar (mathematics), Order (exchange), Mathematics, Applied mathematics, Mathematical analysis, Differential equation, Geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
Isomeric trees and the order of Runge–Kutta methods — Research Paper | ScholarLens