Problem #2 - the Y 2n functions
- 1 March 1972
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- No. 22,p. 8-9
- https://doi.org/10.1145/1086789.1086790
Abstract
Many branches of mathematical physics use equations of the form[EQUATION]where λ is a small quantity, and the primes denote differentiation with respect to x. In the absence of a general solution, one tries to write f(x) as an expansion in powers of λ. More neatly, if[EQUATION]is tried, to fit the structure of (1), then the work reduces to the derivation of a series expansion for q(x). The solution is [1][EQUATION]where N signifies the order of approximation to which one wishes to go, and Y 2n represents the member of order λ 2n of a family of functions obtained by substitution of (3) into (1) and (2). The problem is to compute Y 2n for as many values of n as possible.Keywords
This publication has 1 reference indexed in Scilit:
- A FORTRAN-based list processor for Poisson seriesCelestial Mechanics and Dynamical Astronomy, 1970