Abstract:The applicability of the Parareal parallel-in-time integration scheme for the solution of a linear, two-dimensional hyperbolic acoustic-advection system, which is often used as a test case for integration schemes for numerical weather prediction (NWP), is addressed. Parallel-in-time schemes are a possible way to increase, on the algorithmic level, the amount of parallelism, a requirement arising from the rapidly growing number of CPUs in high performance computer systems. A recently introduced modification of … Show more
“…They applied this idea to the linear hyperbolic problems in structural dynamics. Recently, a similar idea was successfully applied to linear hyperbolic problems [21]. The basic idea of the Krylov subspace parareal method is to project u k+1 i onto a subspace spanned by all numerical solutions integrated by the fine solver at previous iterations.…”
Section: The Krylov Subspace Parareal Methodsmentioning
confidence: 99%
“…The compression ratio is R = r/N . Following the notation of [21]: In [21], the speedup is estimated as…”
Section: Complexity Analysismentioning
confidence: 99%
“…Another attempt, the Krylov subspace parareal method, builds a new coarse solver by reusing all information from the corresponding fine solver at previous iterations. The stability of this approach was demonstrated for linear problems on linear structural dynamics [10] and a linear 2-D acoustic-advection system [21]. However, the Krylov subspace parareal method appears to be limited to linear problems.…”
Section: Introductionmentioning
confidence: 99%
“…Inspired by [13,21], we propose a modified parareal method, referred to as the reduced basis parareal method in which the Krylov subspace is replaced by a subspace spanned by a set of reduced bases, constructed on-the-fly from the fine solver. This method inherits most advantages of the Krylov subspace parareal method and is observed to retain stability and convergence for linear wave problems.…”
We propose a modified parallel-in-time -parareal -multi-level time integration method which, in contrast to previously proposed methods, employs a coarse solver based on a reduced model, built from the information obtained from the fine solver at each iteration. This approach is demonstrated to offer two substantial advantages: it accelerates convergence of the original parareal method for similar problems and the reduced basis stabilizes the parareal method for purely advective problems where instabilities are known to arise. When combined with empirical interpolation methods (EIM), we develop this approach to solve both linear and nonlinear problems and highlight the minimal changes required to utilize this algorithm to accelerate existing implementations. We illustrate the advantages through algorithmic design, through analysis of stability, convergence, and computational complexity, and through several numerical examples.
“…They applied this idea to the linear hyperbolic problems in structural dynamics. Recently, a similar idea was successfully applied to linear hyperbolic problems [21]. The basic idea of the Krylov subspace parareal method is to project u k+1 i onto a subspace spanned by all numerical solutions integrated by the fine solver at previous iterations.…”
Section: The Krylov Subspace Parareal Methodsmentioning
confidence: 99%
“…The compression ratio is R = r/N . Following the notation of [21]: In [21], the speedup is estimated as…”
Section: Complexity Analysismentioning
confidence: 99%
“…Another attempt, the Krylov subspace parareal method, builds a new coarse solver by reusing all information from the corresponding fine solver at previous iterations. The stability of this approach was demonstrated for linear problems on linear structural dynamics [10] and a linear 2-D acoustic-advection system [21]. However, the Krylov subspace parareal method appears to be limited to linear problems.…”
Section: Introductionmentioning
confidence: 99%
“…Inspired by [13,21], we propose a modified parareal method, referred to as the reduced basis parareal method in which the Krylov subspace is replaced by a subspace spanned by a set of reduced bases, constructed on-the-fly from the fine solver. This method inherits most advantages of the Krylov subspace parareal method and is observed to retain stability and convergence for linear wave problems.…”
We propose a modified parallel-in-time -parareal -multi-level time integration method which, in contrast to previously proposed methods, employs a coarse solver based on a reduced model, built from the information obtained from the fine solver at each iteration. This approach is demonstrated to offer two substantial advantages: it accelerates convergence of the original parareal method for similar problems and the reduced basis stabilizes the parareal method for purely advective problems where instabilities are known to arise. When combined with empirical interpolation methods (EIM), we develop this approach to solve both linear and nonlinear problems and highlight the minimal changes required to utilize this algorithm to accelerate existing implementations. We illustrate the advantages through algorithmic design, through analysis of stability, convergence, and computational complexity, and through several numerical examples.
“…A very general scheme is Parareal [15], which allows arbitrary integration schemes to be used in a black-box fashion. A detailed mathematical analysis of Parareal is conducted in [8] and comprehensive lists of references can be found e. g. in [17,20]. The drawback of Parareal is that the parallel efficiency is formally bounded by 1/K where K is the number of iterations required for convergence.…”
Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. One of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge-Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.
K E Y W O R D Shigh-order, hyperbolic, MGRIT, multigrid, parallel-in-time, Parareal
INTRODUCTIONAs compute clock speeds stagnate and core counts of parallel machines increase dramatically, parallel-in-time methods provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs). 1,2 Two well-known parallel time integration methods are Parareal 3 and multigrid reduction-in-time (MGRIT), 4
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.