A Multiple Time Step Symplectic Algorithm for Integrating Close Encounters

Details A Multiple Time Step Symplectic Algorithm for Integrating Close Encounters A Multiple Time Step Symplectic Algorithm for Integrating Close Encounters

Oct 1998

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1998aj....116.2067d&link_type=abstract

The Astronomical Journal, Volume 116, Issue 4, pp. 2067-2077.

Astronomy and Astrophysics

Astronomy

167

Celestial Mechanics, Stellar Dynamics, Methods: Numerical, Stars: Planetary Systems, Solar System: General

Scientific paper

We present a new symplectic algorithm that has the desirable properties of the sophisticated but highly efficient numerical algorithms known as mixed variable symplectic (MVS) methods and that, in addition, can handle close encounters between objects. This technique is based on a variant of the standard MVS methods, but it handles close encounters by employing a multiple time step technique. When the bodies are well separated, the algorithm has the speed of MVS methods, and whenever two bodies suffer a mutual encounter, the time step for the relevant bodies is recursively subdivided to whatever level is required. We demonstrate the power of this method using several tests of the technique. We believe that this algorithm will be a valuable tool for the study of planetesimal dynamics and planet formation.

Affiliated with

Also associated with

No associations

Rating

A Multiple Time Step Symplectic Algorithm for Integrating Close Encounters 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 A Multiple Time Step Symplectic Algorithm for Integrating Close Encounters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Multiple Time Step Symplectic Algorithm for Integrating Close Encounters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1719787