Skip to main content

IMEX Runge-Kutta Parareal for Non-diffusive Equations

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 356))

Abstract

Parareal is a widely studied parallel-in-time method that can achieve meaningful speedup on certain problems. However, it is well known that the method typically performs poorly on non-diffusive equations. This paper analyzes linear stability and convergence for IMEX Runge-Kutta Parareal methods on non-diffusive equations. By combining standard linear stability analysis with a simple convergence analysis, we find that certain Parareal configurations can achieve parallel speedup on non-diffusive equations. These stable configurations possess low iteration counts, large block sizes, and a large number of processors. Numerical examples using the nonlinear Schrödinger equation demonstrate the analytical conclusions.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The numerical experiments were performed on the Cray XC40 “Cori” at the National Energy Research Scientific Computing Center using four 32-core Intel “Haswell” processor nodes. The Parareal method is implemented as part of the open-source package LibPFASST available at https://github.com/libpfasst/LibPFASST.

References

  1. A. Arteaga, D. Ruprecht, and R. Krause, A stencil-based implementation of Parareal in the C++ domain specific embedded language STELLA, Applied Mathematics and Computation, 267 (2015), pp. 727–741.

    Article  MathSciNet  Google Scholar 

  2. U. M. Ascher, S. J. Ruuth, and B. T. Wetton, Implicit-explicit methods for time-dependent partial differential equations, SIAM Journal on Numerical Analysis, 32 (1995), pp. 797–823.

    Article  MathSciNet  Google Scholar 

  3. U. M. Ascher, S. J. Ruuth, and R. J. Spiteri, Implicit-Explicit Runge-Kutta methods for time-dependent partial differential equations, Appl. Numer. Math., 25 (1997), pp. 151–167.

    Article  MathSciNet  Google Scholar 

  4. E. Aubanel, Scheduling of tasks in the parareal algorithm, Parallel Comput., 37 (2011), pp. 172–182.

    Article  MathSciNet  Google Scholar 

  5. G. Bal, On the Convergence and the Stability of the Parareal Algorithm to Solve Partial Differential Equations, in Domain Decomposition Methods in Science and Engineering, R. Kornhuber and et al., eds., vol. 40 of Lecture Notes in Computational Science and Engineering, Berlin, 2005, Springer, pp. 426–432.

    Google Scholar 

  6. L. A. Berry, W. R. Elwasif, J. M. Reynolds-Barredo, D. Samaddar, R. S. Snchez, and D. E. Newman, Event-based parareal: A data-flow based implementation of parareal, Journal of Computational Physics, 231 (2012), pp. 5945–5954.

    Google Scholar 

  7. S. Boscarino and G. Russo, On a class of uniformly accurate IMEX Runge–Kutta schemes and applications to hyperbolic systems with relaxation, SIAM J. Sci. Comput., 31 (2009), pp. 1926–1945.

    Google Scholar 

  8. T. Buvoli, Rogue Waves in optics and water, PhD thesis, Master thesis, University of Colorado at Boulder, 2013.

    Google Scholar 

  9. T. Buvoli, A class of exponential integrators based on spectral deferred correction, SIAM Journal on Scientific Computing, 42 (2020), pp. A1–A27.

    Article  MathSciNet  Google Scholar 

  10. T. Buvoli, Codebase for “IMEX Runge-Kutta Parareal for Non- Diffusive Equations”, (2021). https://doi.org/10.5281/zenodo.4513662.

  11. M. P. Calvo, J. De Frutos, and J. Novo, Linearly implicit Runge-Kutta methods for advection-reaction-diffusion equations, Appl. Numer. Math., 37 (2001), pp. 535–549.

    Article  MathSciNet  Google Scholar 

  12. A. Cardone, Z. Jackiewicz, H. Zhang, and A. Sandu, Extrapolation-based implicit-explicit general linear methods, (2013).

    Google Scholar 

  13. S. M. Cox and P. C. Matthews, Exponential time differencing for stiff systems, Journal of Computational Physics, 176 (2002), pp. 430–455.

    Article  MathSciNet  Google Scholar 

  14. V. A. Dobrev, T. Kolev, N. A. Petersson, and J. B. Schroder, Two-level convergence theory for multigrid reduction in time (mgrit), SIAM Journal on Scientific Computing, 39 (2017), pp. S501–S527.

    Article  MathSciNet  Google Scholar 

  15. A. Dutt, L. Greengard, and V. Rokhlin, Spectral deferred correction methods for ordinary differential equations, BIT Numerical Mathematics, 40 (2000), pp. 241–266.

    Article  MathSciNet  Google Scholar 

  16. M. J. Gander, Analysis of the Parareal Algorithm Applied to Hyperbolic Problems using Characteristics, Bol. Soc. Esp. Mat. Apl., 42 (2008), pp. 21–35.

    MathSciNet  MATH  Google Scholar 

  17. M. J. Gander, 50 years of Time Parallel Time Integration, in Multiple Shooting and Time Domain Decomposition, Springer, 2015.

    Google Scholar 

  18. M. J. Gander and S. Vandewalle, Analysis of the Parareal Time-Parallel Time-Integration Method, SIAM Journal on Scientific Computing, 29 (2007), pp. 556–578.

    Article  MathSciNet  Google Scholar 

  19. E. Hairer and G. Wanner, Solving Ordinary Differential Equations II : Stiff and Differential-Algebraic Problems, Springer Berlin Heidelberg, 1991.

    Book  Google Scholar 

  20. E. Hairer, S. P. Nørsett, and G. Wanner, Solving Ordinary Differential Equations I. Nonstiff Problems, Math. Comput. Simul., 29 (1987), p. 447.

    Google Scholar 

  21. G. Izzo and Z. Jackiewicz, Highly stable implicit–explicit Runge–Kutta methods, Applied Numerical Mathematics, 113 (2017), pp. 71–92.

    Google Scholar 

  22. C. A. Kennedy and M. H. Carpenter, Additive Runge-Kutta schemes for convection-diffusion-reaction equations, Appl. Numer. Math., 44 (2003), pp. 139–181.

    Article  MathSciNet  Google Scholar 

  23. S. Krogstad, Generalized integrating factor methods for stiff PDEs, Journal of Computational Physics, 203 (2005), pp. 72–88.

    Article  MathSciNet  Google Scholar 

  24. J.-L. Lions, Y. Maday, and G. Turinici, A “parareal” in time discretization of PDE’s, Comptes Rendus de l’Acadmie des Sciences - Series I - Mathematics, 332 (2001), pp. 661–668.

    Google Scholar 

  25. M. Minion, Semi-implicit spectral deferred correction methods for ordinary differential equations, Communications in Mathematical Sciences, 1 (2003), pp. 471–500.

    Article  MathSciNet  Google Scholar 

  26. M. L. Minion, A Hybrid Parareal Spectral Deferred Corrections Method, Communications in Applied Mathematics and Computational Science, 5 (2010), pp. 265–301.

    Article  MathSciNet  Google Scholar 

  27. J. Nievergelt, Parallel Methods for Integrating Ordinary Differential Equations, Commun. ACM, 7 (1964), pp. 731–733.

    Article  MathSciNet  Google Scholar 

  28. D. Ruprecht, Shared Memory Pipelined Parareal, Springer International Publishing, 2017, pp. 669–681.

    Google Scholar 

  29. D. Ruprecht, Wave Propagation Characteristics of Parareal, Computing and Visualization in Science, 19 (2018), pp. 1–17.

    Article  MathSciNet  Google Scholar 

  30. A. Sandu and M. Günther, A generalized-structure approach to additive Runge–Kutta methods, SIAM Journal on Numerical Analysis, 53 (2015), pp. 17–42.

    Google Scholar 

  31. B. S. Southworth, Necessary Conditions and Tight Two-level Convergence Bounds for Parareal and Multigrid Reduction in Time, SIAM J. Matrix Anal. Appl., 40 (2019), pp. 564–608.

    Article  MathSciNet  Google Scholar 

  32. B. S. Southworth, W. Mitchell, A. Hessenthaler, and F. Danieli, Tight two-level convergence of linear parareal and mgrit: Extensions and implications in practice, arXiv preprint arXiv:2010.11879, (2020).

  33. G. A. Staff and E. M. Rnquist, Stability of the parareal algorithm, in Domain Decomposition Methods in Science and Engineering, R. Kornhuber and et al., eds., vol. 40 of Lecture Notes in Computational Science and Engineering, Berlin, 2005, Springer, pp. 449–456.

    Google Scholar 

  34. Z. Wang and S.-L. Wu, Parareal algorithms implemented with IMEX runge-kutta methods, Mathematical Problems in Engineering, 2015 (2015).

    Google Scholar 

  35. G. Wanner and E. Hairer, Solving ordinary differential equations II, Springer Berlin Heidelberg, 1996.

    MATH  Google Scholar 

