A multigrid perspective on the parallel full approximation scheme in space and time

Abstract

SummaryFor the numerical solution of time‐dependent partial differential equations, time‐parallel methods have recently been shown to provide a promising way to extend prevailing strong‐scaling limits of numerical codes. One of the most complex methods in this field is the “Parallel Full Approximation Scheme in Space and Time” (PFASST). PFASST already shows promising results for many use cases and benchmarks. However, a solid and reliable mathematical foundation is still missing. We show that, under certain assumptions, the PFASST algorithm can be conveniently and rigorously described as a multigrid‐in‐time method. Following this equivalence, first steps towards a comprehensive analysis of PFASST using blockwise local Fourier analysis are taken. The theoretical results are applied to examples of diffusive and advective type.