Convergence analysis of multi-level spectral deferred corrections

Abstract

The spectral deferred correction (SDC) method is class of iterative solvers for ordinary differential equations (ODEs). It can be interpreted as a preconditioned Picard iteration for the collocation problem. The convergence of this method is well-known, for suitable problems it gains one order per iteration up to the order of the quadrature method of the collocation problem provided. This appealing feature enables an easy creation of flexible, high-order accurate methods for ODEs. A variation of SDC are multi-level spectral deferred corrections (MLSDC). Here, iterations are performed on a hierarchy of levels and an FAS correction term, as in nonlinear multigrid methods, couples solutions on different levels. While there are several numerical examples which show its capabilities and efficiency, a theoretical convergence proof is still missing. This paper addresses this issue. A proof of the convergence of MLSDC, including the determination of the convergence rate in the time-step size, will be given and the results of the theoretical analysis will be numerically demonstrated. It turns out that there are restrictions for the advantages of this method over SDC regarding the convergence rate.

arXiv comment42 pages, 4 figures

References in corpus (6)

• A multi-level spectral deferred correction method
• Spectral deferred corrections with fast-wave slow-wave splitting
• A high-order Boris integrator
• On the convergence of spectral deferred correction methods
• A Fourth-Order Adaptive Mesh Refinement Algorithm for the Multicomponent, Reacting Compressible Navier-Stokes Equations
• Multi-Level Spectral Deferred Corrections Scheme for the Shallow Water Equations on the Rotating Sphere

Cited by in corpus (2)

• Adaptive time step selection for Spectral Deferred Correction
• Spectral deferred correction methods for second-order problems