Abstract
Long-time integrations are an important issue in the numerical solution of Hamiltonian systems. They are time consuming and it is natural to consider the use of parallel architectures for reasons of efficiency. In this context the parareal algorithm has been proposed by several authors.The present work is a theoretical study of the parareal algorithm when it is applied to Hamiltonian differential equations. The idea of backward error analysis is employed to get insight into the long-time behavior of numerical approximations. One of the main results is that convergence of the parareal iterations restricts the length of the time window. For nearly integrable systems its length is bounded by the square root of the inverse of the accuracy of the coarse integrator. The theoretical bounds are confirmed by numerical experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
