% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Schbel:885633,
      author       = {Schöbel, Ruth and Speck, Robert},
      title        = {{PFASST}-{ER}: combining the parallel full approximation
                      scheme in space and time with parallelization across the
                      method},
      journal      = {Computing and visualization in science},
      volume       = {23},
      number       = {1-4},
      issn         = {1432-9360},
      address      = {Heidelberg},
      publisher    = {Springer},
      reportid     = {FZJ-2020-03974},
      pages        = {12},
      year         = {2020},
      abstract     = {To extend prevailing scaling limits when solving
                      time-dependent partial differential equations, the parallel
                      full approximation scheme in space and time (PFASST) has
                      been shown to be a promising parallel-in-time integrator.
                      Similar to space–time multigrid, PFASST is able to compute
                      multiple time-steps simultaneously and is therefore in
                      particular suitable for large-scale applications on high
                      performance computing systems. In this work we couple PFASST
                      with a parallel spectral deferred correction (SDC) method,
                      forming an unprecedented doubly time-parallel integrator.
                      While PFASST provides global, large-scale “parallelization
                      across the step”, the inner parallel SDC method allows
                      integrating each individual time-step “parallel across the
                      method” using a diagonalized local Quasi-Newton solver.
                      This new method, which we call “PFASST with Enhanced
                      concuRrency” (PFASST-ER), therefore exposes even more
                      temporal concurrency. For two challenging nonlinear
                      reaction-diffusion problems, we show that PFASST-ER works
                      more efficiently than the classical variants of PFASST and
                      can use more processors than time-steps.},
      cin          = {JSC},
      ddc          = {610},
      cid          = {I:(DE-Juel1)JSC-20090406},
      pnm          = {511 - Computational Science and Mathematical Methods
                      (POF3-511) / DFG project 450829162 - Raum-Zeit-parallele
                      Simulation multimodale Energiesystemen (450829162) / PhD no
                      Grant - Doktorand ohne besondere Förderung
                      (PHD-NO-GRANT-20170405)},
      pid          = {G:(DE-HGF)POF3-511 / G:(GEPRIS)450829162 /
                      G:(DE-Juel1)PHD-NO-GRANT-20170405},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000572641700001},
      doi          = {10.1007/s00791-020-00330-5},
      url          = {https://juser.fz-juelich.de/record/885633},
}