A time-parallel algorithm for almost integrable Hamiltonian systems
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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.