Optimized computation with recursive power series integration
Unknown · 2013
Read Optimized computation with recursive power series integration by Unknown (2013) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/nasa-tm-19680010756-optimized-computation-with-recursive-pow.txt.
Description
R. H. Estes and E. R. Lancaster, at the Goddard Space Flight Center in Maryland, speed up a classic computing method in March 1968. They apply power series integration to the restricted three-body problem. Their new recursion formulas for the series terms cut computing time sharply compared with earlier authors' versions.
The paper also takes up step size: how far the calculation can leap at once. It discusses and extends Van Flandern's method for getting the most step per unit of computer time. Error control guides the choices throughout. A method for keeping the series terms from ballooning is presented as well.
Catalog record
| CREATOR | Unknown |
|---|---|
| YEAR | 2013 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 11 KB |
| LICENSE | Public Domain |
| RIGHTS | PUBLIC DOMAIN |
| SOURCE | NASA NTRS |