Statistics – Computation
Scientific paper
Sep 1998
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1998dda....30.1003r&link_type=abstract
American Astronomical Society, DDA meeting #30, #10.03; Bulletin of the American Astronomical Society, Vol. 30, p.1145
Statistics
Computation
Scientific paper
Rudmin and Goldstein have developed a computer code which performs celestial mechanics computations using the Parker- Sochacki algorithm [1]. This algorithm, an extension of the Picard Iteration, efficiently generates polynomials (up to degree 20 in this code) for the Cartesian positions and velocities of up to 20 particles orbiting self-consistently under mutual gravitation. The polynomials have been shown to be the Taylor Series for the the exact solution. Depending on the desired precision, the algorithm can conserve energy and angular momentum in a one-year projection to one part in 10 to the 12th. The computer code is being used to search for asteroids which are either bound to planets or are locked in synchronous orbit with them. The algorithm will be explained, and results for particular asteroids will be presented. [1] Neural, parallel & Scientific Computations 4 (1996) 97-112.
Goldstein Samuel J. Jr.
Rudmin Joseph W.
No associations
LandOfFree
Computing Trapped and Synchronous Asteroid Orbits using the Parker Sochacki Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing Trapped and Synchronous Asteroid Orbits using the Parker Sochacki Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Trapped and Synchronous Asteroid Orbits using the Parker Sochacki Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-814618