Skip to main content
SpringerLink
Log in

On the multiplication of poisson series

  • Published:
Celestial mechanics Aims and scope Submit manuscript

Abstract

The advantages of a tree-like data structure for use in the multiplication of Poisson series by computer are espoused. Compared to list representations, computations with trees can be faster by a factor ofn/log(n), wheren is the number of trigonometric terms in a multiplicand.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barton, D.: 1966,Astron. J. 71, 438.

    Google Scholar 

  • Barton, D. and Fitch, J. P.: 1972,Rep. Phys. 35, 235.

    Google Scholar 

  • Jefferys, W. H.: 1970,Celes. Mech. 2, 474.

    Google Scholar 

  • Knuth, D. E.: 1973,The Art of Computer Programming, Vol. 3, Addison Wesley.

  • Kovalevsky, J.: 1968,Astron. J. 73, 203.

    Google Scholar 

  • The Mathlab Group: 1974,The MACSYMA Manual, Project MAC, Mass. Inst. of Technology.

  • Rom, A.: 1970,Celes. Mech. 1, 301.

    Google Scholar 

  • Rom, A.: 1971,Celes. Mech. 3, 331.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Project MAC, Massachusetts Institute of Technology, Cambridge, Mass., USA

    Richard J. Fateman

Authors
  1. Richard J. Fateman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fateman, R.J. On the multiplication of poisson series. Celestial Mechanics 10, 243–247 (1974). https://doi.org/10.1007/BF01227622

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01227622

Keywords

Search

Navigation