Optimizing Coarse Propagators in Parareal Algorithms (2311.15320v2)
Abstract: The parareal algorithm represents an important class of parallel-in-time algorithms for solving evolution equations and has been widely applied in practice. To achieve effective speedup, the choice of the coarse propagator in the algorithm is vital. In this work, we investigate the use of {optimized} coarse propagators. Building upon the error estimation framework, we present a systematic procedure for constructing coarse propagators that enjoy desirable stability and consistent order. Additionally, we provide preliminary mathematical guarantees for the resulting parareal algorithm. Numerical experiments on a variety of settings, e.g., linear diffusion model, Allen-Cahn model, and viscous Burgers model, show that the optimizing procedure can significantly improve parallel efficiency when compared with the more ad hoc choice of some conventional and widely used coarse propagators.
- G. Bal and Y. Maday, A “parareal” time discretization for non-linear PDE’s with application to the pricing of an American put, in Recent developments in domain decomposition methods (Zürich, 2001), vol. 23 of Lect. Notes Comput. Sci. Eng., Springer, Berlin, 2002, pp. 189–202.
- S. Friedhoff and B. S. Southworth, On “optimal” hℎhitalic_h-independent convergence of parareal and multigrid-reduction-in-time using Runge-Kutta time integration, Numer. Linear Algebra Appl., 28 (2021), pp. Paper No. e2301, 30.
- Preprint, arXiv:2303.03848, 2023.
- J.-L. Lions, Y. Maday, and G. Turinici, Résolution d’EDP par un schéma en temps “pararéel”, C. R. Acad. Sci. Paris Sér. I Math., 332 (2001), pp. 661–668.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.