# Spectral deferred corrections with fast-wave slow-wave splitting

@article{Ruprecht2016SpectralDC,
title={Spectral deferred corrections with fast-wave slow-wave splitting},
author={Daniel Ruprecht and Robert Speck},
journal={ArXiv},
year={2016},
volume={abs/1602.01626}
}
• Published 4 February 2016
• Physics
• ArXiv
The paper investigates a variant of semi-implicit spectral deferred corrections (SISDC) in which the stiff, fast dynamics correspond to fast propagating waves (fast-wave slow-wave problem''). We show that for a scalar test problem with two imaginary eigenvalues $i \lambda_{\text{f}}$, $i \lambda_{\text{s}}$, having $\Delta t ( | \lambda_{\text{f}} | + | \lambda_{\text{s}} | ) < 1$ is sufficient for the fast-wave slow-wave SDC (fwsw-SDC) iteration to converge and that in the limit of…
24 Citations

## Figures and Tables from this paper

On the convergence of spectral deferred correction methods
• Computer Science
Communications in Applied Mathematics and Computational Science
• 2019
This work analyzes the convergence properties of the Spectral Deferred Correction method and indicates that as long as difference between the current and previous iterate always gets multiplied by at least a constant multiple of the time step size, then high-order accuracy can be found even if the underlying "solver" is inconsistent the underlying ODE.
Stability Analysis and Error Estimates of Semi-implicit Spectral Deferred Correction Coupled with Local Discontinuous Galerkin Method for Linear Convection–Diffusion Equations
• Computer Science
J. Sci. Comput.
• 2018
In this paper, we focus on the theoretical analysis of the second and third order semi-implicit spectral deferred correction (SDC) time discretization with local discontinuous Galerkin (LDG) spatial
Parallelizing spectral deferred corrections across the method
• R. Speck
• Computer Science
Comput. Vis. Sci.
• 2018
Two strategies to enable “parallelization across the method” for spectral deferred corrections (SDC) are presented and the first aims at finding parallel preconditioners for the Picard iteration and the second diagonalizes the quadrature matrix of the collocation problem directly.
pySDC - Prototyping spectral deferred corrections
This paper presents the Python framework pySDC for solving collocation problems with spectral deferred correction methods (SDC) and their time-parallel variant PFASST, the parallel full approximation scheme in space and time, and describes the structure of the code by taking two different perspectives: the user and developer's perspective.
Asymptotic convergence of the parallel full approximation scheme in space and time for linear problems
• Computer Science
Numer. Linear Algebra Appl.
• 2018
This paper uses this multigrid formulation and PFASST's iteration matrix to show that, in the nonstiff and stiff limit,PFASST indeed is a convergent iterative method, and provides upper bounds for the spectral radius of the iteration matrix.
The Parallel Full Approximation Scheme in Space and Time for a Parabolic Finite Element Problem
• Computer Science
ArXiv
• 2021
This paper derives thePFASST algorithm with mass matrices and appropriate prolongation and restriction operators and shows numerically that PFASST can, after some initial iterations, gain two orders of accuracy per iteration.
Using Performance Analysis Tools for a Parallel-in-Time Integrator
• Computer Science
Springer Proceedings in Mathematics & Statistics
• 2021
The application of performance analysis tools to the PFASST implementation pySDC is demonstrated and it is hoped that the results and in particular the way they obtained are a blueprint for other time-parallel codes.
A unified analysis framework for iterative parallel-in-time algorithms
• Computer Science
ArXiv
• 2022
It is proved that all four Parareal, PFASST, MGRIT and STMG methods eventually converge super-linearly and compare them directly numerically.

## References

SHOWING 1-10 OF 54 REFERENCES
Implicit-Explicit Runge-Kutta Methods for Fast-Slow Wave Problems
• Computer Science
• 2013
AbstractLinear multistage (Runge–Kutta) implicit–explicit (IMEX) time integration schemes for the time integration of fast-wave–slow-wave problems for which the fast wave has low amplitude and need
Implicit–Explicit Multistep Methods for Fast-Wave–Slow-Wave Problems
• Computer Science
• 2012
Two new families of methods are proposed that have good stability properties in fast-wave–slow-wave problems and are superior, in many respects, to the linear multistep IMEX schemes currently in use.
A scale-selective multilevel method for long-wave linear acoustics
• Physics
• 2011
A new method for the numerical integration of the equations for one-dimensional linear acoustics with large time steps is presented. While it is capable of computing the “slaved” dynamics of
Generalized Split-Explicit Runge–Kutta Methods for the Compressible Euler Equations
• Computer Science
• 2014
Several new methods are developed and compared to the well-established three-stage low-storage Runge–Kutta method (RK3), which allow a 4 times larger macro step size but requires a smaller integration interval for the fast modes.
Spectral Deferred Correction Methods for Ordinary Differential Equations
• Mathematics
• 2000
We introduce a new class of methods for the Cauchy problem for ordinary differential equations (ODEs). We begin by converting the original ODE into the corresponding Picard equation and apply a
Linear Stability Analysis of Runge–Kutta-Based Partial Time-Splitting Schemes for the Euler Equations
This article presents a comprehensive numerical stability analysis of Runge–Kutta (RK)-based partial time-splitting schemes for the complete 2D Euler equations and their stabilization.
A multi-level spectral deferred correction method
• Computer Science
• 2015
This paper examines a variation of SDC for the temporal integration of PDEs called multi-level spectral deferred corrections (MLSDC), where sweeps are performed on a hierarchy of levels and an FAS correction term, as in nonlinear multigrid methods, couples solutions on different levels.