Computer Science – Numerical Analysis
Scientific paper
2011-06-18
Computer Science
Numerical Analysis
19 pages, 6 figures
Scientific paper
We introduce a time-parallel algorithm for solving numerically almost integrable Hamiltonian systems in action-angle coordinates. This algorithm is a refinement of that introduced by Saha, Stadel and Tremaine in 1997 (SST97) for the same type of problems. Our refined algorithm has a better convergence obtained from the use of derivatives of the perturbing term not considered in the original SST97 algorithm. An advantage of this algorithm is its independence of the step-size for the parallelized procedures which can be consider as a particular case of the parareal scheme.
Jiménez-Pérez Hugo
Laskar Jacques
No associations
LandOfFree
A time-parallel algorithm for almost integrable Hamiltonian systems 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 time-parallel algorithm for almost integrable Hamiltonian systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A time-parallel algorithm for almost integrable Hamiltonian systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-723021