Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Robust Convergence of Parareal Algorithms with Arbitrarily High-order Fine Propagators (2109.05203v1)

Published 11 Sep 2021 in math.NA and cs.NA

Abstract: The aim of this paper is to analyze the robust convergence of a class of parareal algorithms for solving parabolic problems. The coarse propagator is fixed to the backward Euler method and the fine propagator is a high-order single step integrator. Under some conditions on the fine propagator, we show that there exists some critical $J_$ such that the parareal solver converges linearly with a convergence rate near $0.3$, provided that the ratio between the coarse time step and fine time step named $J$ satisfies $J \ge J_$. The convergence is robust even if the problem data is nonsmooth and incompatible with boundary conditions. The qualified methods include all absolutely stable single step methods, whose stability function satisfies $|r(-\infty)|<1$, and hence the fine propagator could be arbitrarily high-order. Moreover, we examine some popular high-order single step methods, e.g., two-, three- and four-stage Lobatto IIIC methods, and verify that the corresponding parareal algorithms converge linearly with a factor $0.31$ and the threshold for these cases is $J_* = 2$. Intensive numerical examples are presented to support and complete our theoretical predictions.

Citations (2)

Summary

We haven't generated a summary for this paper yet.