Isomeric trees and the order of Runge–Kutta methods
J. C. Butcher, Helmut Podhaisky
Abstract
Open-access reader
J. C. Butcher, Helmut Podhaisky
Abstract
Open-access reader
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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