TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publication References
  4. Interweaving PFASST and Parallel Multigrid
 
Options

Interweaving PFASST and Parallel Multigrid

Publikationstyp
Conference Paper
Date Issued
2015
Author(s)
Minion, Michael  
Speck, Robert  
Bolten, Matthias  
Emmett, Matthew  
Ruprecht, Daniel  orcid-logo
TORE-URI
http://hdl.handle.net/11420/10524
Journal
SIAM journal on scientific computing  
Volume
37
Issue
5
Start Page
S244
End Page
SS263
Citation
SIAM Journal on Scientific Computing 37(5), S244-S263 (2015)
Publisher DOI
10.1137/14097536X
Scopus ID
2-s2.0-84928708654
ArXiv ID
1407.6486v2
Peer Reviewed
true
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 FAS multigrid method performed over multiple time-steps in parallel. However, since the original focus of PFASST has been 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 sub-step 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 sub-step 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.
Subjects
Multigrid
Parallel in time
PFASST
Mathematics - Numerical Analysis
Mathematics - Numerical Analysis
Computer Science - Distributed; Parallel; and Cluster Computing
Computer Science - Numerical Analysis
TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback