• Corpus ID: 246275989

Toward Parallel in Time for Chaotic Dynamical Systems

  title={Toward Parallel in Time for Chaotic Dynamical Systems},
  author={David A. Vargas and Robert D. Falgout and Stefanie G{\"u}nther and Jacob B. Schroder},
As CPU clock speeds have stagnated, and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes are a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel in Time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps, and have… 

Figures and Tables from this paper


Multigrid methods with space–time concurrency
This paper develops parallel software and performance models to study the three basic options of multigrid algorithms on space–time grids that allow parallelism in space and time, and introduces an extension of one of them for handling multistep time integration.
Parallel Time Integration with Multigrid
The resulting multigrid‐reduction‐in‐time (MGRIT) algorithms are non‐intrusive approaches, which directly use an existing time propagator and, thus, can easily exploit substantially more computational resources then standard sequential time‐stepping.
Applications of time parallelization
This review article serves to summarize the many advances in time-parallel computations since the excellent review article by Gander, “50 years of Time Parallel Integration” (Gander, in: 50 years of
Optimizing multigrid reduction‐in‐time and Parareal coarse‐grid operators for linear advection
This paper applies 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.
Multi-level adaptive solutions to boundary-value problems math comptr
The boundary-value problem is discretized on several grids (or finite-element spaces) of widely different mesh sizes, enabling us to conveniently adapt the discretization to the evolving solution in a nearly optimal way, obtaining "°°-order" approximations and low n, even when singularities are present.
Theory and Computation of Covariant Lyapunov Vectors
This article summarizes the available information related to Lyapunov vectors and provides a detailed explanation of both the theoretical basics and numerical algorithms, and introduces the notion of adjoint covariant Lyap unov vectors.
Nonlinear Dynamics and Chaos: with Applications to Physics, Biology, Chemistry, and Engineering, studies
  • 1994
Multi - level adaptive solutions to boundary - value problems What good are numerical simulations of chaotic dynamical systems ?