The parareal in time algorithm has been introduced by Lions Maday and Turinici. It is an iterative procedure based on the alternate use of a coarse and a fine solvers that allows to squeeze the resolution time if parallel architectures are available.Since its introduction, many developments and applications have been added and the coupling of this idea with standard domain decompositions or control iterations allow to increase the efficiency of the combined iterative solvers. An effort has also been made on the understanding of the effects of the use different schemes for the time resolution. Finally, the definition of the coarse solvers can be relaxed to allow for very fast resolution in this orthogonal direction. This minisymposium will present 4 contributions illustrating the different features and providing a wide range of applications of this new direction for parallelization.
Organizer: Yvon Maday
<maday@ann.jussieu.fr>
The minisymposium is held in 1 session.
Tuesday, July 22 11:00 - 12:40 Room 005
- The Parareal Algorithm: Basics and Combination with Domain Decomposition Iterations
(TM159)
Download article as pdf-file, 0.1 MB
Yvon Maday
(France)
- On the Analysis and Implementation of the Parareal Algorithm
(TM157)
Download article as pdf-file, 0.1 MB
Guillaume Bal
(United States)
- Stability and Convergence of the Parareal Algorithm
(TM127)
Download article as pdf-file, 0.2 MB
Gunnar Andreas Staff
(Norway)
- Investigation of the Parareal Algorithm for Semi-Implicit Incompressible Navier-Stokes Simulations
(TM160)
Download article as pdf-file, 0.2 MB
Paul F. Fischer
(United States)
|
