Necessary Conditions and Tight Two-level Convergence Bounds for Parareal and Multigrid Reduction in Time
Ben S. Southworth

TL;DR
This paper establishes necessary and sufficient conditions for the convergence of Parareal and MGRiT methods in linear problems, introducing the temporal approximation property (TAP) to characterize their effectiveness.
Contribution
It derives tight two-level convergence bounds and formalizes the TAP, providing a comprehensive framework for understanding and predicting the convergence of parallel-in-time methods.
Findings
Convergence bounds are characterized by a parameter that bounds the difference between coarse and fine propagators.
The TAP indicates how well coarse schemes approximate fine schemes on different vector components.
Necessary and sufficient conditions for convergence are established for linear problems.
Abstract
Parareal and multigrid reduction in time (MGRiT) are two of the most popular parallel-in-time methods. The idea is to treat time integration in a parallel context by using a multigrid method in time. If is a (fine-grid) time-stepping scheme, let denote a "coarse-grid" time-stepping scheme chosen to approximate steps of , . In particular, defines the coarse-grid correction, and evaluating should be (significantly) cheaper than evaluating . A number of papers have studied the convergence of Parareal and MGRiT. However, there have yet to be general conditions developed on the convergence of Parareal or MGRiT that answer simple questions such as, (i) for a given and , what is the best , or (ii) can Parareal/MGRiT converge for my problem? This work derives necessary and sufficient conditions for the convergence of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
