An algebraic theory of integration methods

Author:
J. C. Butcher

Journal:
Math. Comp. **26** (1972), 79-106

MSC:
Primary 65L99

DOI:
https://doi.org/10.1090/S0025-5718-1972-0305608-0

MathSciNet review:
0305608

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A class of integration methods which includes Runge-Kutta methods, as well as the Picard successive approximation method, is shown to be related to a certain group which can be represented as the family of real-valued functions on the set of rooted trees. For each integration method, a group element is defined corresponding to it and it is shown that the numerical result obtained using the method is characterised by this group element. If two methods are given, then a new method may be defined in such a way that when it is applied to a given initial-value problem the result is the same as for the successive application of the given methods. It is shown that the group element for this new method is the product of the group elements corresponding to the given methods. Various properties of the group and certain of its subgroups are examined. The concept of order is defined as a relationship between group elements.

**[1]**J. C. Butcher, ``Coefficients for the study of Runge-Kutta integration processes,''*J. Austral. Math. Soc.*, v. 3, 1963, pp. 185-201. MR**27**#2109. MR**0152129 (27:2109)****[2]**J. C. Butcher, ``On the attainable order of Runge-Kutta methods,''*Math. Comp.*, v. 19, 1965, pp. 408-417. MR**31**#4180. MR**0179943 (31:4180)**

Retrieve articles in *Mathematics of Computation*
with MSC:
65L99

Retrieve articles in all journals with MSC: 65L99

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1972-0305608-0

Keywords:
Runge-Kutta methods,
initial-value problems,
Picard method,
order of methods,
group,
graph,
rooted tree

Article copyright:
© Copyright 1972
American Mathematical Society