% 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”.
@INPROCEEDINGS{Baumann:1041740,
author = {Baumann, Thomas},
title = {{S}pectral {D}eferred {C}orrection},
reportid = {FZJ-2025-02416},
year = {2025},
abstract = {Spectral deferred correction (SDC) is a time integration
method that is closely related to Runge-Kutta methods (RKM).
In SDC, fully implicit RKM are solved iteratively, using
similar computations as required to compute the stages in
RKM. While explicit SDC often cannot compete with explicit
RKM, SDC has been shown to perform very well for stiff PDEs.
One major advantage of SDC is the flexibility afforded by
using a low-order solver inside an iterative method for
obtaining high-order solutions. This makes it simple to
construct high-order splitting methods, for instance. SDC is
also popular in the parallel-in-time community. Efficient
small-scale parallelism within the method has recently been
achieved and SDC is also employed within various
parallel-in-time algorithms. This talk will encompass an
introduction to SDC, some recent developments, numerical
experiments where time-parallel SDC is preferable to RKM,
and an advertisement for the prototyping library pySDC,
which allows to rapidly explore all things SDC.},
organization = {Numerical algorithms seminar at
University of Exeter, Exeter (UK)},
subtyp = {Invited},
cin = {JSC},
cid = {I:(DE-Juel1)JSC-20090406},
pnm = {5112 - Cross-Domain Algorithms, Tools, Methods Labs (ATMLs)
and Research Groups (POF4-511) / TIME-X - TIME
parallelisation: for eXascale computing and beyond (955701)},
pid = {G:(DE-HGF)POF4-5112 / G:(EU-Grant)955701},
typ = {PUB:(DE-HGF)31},
doi = {10.34734/FZJ-2025-02416},
url = {https://juser.fz-juelich.de/record/1041740},
}