Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Asymptotic convergence of the parallel full approximation scheme in space and time for linear problems

Asymptotic convergence of the parallel full approximation scheme in space and time for linear... For time‐dependent partial differential equations, parallel‐in‐time integration using the “parallel full approximation scheme in space and time” (PFASST) is a promising way to accelerate existing space‐parallel approaches beyond their scaling limits. Inspired by the classical Parareal method and multigrid ideas, PFASST allows to integrate multiple time steps simultaneously using a space–time hierarchy of spectral deferred correction sweeps. While many use cases and benchmarks exist, a solid and reliable mathematical foundation is still missing. Very recently, however, PFASST for linear problems has been identified as a multigrid method. In this paper, we will use this multigrid formulation and, in particular, PFASST's iteration matrix to show that, in the nonstiff and stiff limit, PFASST indeed is a convergent iterative method. We will provide upper bounds for the spectral radius of the iteration matrix and investigate how PFASST performs for increasing numbers of parallel time steps. Finally, we will demonstrate that the results obtained here indeed relate to actual PFASST runs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Numerical Linear Algebra With Applications Wiley

Asymptotic convergence of the parallel full approximation scheme in space and time for linear problems

Loading next page...
 
/lp/wiley/asymptotic-convergence-of-the-parallel-full-approximation-scheme-in-QYMHuRSur4

References (42)

Publisher
Wiley
Copyright
© 2018 John Wiley & Sons, Ltd.
ISSN
1070-5325
eISSN
1099-1506
DOI
10.1002/nla.2208
Publisher site
See Article on Publisher Site

Abstract

For time‐dependent partial differential equations, parallel‐in‐time integration using the “parallel full approximation scheme in space and time” (PFASST) is a promising way to accelerate existing space‐parallel approaches beyond their scaling limits. Inspired by the classical Parareal method and multigrid ideas, PFASST allows to integrate multiple time steps simultaneously using a space–time hierarchy of spectral deferred correction sweeps. While many use cases and benchmarks exist, a solid and reliable mathematical foundation is still missing. Very recently, however, PFASST for linear problems has been identified as a multigrid method. In this paper, we will use this multigrid formulation and, in particular, PFASST's iteration matrix to show that, in the nonstiff and stiff limit, PFASST indeed is a convergent iterative method. We will provide upper bounds for the spectral radius of the iteration matrix and investigate how PFASST performs for increasing numbers of parallel time steps. Finally, we will demonstrate that the results obtained here indeed relate to actual PFASST runs.

Journal

Numerical Linear Algebra With ApplicationsWiley

Published: Dec 1, 2018

Keywords: ; ; ; ; ;

There are no references for this article.