A time-parallel algorithm for almost integrable Hamiltonian systems
classification
💻 cs.NA
cs.NA
keywords
algorithmalmosthamiltonianintegrablesst97systemstime-parallelaction-angle
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.