skip to main content
article
Free Access

Highly continuous Runge-Kutta interpolants

Published:01 September 1991Publication History
Skip Abstract Section

Abstract

To augment the discrete Runge-Kutta solutlon to the mitlal value problem, piecewlse Hermite interpolants have been used to provide a continuous approximation with a continuous first derivative We show that it M possible to construct mterpolants with arbltrardy many continuous derivatives which have the same asymptotic accuracy and basic cost as the Hermite interpol ants. We also show that the usual truncation coefficient analysis can be applied to these new interpolants, allowing their accuracy to be examined in more detad As an Illustration, we present some globally C2 interpolants for use with a popular 4th and 5th order Runge-Kutta pair of Dormand and Prince, and we compare them theoretically and numerically with existing interpolants.

References

  1. 1 DAVIS, P.J. Interpolation and Approximation. Dover Publications, New York, 1975.Google ScholarGoogle Scholar
  2. 2 DORMAND, J. R., AND I~INCE, P. J. A family of embedded Runge-Kutta fi)rmulae. J. Comput. Appl. Math. 6 (1980), 19-26.Google ScholarGoogle ScholarCross RefCross Ref
  3. 3 ENmGHT, W. H. A new error-control for initial value solvers. Appl. Math. Comput. 31 (1989), 288-301.Google ScholarGoogle Scholar
  4. 4 ENRIOHT, W.H. Analysis of error control strategies for continuous Runge-Kutta methods. SIAM J. Numer. Anal. 26 (1989), 588-599. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 ENmGHT, W. H., JACKSON, K. R., NORSETT, S. P., AND THOMSEN, P. G. Interpolants for Runge-Kutta formulas. ACM Trans. Math. Sofiw. 12 (1986), 193-218. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 ENRIGHT, W. H., JACKSON, K. R., NORSETT, S. P., AND THOMSEN, P.G. Effective solution of discontinuous IVPs using a Runge-Kutta formula pair with interpolants. Appl. Math. Comput. 27 (1988), 313-335. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 ENRIGHT, W. H., AND PRYCE, J. D. Two FORTRAN packages for assessing initial value methods. ACM Trans. Math. Sofiw. 13 (1987), 1-27. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 GLADWELL, I., SHAMPINE, L. F., BACA, L. S., AND BRANKIN, R. W. Practical aspects of interpolation in Runge-Kutta ,:odes. Numerical Analysis Rep. 102, Univ. of Manchester, (1985).Google ScholarGoogle Scholar
  9. 9 GLADWELL, I., SHAMPINE, L. F., BACA, L. S., AND BRANKIN, R. W. Practical aspects of interpolation in Runge-Kutta codes. SIAM J. Sci. Stat. Comput. 8 (1987), 322-:341. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 HALL, G., AND HIGHAM, D.J. Analysis of stepsize selection schemes for Runge-Kutta codes. IMA J. Numer. Anal. 8 (1988), 305-310.Google ScholarGoogle ScholarCross RefCross Ref
  11. 11 HANSON, P. M., AND ENRIGHT, W. H. Controlling the defect in existing variable-order Adams codes for initial-value problems. ACM Trans. Math. Sofiw. 9 (1983), 71-97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 HIGHAM, D.J. Robust defect control with Runge-Kutta schemes, Numerical Analysis Rep. 150, Univ. of Manchester, 1987, To appear in SIAM J. Numer. Anal.Google ScholarGoogle Scholar
  13. 13 HIGHAM, D. J. Defect estimation in Adams PECE codes. SIAM J. Sci. Star. Comput. 10 (1989), 964-976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 HIGHAM, D. J. Runge-Kutta defect control using Hermite-Birkhoff interpolation. Tech. Rep. 221/89, Dept. of Computer Science, Univ. of Toronto, 1989. To appear in SIAM J. Sci. Stat. Comput. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 I-IoRN, M. K. Fourth- and Fifth-order, scaled Runge-Kutta algorithms for treating dense output. SIAM J. Numer. Anal. 20 (1983), 558-568.Google ScholarGoogle ScholarCross RefCross Ref
  16. 16 HULL, T. E., ENRIGHT, W. H., AND JACKSON, K.R. User's guide for DVERK-a subroutine for solving non-stiff ODEs. Tech. Rep. 100, Dept. of Computer Science, Univ. of Toronto, 1976.Google ScholarGoogle Scholar
  17. 17 KANSY, K. Elementare Fehlerdarstelllng fur Ableitungen bei der Hermite-Interpolation. Numer. Math. 21, (1973), 350-354.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 PRINCE, P. J., AND DORMAND, J. R. High order embedded Runge-Kutta formulae. J. Comput. Appl. Maths. 7 (1981), 67-75.Google ScholarGoogle ScholarCross RefCross Ref
  19. 19 SC~ULTZ, M.H. Spline Analysis. Prentice Hall, Englewood Cliffs, N.J, 1973.Google ScholarGoogle Scholar
  20. 20 SHAMPINE, L.F. Interpolation for Runge-Kutta methods. SIAM J. Numer. Anal. 22 (1985), 1014-1027.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 SHAMPINE, L.F. Some practical Runge-Kutta formulas. Math. Comp. 46 (1986), 135-150. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 SRAMPINE, L F., AND WATTS, H.A. The art of writing a Runge-Kutta code II Appl. Math. Comput. 5 (1979), 93 121.Google ScholarGoogle Scholar

Index Terms

  1. Highly continuous Runge-Kutta interpolants

          Recommendations

          Reviews

          Peter Bruce Worland

          Sometimes one needs to provide output from the numerical solution of initial value problems in ordinary differential equations that is more dense than one would normally obtain from the discretized approximation. This paper extends the work of Shampine [1], who derived Hermite-type interpolants to Runge-Kutta approximations with global C 1 continuity. Higham shows that these interpolants may be adapted to provide arbitrary smoothness (in practice, with global C 2 continuity) with competitive accuracy and cost. The author presents a general derivation of the interpolants and a rigorous analysis of the truncation error. Specific examples are obtained with fifth- and sixth-order local accuracies and global C 2 continuity. A detailed analysis determines practical limits imposed on the range of stepsize changes in adaptive codes in order to maintain acceptable levels of error in the interpolants. The author does a credible job of defending his choices. For examples, he points out the deficiencies in the alternative strategy of employing a cubic spline interpolant to the output from the Runge-Kutta global approximation. Reading Shampine [1] and this paper will provide a good overview of the general problem and current approaches to its solution.

          Access critical reviews of Computing literature here

          Become a reviewer for Computing Reviews.

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Mathematical Software
            ACM Transactions on Mathematical Software  Volume 17, Issue 3
            Sept. 1991
            142 pages
            ISSN:0098-3500
            EISSN:1557-7295
            DOI:10.1145/114697
            Issue’s Table of Contents

            Copyright © 1991 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 September 1991
            Published in toms Volume 17, Issue 3

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader