Skip to main content
Log in

Approximate compositions of a near identity map by multi-revolution Runge-Kutta methods

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

The so-called multi-revolution methods were introduced in celestial mechanics as an efficient tool for the long-term numerical integration of nearly periodic orbits of artificial satellites around the Earth. A multi-revolution method is an algorithm that approximates the map φ T N of N near-periods T in terms of the one near-period map φ T evaluated at few s << N selected points. More generally, multi-revolution methods aim at approximating the composition φN of a near identity map φ. In this paper we give a general presentation and analysis of multi-revolution Runge-Kutta (MRRK) methods similar to the one developed by Butcher for standard Runge-Kutta methods applied to ordinary differential equations. Order conditions, simplifying assumptions, and order estimates of MRRK methods are given. MRRK methods preserving constant Poisson/symplectic structures and reversibility properties are characterized. The construction of high order MRRK methods is described based on some families of orthogonal polynomials.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Butcher, J. C.: Implicit Runge-Kutta processes. Math. Comput. 18, 50–64 (1964)

    MATH  Google Scholar 

  2. Butcher, J. C.: The numerical analysis of ordinary differential equations. Runge-Kutta and general linear methods, John Wiley & Sons, Chichester, 1987

  3. Calvo, M., Montijano, J. I., Rández, L.: On multi-revolution explicit Runge-Kutta schemes. Technical report, Departamento de Matemática Aplicada, Universidad de Zaragoza, Spain, 2002

  4. Chan, R. P. K.: On symmetric Runge-Kutta methods of high order. Computing 45, 301–309 (1990)

    MathSciNet  MATH  Google Scholar 

  5. Graf, O. F.: Multirevolution methods for orbit integration. In Watson, G. A., editor, Proceedings of the 1973 Dundee conference on the numerical solution of differential equations, 363 Lect. Notes in Math. 471–490 Springer, Berlin, 1974

  6. Graf, O. F., Bettis, D. G.: Modified multirevolution integration methods for satellite orbit computation. Celestial Mechanics 11, 433–448 (1975)

    MATH  Google Scholar 

  7. Hairer, E., Lubich, C., Wanner, G.: Geometric numerical integration, 31 Comput. Math., Springer, Berlin, 2002

  8. Hairer, E., Nørsett, S. P., Wanner, G.: Solving ordinary differential equations I. Nonstiff problems, 8 Comput. Math., Springer, Berlin, Second Revised Edition, 1993

  9. Hairer, E., Wanner, G.: Solving ordinary differential equations II. Stiff and differential-algebraic problems, 14 Comput. Math. Springer, Berlin, Second Revised Edition, 1996

  10. Jay, L. O.: Structure preservation for constrained dynamics with super partitioned additive Runge-Kutta methods. SIAM J. Sci. Comput. 20, 416–446 (1999)

    Google Scholar 

  11. Kundert, K., White, J., Sangiovanni-Vincentelli, A.: An envelope-following method for the efficient transient simulation of switching power and filter circuits. Proc. of IEEE International Conf. on Computer-Aided Design (1988)

  12. Mace, D., Thomas, L. H.: An extrapolation method for stepping the calculations of the orbit of an artificial satellite several revolutions ahead at a time. Astronomical Journal 65 (1960)

  13. Marsden, J. E., Ratiu, T. S.: Introduction to mechanics and symmetry, 17 Texts in applied math., Springer, New York, 1994

  14. Melendo, B., Palacios, M.: A new approach to the construction of multirevolution methods and their implementation. Appl. Numer. Math. 23, 259–274 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. Montijano, J. I.: Constructive characterization of symplectic Runge-Kutta methods. Technical report, Departamento de Matemática Aplicada, Universidad de Zaragoza, Spain, 2002

  16. Petzold, L. R.: An efficient numerical method for highly oscillatory ordinary differential equations. SIAM J. Numer. Anal. 18, 455–479 (1981)

    MathSciNet  MATH  Google Scholar 

  17. Petzold, L. R., Jay, L. O., Yen, J.: Numerical solution of highly oscillatory ordinary differential equations. Acta Numerica 6, 437–484 (1997)

    MATH  Google Scholar 

  18. Sanz-Serna, J. M., Calvo, M. P.: Numerical Hamiltonian problems, 7 Appl. Math. and Math. Comput., Chapman & Hall, London, 1994

  19. Szegö, G.: Orthogonal polynomials, volume XXIII of Colloquium Publications. American Mathematical Society, 1939

  20. Taratynova, G. P.: Numerical solution of equations of finite differences and their application to the calculation of orbits of artificial earth satellites. AES J. supplement 4, 56–85 (1960) Translated from Artificial Earth Satellites

    Google Scholar 

  21. Telichevesky, R., Kundert, K., White, J.: Efficient AC and noise analysis of two-tone RF circuits. Proc. of Design Automation Conf., Las Vegas (1996)

  22. White, J., Leeb, S. B.: An envelope-following approach to switching power converter simulation. IEEE Trans. on Power Electronics 6, 303–307 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Laurent O. Jay.

Additional information

Mathematics Subject Classification (1991): 65L05, 65L06

This material is based upon work supported by the National Science Foundation Grant No. 9983708 and by the DGI Grant BFM2001–2562

Rights and permissions

Reprints and permissions

About this article

Cite this article

Calvo, M., Jay, L., Montijano, J. et al. Approximate compositions of a near identity map by multi-revolution Runge-Kutta methods. Numer. Math. 97, 635–666 (2004). https://doi.org/10.1007/s00211-004-0518-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00211-004-0518-9

Keywords

Navigation