TY  - JOUR
AU  - Minion, M. L.
AU  - Speck, R.
AU  - Bolten, M.
AU  - Emmett, M.
AU  - Ruprecht, D.
TI  - Interweaving PFASST and Parallel Multigrid
JO  - SIAM journal on scientific computing
VL  - 37
IS  - 5
SN  - 0196-5204
CY  - Philadelphia, Pa.
PB  - SIAM
M1  - FZJ-2015-07167
SP  - S244 - S263
PY  - 2015
AB  - The parallel full approximation scheme in space and time (PFASST) introduced by Emmett and Minion in 2012 is an iterative strategy for the temporal parallelization of ODEs and discretized PDEs. As the name suggests, PFASST is similar in spirit to a space-time full approximation scheme multigrid method performed over multiple time steps in parallel. However, since the original focus of PFASST was on the performance of the method in terms of time parallelism, the solution of any spatial system arising from the use of implicit or semi-implicit temporal methods within PFASST have simply been assumed to be solved to some desired accuracy completely at each substep and each iteration by some unspecified procedure. It hence is natural to investigate how iterative solvers in the spatial dimensions can be interwoven with the PFASST iterations and whether this strategy leads to a more efficient overall approach. This paper presents an initial investigation on the relative performance of different strategies for coupling PFASST iterations with multigrid methods for the implicit treatment of diffusion terms in PDEs. In particular, we compare full accuracy multigrid solves at each substep with a small fixed number of multigrid V-cycles. This reduces the cost of each PFASST iteration at the possible expense of a corresponding increase in the number of PFASST iterations needed for convergence. Parallel efficiency of the resulting methods is explored through numerical examples.
LB  - PUB:(DE-HGF)16
UR  - <Go to ISI:>//WOS:000364457000031
DO  - DOI:10.1137/14097536X
UR  - https://juser.fz-juelich.de/record/278997
ER  -