Proceedings Chapter
Reference
On the superlinear and linear convergence of the parareal algorithm
GANDER, Martin Jakob, VANDEWALLE, Stefan
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.
GANDER, Martin Jakob, VANDEWALLE, Stefan. On the superlinear and linear convergence of the parareal algorithm. In: Widlund, Olof B. and Keyes, David E. 16th International
Conference on Domain Decomposition Methods . Berlin : Springer, 2007. p. 291-298
DOI : 10.1007/978-3-540-34469-8_34
Available at:
http://archive-ouverte.unige.ch/unige:8272
Disclaimer: layout of this document may differ from the published version.
1 / 1
½
¾
!
"!#
$ %
&
! ' ! ! ( #)
" !
!!#
!#
!
""
" !
" "#
$""# #""!
$ "
#%$$"!
" # &'()* "
+, ,")"-"./-
0
-
! 1# 230' 4
430' "
" !
' " ""#'
""# """ #
4 ""'# !
! '
5672')-2* 8 +' " !
" ' " $
8 23:' ; 3: # "!
""' " " "" " !
!<
"=' ' " "
!""#1 ";!
#>>32 "#'477
>2 "!"
#?"!"8
""" $'
# "
9"" "#!
#""" #
"? " " ' "
/"70 $ "! !
" 820' !
"$" " +& "%
? " ""
""@$!&
"
/>2+8 +'
" " ";8"'
" (1$"'
" " !#' !"' !
"$"
##9?
AB C BCA
BC
D B
C
$ B
C BC "
B CA ' B
C""$!
B
C $
'
A E
$ # !
? "
A B
C'
A
'
A & ""
AB
CFB
CB
C B&C
4''""
#
A B
C ' $
! " """# !
1#'"" B&C
""G #
"
A BCA
B*C
A E
A A E
B
C
B CA
B
C
$
B C
B0C
/"'$' ;
B
C 4 "" $
" " # ' "
"
> "" $ "
' '
" #
#$"" B*C '
'
A ' #''
8# # #"#!
G$ G E
8 '
A
'
B+C
1;##''
A
E
B3C
A E
A A E
B
C
B CA
B
CA
$
B C
H
B
E
C $
B C
B:C
$
B C
BC
H
$
B C
B7C
> #
'
IA B C
>B&C"'
#
A
FB
C
AB
C
" $ # ""
"
AB
C
'"
AB
C
B2C
$ B+C5#" B2C'
B
C
BC
" B3C B:C B7C
"""'
H
B
E
C
H E
A BC
H
! " " B:C "!
# # E
( " #' # H
B:C(#'$"
$'"
# A A B
C
B CA
B
CA
B C
B C
BC
B C
BCFBC
B C
B&C
8 " ' B+C'
G8# #
A
A
JB2C' "
B
C
A
B
C
B*C
" ( " ' "
" '
' A
FB
C'"ABCFB
C'"B&C
! "
> " * "
9 ? > "
' 9 " (!
"' " ?' #
'
A
A B C
BC B0C
J("'? "#"!
#9?"('
K
A
K B+C
"""&*" "#
8"G? ";@'
""
!$
% A
B
C A
A
¾
# #
$
B C
H
B
E
C $
B C
B3C
#
A&*3*&777& # #
B C
B C
B:C
#
A&270&+3:+
1 ""
B:C ";@# '
¾
$
AE
IA&+&73&0:
B3C #-!-"#
""" B&C '
¾
¾
¾
$
AE
IA:2*&7&**'"
B:C-!-"#
4$'""
A
A B C
BC B7C
J(' ? "
K
AK B2C
"" & * " "# 8
"G"? ";@'
""
"# ! $
% A B
C A
A
# #
$
B C
H
B
E
C $
B C
B&C
#
A&&0*+*0&3
1 ""
B:C ";@# '
F
" B&C-!-"#
! %""B7C""
"BC #?#
# $ %
8 # " ' " $!
" B*C A' A' A
0 1 2 3 4 5 6 10 −15
10 −10 10 −5 10 0
Error at T Bound from Theorem 1 Superlinear bound Linear bound
0 2 4 6 8 10
10 −5 10 0 10 5
Error at T Bound from Theorem 1 Superlinear bound Linear bound
0 2 4 6 8 10
10 −5 10 0 10 5
Error at T Bound from Theorem 1 Superlinear bound Linear bound
. !506!
5";@" "$
$' E "#>
( "" A ' A A +'
E
A E A & " " D " "#
9 "" I A ' "
#' &?(
A'"" # ' ""
""(#' A+'
"" *?
4 " A'
" A' " A+' "
"
0 2 4 6 8
10 −15 10 −10 10 −5 10 0
Error at T Superlinear bound Linear bound
0 2 4 6 8
10 −6 10 −5 10 −4 10 −3 10 −2 10 −1 10 0
Error at T Superlinear bound Linear bound
7
½
¾
!56!5!6
> -,@"$
?
A
F B CB
# " A
BCF
"" B:C0' "
A
E
> A & E A
(&D' A0'
A& " 7D "
"#"5' ""
' " # 4
" G ' "
""D' A7'
"#""