Proceedings chapter
OA Policy
English

On the superlinear and linear convergence of the parareal algorithm

Published in

Widlund, Olof B. and Keyes, David E. (Ed.), 16th International Conference on Domain Decomposition Methods, p. 291-298

Publisher

Berlin : Springer

Collection

  • Lecture Notes in Computational Science and Engineering; 55

Publication date

2007

Abstract

The parareal algorithm is a method to solve time dependent problems parallel in time: it approximates parts of the solution later in time simultaneously to parts of the solution earlier in time. In this paper the relation of the parareal algorithm to space-time multigrid and multiple shooting methods is first briefly discussed. The focus of the paper is on some new convergence results that show superlinear convergence of the algorithm when used on bounded time intervals, and linear convergence for unbounded intervals.

Citation (ISO format)

GANDER, Martin Jakob, VANDEWALLE, Stefan. On the superlinear and linear convergence of the parareal algorithm. In: 16th International Conference on Domain Decomposition Methods. Widlund, Olof B. and Keyes, David E. (Ed.). Berlin : Springer, 2007. p. 291–298. (Lecture Notes in Computational Science and Engineering) doi: 10.1007/978-3-540-34469-8_34

Main files (1)

Proceedings chapter (Published version)

Identifiers

Additional URL for this publication

http://www.ddm.org/conferences.html

ISBN

978-3-540-34469-8
678views
544downloads

Technical informations

Creation

21/06/2010 15:08:49

First validation

21/06/2010 15:08:49

Update

14/03/2023 15:48:48

Status update

14/03/2023 15:48:48

Last indexation

29/10/2024 15:36:42
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated