Automatic methods for highly oscillatory ordinary differential equations

  • C. W. Gear
  • K. A. Gallivan
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 912)


By a highly oscillatory ODE we mean one whose solution is “nearly periodic.” This paper is concerned with the low-cost, automatic detection of oscillatory behavior, the determination of its period, and methods for its subsequent efficient integration. In the first phase, the method for oscillatory problems discussed examines the output of an integrator to determine if the output is nearly periodic. At the point this answer is positive, the second phase is entered and an automatic multirevolutionary method is invoked to integrate a quasi-envelope of the solution. This requires the occasional solution of a nearly periodic initial-value problem over one period by a standard method and the re-determination of its period to provide the approximate derivatives of a quasi-envelope. The major difficulties addressed in this paper are the following: the determination of the point at which multirevolutionary methods are more economic, the automatic detection of stiffness in the multirevolutionary method (which uses a very large step), the calculation of the equivalent Jacobian for the multirevolutionary method (it is a transition matrix of the system over one period), and the calculation of a smooth quasi-envelope.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Gallivan, K.A., Detection and integration of oscillatory differential equations with initial stepsize, order and method selection, Dept. Computer Science Report UIUCDCS-R-80-1045, Univ. Illinois at Urbana-Champaign, M.S. Thesis, 1980.Google Scholar
  2. [2]
    Gear, C.W., Automatic detection and treatment of oscillatory and/or stiff ordinary differential equations, Dept. Computer Science Report UIUCDCS-R-80-1019, Univ. Illinois at Urbana-Champaign, 1980. To appear in Proceedings of the Bielefeld Conference on Numerical Methods in Computational Chemistry, 1980.Google Scholar
  3. [3]
    Gear, C.W., Runge-Kutta starters for multistep methods, TOMS 6 (3), September 1980, 263–279.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    Graff, O.F. and D.G. Bettis, Modified multirevolution integration methods for satellite orbit computation, Celestial Mechanics 11, 1975, 443–448.MathSciNetzbMATHGoogle Scholar
  5. [5]
    Graff, O.F., Methods of orbit computation with multirevolution steps, Applied Mechanics Research Laboratory Report 1063, Univ. Texas at Austin, 1973.Google Scholar
  6. [6]
    Mace, D. and L.H. Thomas, An extrapolation method for stepping the calculations of the orbit of an artificial satellite several revolutions ahead at a time, Astronomical Journal 65 (5), June 1960.Google Scholar
  7. [7]
    Petzold, L.R., An efficient numerical method for highly oscillatory ordinary differential equations, Dept. Computer Science Report UIUCDCS-R-78-933, Univ. Illinois at Urbana-Champaign, Ph.D. Thesis, 1978.Google Scholar
  8. [8]
    Skelboe, S., Computation of the periodic steady state response of nonlinear networks by extrapolation methods, IEEE Trans. Circuits and Systems CAS-27, (3), 1980, 161–175.MathSciNetCrossRefzbMATHGoogle Scholar
  9. [9]
    Vu, T., Modified Runge-Kutta methods for solving ODEs, Dept. Computer Science Report UIUCDCS-R-81-1064, Univ. Illinois at Urbana-Champaign, M.S. Thesis, 1981.Google Scholar

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • C. W. Gear
  • K. A. Gallivan

There are no affiliations available

Personalised recommendations