Download references

Acknowledgements

The work of Buvoli was funded by the National Science Foundation, Computational Mathematics Program DMS-2012875.

The work of Minion was supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Applied Mathematics program under contract number DE-AC02005CH11231. Parts of the simulations were performed using resources of the National Energy Research Scientific Computing Center (NERSC), a DOE Office of Science User Facility supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tommaso Buvoli .

Editor information

Editors and Affiliations

Appendices

Appendix 1: Infinity Norm of the Parareal Iteration Matrix E

Let \(\mathbf {A}(\gamma )\) be the lower bidiagonal matrix

$$\begin{aligned} \mathbf {A}(\gamma ) = \left[ \begin{array}{cccc} 1 &{} &{} &{} \\ \gamma &{} 1 &{} &{} \\ &{} \ddots &{} \ddots &{} \\ &{} &{} \gamma &{} 1 \end{array}. \right] \end{aligned}$$

Lemma 1

The inverse of \(\mathbf {A}(\gamma )\) is given by

$$\begin{aligned} \mathbf {A}^{-1}_{i,j}(\gamma ) = {\left\{ \begin{array}{ll} (-\gamma )^{i-j} &{} j \le i \\ 0 &{} \text {otherwise} \end{array}\right. } \end{aligned}$$

Proof

For convenience, we temporarily drop the \(\gamma \) so that \(\mathbf {A}=\mathbf {A}(\gamma )\), then

$$\begin{aligned} \left( \mathbf {A} \mathbf {A}^{-1} \right) _{ij} = \sum _{k=1}^{{N_p}+1} \mathbf {A}_{ik}\mathbf {A}_{kj}^{-1}&= {\left\{ \begin{array}{ll} 0 &{} j> i\\ \mathbf {A}_{ii}\mathbf {A}_{ii}^{-1} &{} i=j \\ \mathbf {A}_{ii}\mathbf {A}_{ij}^{-1} + A_{i, i-1} A_{i-1,j}^{-1} &{} j<i \\ \end{array}\right. } \\&= {\left\{ \begin{array}{ll} 0 &{} j > i\\ 1 &{} i=j \\ (-\gamma )^{i-j} + \gamma (-\gamma )^{i-1-j} &{} j<i \end{array}\right. } \\&= {\left\{ \begin{array}{ll} 1 &{} i=j, \\ 0 &{} \text {otherwise} . \end{array}\right. } \end{aligned}$$

Lemma 2

The product of \(\mathbf {A}(\omega )\mathbf {A}^{-1}(\gamma )\) is

$$\begin{aligned} \left( \mathbf {A}(\omega ) \mathbf {A}^{-1}(\gamma ) \right) _{ij} = {\left\{ \begin{array}{ll} 0 &{} j > i \\ 1 &{} i = j \\ (-\gamma )^{i-j-1}(\omega - \gamma ) &{} j < i \end{array}\right. } \end{aligned}$$

Proof

$$\begin{aligned} \left( \mathbf {A}(\omega ) \mathbf {A}^{-1}(\gamma ) \right) _{ij}&= \sum _{k=1}^{{N_p}+1} \mathbf {A}_{ik}(\omega )\mathbf {A}_{kj}^{-1}(\gamma ) \\&= {\left\{ \begin{array}{ll} 0 &{} j> i\\ \mathbf {A}_{ii}(\omega ) \mathbf {A}_{ii}^{-1}(\gamma ) &{} i=j \\ \mathbf {A}_{ii}(\omega ) \mathbf {A}_{ij}^{-1} + \mathbf {A}_{i, i-1}(\omega ) \mathbf {A}_{i-1,j}^{-1} (\gamma ) &{} j<i \end{array}\right. } \\&= {\left\{ \begin{array}{ll} 0 &{} j > i\\ 1 &{} i=j \\ (-\gamma )^{i-j} + \omega (-\gamma )^{i-1-j} &{} j<i \end{array}\right. } \end{aligned}$$

Lemma 3

The infinity norm of the matrix \(M(\omega , \gamma ) {=} \mathbf {I} {-} \mathbf {A}(\omega )\mathbf {A}^{-1}(\gamma ) {\in } \mathbb {R}^{{N_p}+1, {N_p}+1}\) is

$$\begin{aligned} \Vert \mathbf {M}(\omega , \gamma ) \Vert _{\infty } = \frac{1 - |\gamma |^{{N_p}}}{1 - |\gamma |} |\gamma - \omega |. \end{aligned}$$

Proof

Using Lemma 2, the jth absolute column sum of \(M(\omega , \gamma )\) is

$$\begin{aligned} c_j = \sum _{k=j+1}^{{N_p}+1} |(-\gamma )^{k-j-1}(\omega - \gamma )| = \sum _{k=1}^{{N_p}- j} |(-\gamma )^{k}||(\omega - \gamma )| \end{aligned}$$

It follows that \(\max _j c_j = c_1\), which can be rewritten as

$$\begin{aligned} \frac{1 - |\gamma |^{{N_p}}}{1 - |\gamma |} |\gamma - \omega |. \end{aligned}$$

Appendix 2: Additional Stability and Convergence Overlay Plots

Figures 8, 9, and 10 show stability and convergence overlay plots for Parareal. The following three figures show stability and convergence overlay plots for Parareal configurations with: \({N_T}= 2048\), IMEX-RK4 as the fine integrator, and three different coarse integrators. These additional figures supplement Fig. 3 and show the effects of changing the course integrator.

Fig. 8
figure 8

Stability and convergence overlay plots for Parareal configurations with a block size of \({N_T}=2048\) and IMEX-RK1, IMEX-RK4 as the coarse and fine integrators

Fig. 9
figure 9

Stability and convergence overlay plots for Parareal configurations with a block size of \({N_T}=2048\) and IMEX-RK2, IMEX-RK4 as the coarse and fine integrators

Fig. 10
figure 10

Stability and convergence overlay plots for Parareal configurations with a block size of \({N_T}=2048\) and IMEX-RK4, IMEX-RK4 as the coarse and fine integrators

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Buvoli, T., Minion, M. (2021). IMEX Runge-Kutta Parareal for Non-diffusive Equations. In: Ong, B., Schroder, J., Shipton, J., Friedhoff, S. (eds) Parallel-in-Time Integration Methods. PinT 2020. Springer Proceedings in Mathematics & Statistics, vol 356. Springer, Cham. https://doi.org/10.1007/978-3-030-75933-9_5

Download citation

Publish with us

Policies and ethics