Multilevel convergence analysis of multigrid-reduction-in-time
Andreas Hessenthaler, Ben S. Southworth, David Nordsletten and, Oliver R\"ohrle, Robert D. Falgout, Jacob B. Schroder

TL;DR
This paper develops a multilevel convergence framework for MGRIT, providing bounds and formulas to predict convergence behavior, supported by numerical experiments on diffusion and wave problems.
Contribution
It generalizes two-grid estimates to multilevel settings, offering a priori bounds and formulas for MGRIT convergence analysis and algorithm design.
Findings
Convergence bounds are validated numerically.
Hyperbolic problems show deteriorating convergence with more levels.
L-stable Runge-Kutta schemes improve multilevel convergence.
Abstract
This paper presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time stepping operator, analyzed directly and bounded in norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time stepping operator as parameters. The paper concludes with supporting…
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.
