Time parallelization for hyperbolic and parabolic problems

Параллелизация по времени для гиперболических и параболических задач
Martin J. Gander, Shu‐Lin Wu, Tao Zhou
2025-06-30

Schwarz waveform relaxationhyperbolic problemsparabolic problemsparallel-in-time (PinT)space–time multigrid
Time parallelization, also known as PinT (parallel-in-time), is a new research direction for the development of algorithms used for solving very large-scale evolution problems on highly parallel computing architectures. Despite the fact that interesting theoretical work on PinT appeared as early as 1964, it was not until 2004, when processor clock speeds reached their physical limit, that research in PinT took off. A distinctive characteristic of parallelization in time is that information flow only goes forward in time, meaning that time evolution processes seem necessarily to be sequential. Nevertheless, many algorithms have been developed for PinT computations over the past two decades, and they are often grouped into four basic classes according to how the techniques work and are used: shooting-type methods; waveform relaxation methods based on domain decomposition; multigrid methods in space–time; and direct time parallel methods. However, over the past few years, it has been recognized that highly successful PinT algorithms for parabolic problems struggle when applied to hyperbolic problems. We will therefore focus on this important aspect, first by providing a summary of the fundamental differences between parabolic and hyperbolic problems for time parallelization. We then group PinT algorithms into two basic groups. The first group contains four effective PinT techniques for hyperbolic problems: Schwarz waveform relaxation (SWR) with its relation to tent pitching; parallel integral deferred correction; ParaExp; and ParaDiag. While the methods in the first group also work well for parabolic problems, we then present PinT methods specifically designed for parabolic problems in the second group: Parareal; the parallel full approximation scheme in space–time (PFASST); multigrid reduction in time (MGRiT); and space–time multigrid (STMG). We complement our analysis with numerical illustrations using four time-dependent PDEs: the heat equation; the advection–diffusion equation; Burgers’ equation; and the second-order wave equation.
1
It organizes parallel-in-time methods into techniques effective for hyperbolic problems and methods specifically designed for parabolic problems.
2
The analysis is illustrated numerically using the heat, advection–diffusion, Burgers’, and second-order wave equations.
3
The hyperbolic-focused group includes Schwarz waveform relaxation, parallel integral deferred correction, ParaExp, and ParaDiag.
4
The paper analyzes why parallel-in-time algorithms effective for parabolic problems often struggle when applied to hyperbolic problems.
5
The parabolic-focused group includes Parareal, PFASST, MGRiT, and space–time multigrid; several hyperbolic methods also perform well for parabolic problems.

Time-dependent hyperbolic and parabolic partial differential equations, including the heat, advection–diffusion, Burgers’, and second-order wave equations

Parallel-in-time (PinT) algorithms and their effectiveness, applicability, and fundamental differences for solving hyperbolic versus parabolic evolution problems

Publication Details
Publication Date
2025-06-30
Journal
Publisher
ISSN
Cited by
10
Access Type
Author Information
Authors
Martin J. Gander
Shu‐Lin Wu
Tao Zhou
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat
Make a presentation
100%