Article ID: | iaor20032013 |
Country: | Netherlands |
Volume: | 42 |
Issue: | 3 |
Start Page Number: | 477 |
End Page Number: | 489 |
Publication Date: | Sep 2002 |
Journal: | BIT |
Authors: | Butcher J.C., Chan T.M.H. |
The analysis of compositions of Runge–Kutta methods involves manipulations of functions defined on rooted trees. Existing formulations due to Butcher, Hairer and Wanner, and Murua and Sanz-Serna, while equivalent, differ in details. The subject of the present paper is a new recursive formulation of the composition rules. This both simplifies and extends the existing approaches. Instead of using the order conditions based on trees, we propose the construction of the order conditions using a suitably chosen basis on the tree space. In particular, the linear structure of the tree space gives a representation of the