A Convergence Theorem for the Parareal Algorithm Revisited

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Scheiber, Ernest
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866916242850316288
author Scheiber, Ernest
author_facet Scheiber, Ernest
contents The subject of the paper is to verify the convergence conditions for the parareal algorithm using Gander and Hairer's theorem . The analysis is conducted in the case where the coarse integrator is the Euler method and the high-accuracy integrator is an explicit Runge-Kutta type method.
format Preprint
id arxiv_https___arxiv_org_abs_2405_06954
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A Convergence Theorem for the Parareal Algorithm Revisited
Scheiber, Ernest
Numerical Analysis
65M22, 65L05
The subject of the paper is to verify the convergence conditions for the parareal algorithm using Gander and Hairer's theorem . The analysis is conducted in the case where the coarse integrator is the Euler method and the high-accuracy integrator is an explicit Runge-Kutta type method.
title A Convergence Theorem for the Parareal Algorithm Revisited
topic Numerical Analysis
65M22, 65L05
url https://arxiv.org/abs/2405.06954