A note on the algorithm of symplectic integrators

Details A note on the algorithm of symplectic integrators A note on the algorithm of symplectic integrators

Jan 2003

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2003ap%26ss.283...53w&link_type=abstract

Astrophysics and Space Science, v. 283, Issue 1, p. 53-65 (2003).

Astronomy and Astrophysics

Astrophysics

8

Scientific paper

For a Hamiltonian that can be separated into N+1 (N≥ 2) integrable parts, four algorithms can be built for a symplectic integrator. This research compares these algorithms for the first and second order integrators. We found that they have similar local truncation errors represented by error Hamiltonian but rather different numerical stability. When the computation of the main part of the Hamiltonian, H 0, is not expensive, we recommend to use S * type algorithm, which cuts the calculation of the H 0 system into several small time steps as Malhotra(1991) did. As to the order of the N+1 parts in one step calculation, we found that from the large to small would get a slower error accumulation.

Affiliated with

Also associated with

No associations

Rating

A note on the algorithm of symplectic integrators 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 note on the algorithm of symplectic integrators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the algorithm of symplectic integrators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1525724