Volume 25, 2008Paris-sud working group on modelling and scientific computing 2007-2008
|Page(s)||114 - 129|
|Published online||16 January 2009|
Analysis of a Krylov subspace enhanced parareal algorithm for linear problems
Section de Mathématiques, University of Geneva, Switzerland
2 Laboratoire de Mathématiques, Université de Poitiers, France The Institute of Mathematics of the Romanian Academy, Bucharest, Romania
The parareal algorithm is a numerical method to integrate evolution problems on parallel computers. The performance of the algorithm is well understood for diffusive problems, and it can have spectacular performance when applied to certain non-linear problems. Its convergence properties are however less favorable for hyperbolic problems. We present and analyze in this paper a variant of the parareal algorithm, recently proposed in the PITA framework for systems of second order ordinary differential equations.
© EDP Sciences, ESAIM, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.