[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Construction of rational and negative powers of a formal series

Published: 01 January 1971 Publication History

Abstract

Some methods are described for the generation of fractional and negative powers of any formal series, such as Poisson series or Chebyshev series. It is shown that, with the use of the three elementary operations of addition, subtraction, and multiplication, all rational (positive and negative) powers of a series can be constructed. There are basically two approaches: the binomial theorem and the iteration methods. Both methods are described here, and the relationship between them is pointed out. Some well-known classical formulas are obtained as particular cases, and it is shown how the convergence properties of these formulas can be improved with very little additional computations. Finally, at the end of the article, some numerical experiments are described with Chebyshev series and with Fourier series.

References

[1]
BROUCKE, R., AND GARTIIWAITE, K. A Programming system for analytical series expansions on a computer. Celestial Mechanics 1, 2 (Oct. 1969), 271-284.
[2]
BROUWER, D., AND CLEMENCE, G. Methods of Celestial Mechanics. Academic Press, New York, 1961, p. 463.
[3]
DAvis, M. S. Programming systems for analytical developments on computers. Astronomical J, 78, 3 (Apr. 1968), 195-- 202.
[4]
DEPRIT, A., AND ROM, A. Computerized expansions in elliptic motion. Bulletin Astronomique, Ser. 3, 3 (1967), 425-447.
[5]
KOVALEVSKY, J. Methode numerique de calcul de perturbations generales. Bulletin Astronomique, Ser. 1, 3, 1, 1-83.
[6]
ROM, A. R. M. Mechanized algebraic operations (MAO). Celestial Mechanics, 1, 3/4 (Feb. 1970), 301-319.
[7]
TOBEY, a . G. Eliminating monotonous mathematics with Formac. Comm. ACM 9, 10 (Oct. 1966), 742-751.
[8]
TRAUR, J. F. lterative Methods for the Solution of Equations. Prentice-Hall, Englewood Cliffs, N.J., 1964.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 14, Issue 1
Jan. 1971
55 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/362452
Issue’s Table of Contents
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: 01 January 1971
Published in CACM Volume 14, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Chebyshev series
  2. Fourier series
  3. Newton iterations
  4. Poisson series
  5. binomial theorem
  6. root extraction
  7. series expansion
  8. series inversion

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)100
  • Downloads (Last 6 weeks)18
Reflects downloads up to 23 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Algebra of Orthogonal SeriesPattern Recognition and Image Analysis10.1134/S105466182304034X33:4(1309-1314)Online publication date: 1-Dec-2023
  • (2006)Chebyshev series expansion of inverse polynomialsJournal of Computational and Applied Mathematics10.1016/j.cam.2005.10.013196:2(596-607)Online publication date: 15-Nov-2006
  • (2006)Computation of solar perturbations with poisson seriesProceedings of the Conference on the Numerical Solution of Ordinary Differential Equations10.1007/BFb0066594(237-259)Online publication date: 27-Aug-2006
  • (2005)VSVO formulation of the taylor method for the numerical solution of ODEsComputers & Mathematics with Applications10.1016/j.camwa.2005.02.01050:1-2(93-111)Online publication date: 1-Jul-2005
  • (2002)Applications of algebraic manipulation programs in physicsReports on Progress in Physics10.1088/0034-4885/35/1/30535:1(235-314)Online publication date: 5-Aug-2002
  • (1999)Automatic programming of recurrent power seriesMathematics and Computers in Simulation10.1016/S0378-4754(99)00087-749:4-5(351-362)Online publication date: Sep-1999
  • (1995)Dominant Takeover Regimes for Genetic AlgorithmsArtificial Neural Nets and Genetic Algorithms10.1007/978-3-7091-7535-4_59(223-226)Online publication date: 1995
  • (1989)A Fortran-Based Poisson Series Processor and It’s Applications in Celestial MechanicsApplications of Computer Technology to Dynamical Astronomy10.1007/978-94-009-0985-4_40(255-265)Online publication date: 1989
  • (1988)A FORTRAN-based Poisson series processor and its applications in celestial mechanicsCelestial Mechanics10.1007/BF0122900845:1-3(255-265)Online publication date: Mar-1988
  • (1977)Convergence of Newton's iteration for the expansion of the planetary disturbing functionCelestial Mechanics10.1007/BF0122905315:1(125-129)Online publication date: Feb-1977
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media