Parallelizing spectral deferred corrections across the method

Speck, Robert

doi:10.1007/s00791-018-0298-x

Journal Article

FZJ-2018-03898

Parallelizing spectral deferred corrections across the method

Speck, R. (Corresponding author)FZJ*

2018
Springer Berlin

Computing and visualization in science 19(3-4), 75-83 (2018) [10.1007/s00791-018-0298-x]

This record in other databases:

Please use a persistent id in citations: http://hdl.handle.net/2128/19505 doi:10.1007/s00791-018-0298-x

Abstract: In this paper we present two strategies to enable “parallelization across the method” for spectral deferred corrections (SDC). Using standard low-order time-stepping methods in an iterative fashion, SDC can be seen as preconditioned Picard iteration for the collocation problem. Typically, a serial Gauß–Seidel-like preconditioner is used, computing updates for each collocation node one by one. The goal of this paper is to show how this process can be parallelized, so that all collocation nodes are updated simultaneously. The first strategy aims at finding parallel preconditioners for the Picard iteration and we test three choices using four different test problems. For the second strategy we diagonalize the quadrature matrix of the collocation problem directly. In order to integrate non-linear problems we employ simplified and inexact Newton methods. Here, we estimate the speed of convergence depending on the time-step size and verify our results using a non-linear diffusion problem.

Classification: