Answers are grounded in this paper and cite their sources.
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. Introduction.In the study of Runge-Kutta methods for the integration of ordinary differential equations, a complicated set of algebraic conditions arises which must be satisfied for a method to have some specified order.These algebraic conditions can be written as a set of equations in which the left-hand sides are certain polynomials in the coefficients of the method and the right-hand sides are certain rational numbers.Discussions of the properties of general Runge-Kutta methods and the derivation of particular methods can typically be formulated in such a way that the properties of these polynomial equations come under close scrutiny.In the author's papers on this subject, a combinatorial interpretation of the equations has been used.That is, use has been made of the relationship between the graphs known as arborescences (or rooted trees) and the forms of the various equations.In this paper, the same point of view is taken and it is shown that, in a certain sense, a given method is characterised by a real-valued function on the set of rooted trees (the word "trees" will be used as an abbreviation for "rooted trees" for the rest of this paper).In fact, the images of the various trees describe the method in much the same way as moments describe a measure in integration theory.For the purposes of this paper, it is convenient to generalise considerably the concept of a Runge-Kutta method.Not only will it not be assumed that the method is explicit but it will not be assumed that the number of stages in the method is finite.One consequence of this is that the theoretical solution to a differential equation itself may be thought of as being produced by a particular method (the Picard method).Also, it becomes possible to study the properties of the various methods in terms of a certain group that arises naturally.To say a given method is of order n, for example, will be equivalent to saying that the method and the Picard method have group elements in the same cosets with respect to a certain normal subgroup.
No takes yet. Share an insight, caveat, or question.
J. C. Butcher (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: