On the Superlinear and Linear Convergence of the Parareal Algorithm
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.
KeywordsToeplitz Operator Euler Method Absolute Stability Bound Time Interval Superlinear Convergence
Unable to display preview. Download preview PDF.
- 4.M. J. Gander and S. Vandewalle, Analysis of the parareal time-parallel time-integration method, Technical Report TW 443, K.U. Leuven, Department of Computer Science, November 2005.Google Scholar
- 5.W. Hackbusch, Parabolic multi-grid methods, in Computing Methods in Applied Sciences and Engineering, VI, R. Glowinski and J.-L. Lions, eds., North- Holland, 1984, pp. 189–197.Google Scholar
- 7.R. Kornhuber, R. H. W. Hoppe, J. Péeriaux, O. Pironneau, O. B. Widlund, and J. Xu, eds., Proceedings of the 15th international domain decomposition conference, Springer LNCSE, 2003.Google Scholar