Adaptive time step selection for Spectral Deferred Correction
arXiv:2403.13454 · doi:10.1007/s11075-024-01964-z
Abstract
Spectral Deferred Correction (SDC) is an iterative method for the numerical solution of ordinary differential equations. It works by refining the numerical solution for an initial value problem by approximately solving differential equations for the error, and can be interpreted as a preconditioned fixed-point iteration for solving the fully implicit collocation problem. We adopt techniques from embedded Runge-Kutta Methods (RKM) to SDC in order to provide a mechanism for adaptive time step size selection and thus increase computational efficiency of SDC. We propose two SDC-specific estimates of the local error that are generic and do not rely on problem specific quantities. We demonstrate a gain in efficiency over standard SDC with fixed step size and compare efficiency favorably against state-of-the-art adaptive RKM.
29 pages including references, 10 figures. Submitted to Springer Numerical Algorithms
References in corpus (9)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Spectral deferred corrections with fast-wave slow-wave splitting
- On the convergence of spectral deferred correction methods
- Inexact spectral deferred corrections
- A unified analysis framework for iterative parallel-in-time algorithms
- Revisionist Integral Deferred Correction with Adaptive Stepsize Control
- Improving Efficiency of Parallel Across the Method Spectral Deferred Corrections
- Convergence analysis of multi-level spectral deferred corrections
- Efficient adaptivity for simulating cardiac electrophysiology with spectral deferred correction methods