Abstract
The construction of two-step Runge-Kutta methods of order p and stage order q=p with stability polynomial given in advance is described. This polynomial is chosen to have a large interval of absolute stability for explicit methods and to be A-stable and L-stable for implicit methods. After satisfying the order and stage order conditions the remaining free parameters are computed by minimizing the sum of squares of the difference between the stability function of the method and a given polynomial at a sufficiently large number of points in the complex plane.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Albrecht, A new theoretical approach to Runge-Kutta methods, SIAM J. Numer. Anal. 24 (1987) 391-406.
P. Albrecht, The Runge-Kutta theory in a nutshell, SIAM J. Numer. Anal. 33 (1996) 1712-1735.
K. Burrage, Order properties of implicit multivalue methods for ordinary differential equations, IMA J. Numer. Anal. 8 (1988) 43-69.
K. Burrage and P. Moss, Simplifying assumptions for the order of partitioned multivalue methods, BIT 20 (1980) 452-465.
J.C. Butcher, The Numerical Analysis of Ordinary Differential Equations. Runge-Kutta and General Linear Methods (Wiley, Chichester/New York, 1987).
J.C. Butcher, Diagonally-implicit multi-stage integration methods, Appl. Numer. Math. 11 (1993) 347-363.
J.C. Butcher and Z. Jackiewicz, Implementation of diagonally implicit multistage integration methods for ordinary differential equations, SIAM J. Numer. Anal. 34 (1997) 2119-2141.
J.C. Butcher, Z. Jackiewicz and H.D. Mittelmann, A nonlinear optimization approach to the construction of general linear methods of high order, J. Comput. Appl. Math. 81 (1997) 181-196.
J.C. Butcher and S. Tracogna, Order conditions for two-step Runge-Kutta methods, Appl. Numer. Math. 24 (1997) 351-364.
R. Caira, C. Costabile and F. Costabile, A class of pseudo Runge-Kutta methods, BIT 30 (1990) 642-649.
J.E. Dennis and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
DONLP2, A SQP method for nonlinear constrained minimization by P. Spellucci, source code (f77) of latest version (1996) available at ftp: //plato.la.asu.edu/pub.
E. Hairer, S.P. Nørsett and G. Wanner, Solving Ordinary Differential Equations I. Nonstiff Problems (Springer, Berlin, 1993).
E. Hairer and G. Wanner, Order conditions for general two-step Runge-Kutta methods, SIAM J. Numer. Anal. 34 (1997) 2087-2089.
N.J. Higham, Accuracy and Stability of Numerical Algorithms (SIAM, Philadelphia, PA, 1996).
Z. Jackiewicz and S. Tracogna, A representation formula for two-step Runge-Kutta methods, in: Proc. of the 2nd Hellenic European Conf. on Mathematics and Informatics, ed. E.A. Lipitakis (September 22-24, 1994) (Hellenic Mathematical Society, Hellas, 1994) pp. 111-120.
Z. Jackiewicz and S. Tracogna, A general class of two-step Runge-Kutta methods for ordinary differential equations, SIAM J. Numer. Anal. 32 (1995) 1390-1427.
Z. Jackiewicz and S. Tracogna, Variable stepsize continuous two-step Runge-Kutta methods for ordinary differential equations, Numer. Algorithms 12 (1996) 347-368.
Z. Jackiewicz and R. Vermiglio, General linear methods with external stages of different orders, BIT 36 (1996) 688-712.
J.D. Lambert, Computational Methods in Ordinary Differential Equations (Wiley, Chichester/New York, 1973).
R. Skeel, Analysis of fixed stepsize methods, SIAM J. Numer. Anal. 13 (1976) 664-685.
S. Tracogna, Implementation of two-step Runge-Kutta methods for ordinary differential equations, J. Comput. Appl. Math. 76 (1997) 113-136.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bartoszewski, Z., Jackiewicz, Z. Construction of two-step Runge-Kutta methods of high order for ordinary differential equations. Numerical Algorithms 18, 51–70 (1998). https://doi.org/10.1023/A:1019157029031
Issue Date:
DOI: https://doi.org/10.1023/A:1019157029031