Abstract
The representation of order conditions for general linear methods formulated using an algebraic theory by Butcher, and the alternative using B-series by Hairer and Wanner for treating vector initial value problems in ordinary differential equations are well-known. Each relies on a recursion over rooted trees; yet tractable forms—for example, those which may be solved to yield particular methods—often are obtained only after extensive computation. In contrast, for Runge–Kutta methods, tractable forms have been used by various authors for obtaining methods. Here, the corresponding recursion formula for two-step Runge–Kutta methods is revised to yield tractable forms which may be exploited to derive such methods and to motivate the selection of efficient algorithms in an obvious way. The new recursion formula is utilized in a MAPLE code.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albrecht, P.: The Runge–Kutta theory in a nutshell. SIAM J. Numer. Anal. 33, 1712–1735 (1996)
Butcher, J.C.: An algebraic theory of integration methods. Math. Comp. 26, 79–106 (1972)
Butcher, J.C.: The numerical analysis of ordinary differential equations. A Wiley-Interscience Publication. John Wiley & Sons Ltd., Chichester (1987). Runge–Kutta and general linear methods
Butcher, J.C.: Numerical Methods for Ordinary Differential Equations, 2nd edn. Wiley, Chichester (2008). doi:10.1002/9780470753767
Butcher, J.C., Tracogna, S.: Order conditions for two-step Runge–Kutta methods. Appl. Numer. Math. 24(2–3), 351–364 (1997). doi:10.1016/S0168-9274(97)00032-9. Volterra centennial (Tempe, AZ, 1996)
Chan, T.M.H., Chan, R.P.K.: A simplified approach to the order conditions ofintegration methods. Computing 77(3), 237–252 (2006). doi:10.1007/s00607-005-0151-1
Cooper, G.J., Verner, J.H.: Some explicit Runge–Kutta methods of high order. SIAM J. Numer. Anal. 9, 389–405 (1972)
Hairer, E., Lubich, C., Wanner, G.: Geometric numerical integration. Springer Series in Computational Mathematics, vol. 31, 2nd edn. Springer, Berlin (2006). Structure-preserving algorithms for ordinary differential equations
Hairer, E., Wanner, G.: On the Butcher group and general multi-value methods. Computing (Arch. Elektron. Rechnen) 13(1), 1–15 (1974)
Hairer, E., Wanner, G.: Order conditions for general two-step Runge–Kutta methods. SIAM J. Numer. Anal. 34(6), 2087–2089 (1997). doi:10.1137/S0036142996298144
Jackiewicz, Z., Tracogna, S.: A general class of two-step Runge–Kutta methods for ordinary differential equations. SIAM J. Numer. Anal. 32(5), 1390–1427 (1995). doi:10.1137/0732064
Tracogna, S., Welfert, B.: Two-step Runge–Kutta: theory and practice. BIT 40(4), 775–799 (2000)
Jackiewicz, Z., Verner, J.H.: Derivation and implementation of two-step Runge–Kutta pairs. Jpn. J. Ind. Appl. Math. 19(2), 227–248 (2002)
Verner, J.H.: Improved starting methods for two-step Runge–Kutta methods of stage-order p − 3. Appl. Numer. Math. 56(3–4), 388–396 (2006). doi:10.1016/j.apnum.2005.04.028
Verner, J.H.: Starting methods for two-step Runge–Kutta methods of stage-order 3 and order 6. J. Comput. Appl. Math. 185(2), 292–307 (2006). doi:10.1016/j.cam.2005.03.012
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kværnø, A., Verner, J.H. Subquadrature expansions for TSRK methods. Numer Algor 59, 487–504 (2012). https://doi.org/10.1007/s11075-011-9500-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-011-9500-7