Analysis of a Krylov subspace enhanced parareal algorithm for linear problems

  • Gander M
  • Petcu M
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Gander, M., & Petcu, M. (2008). Analysis of a Krylov subspace enhanced parareal algorithm for linear problems. ESAIM: Proceedings, 25, 114–129. https://doi.org/10.1051/proc:082508

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free