Journal of Computational and Applied Mathematics 130 (2001) 231–244
www.elsevier.nl/locate/cam
A secondorder parameteruniform overlapping Schwarz method for reaction–di usion problems with boundary layers
H. MacMullen ^{a}^{;} ^{∗} , J.J.H. Miller ^{b} , E. O’Riordan ^{a} , G.I. Shishkin ^{c}
^{a} School of Mathematical Sciences, Dublin City University, Dublin, Ireland ^{b} Department of Mathematics, Trinity College, Dublin, Ireland ^{c} Institute for Mathematics and Mechanics, Russian Academy of Sciences, Ekaterinburg, Russia
Received 2 August 1999; received in revised form 9 November 1999
Abstract
The problem of constructing a parameteruniform numerical method for a singularly perturbed selfadjoint ordinary
di erential equation is considered. It is shown that a suitably designed discrete Schwarz method, based on a standard
nite di erence operator with a uniform mesh on each subdomain, gives numerical approximations which converge in the maximum norm to the exact solution, uniformly with respect to the singular perturbation parameter. This parameteruniform convergence is shown to be essentially second order. That this new discrete Schwarz method is e cient in practice is
demonstrated by numerical experiments. c
2001 Elsevier Science B.V. All rights reserved.
Keywords: Singularly perturbed; Reaction–di usion; Schwarz; Parameteruniform
1. Introduction
On = (0; 1), we consider the following class of singularly perturbed reaction–di usion problems:
L _{} u _{} (x) ≡ − u (x) + b(x)u _{} (x) = f(x);
u _{} (0) = A;
b(x) ¿ ¿ 0
u _{} (1) = B;
for all x ∈ ;
x ∈ ; 
(1a) 
(1b) 

(1c) 
where the functions satisfy b; f ∈ C ^{2} ( ) and the singular perturbation parameter satis es 0 ¡ 61. For a singular perturbation problem of form (1), an appropriate norm for studying the convergence of numerical solutions to its exact solution is the maximum norm, which is de ned by
_{} = max
x∈

(x):
^{∗} Corresponding author.
03770427/01/$  see front matter c PII: S 03770427(99)003805
2001 Elsevier Science B.V. All rights reserved.
232 H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
The associated seminorms, de ned for each integer k¿0, are

 _{k} =
^{(}^{k}^{)} :
Here we are interested in constructing an –uniform numerical method for this problem. By an  or parameteruniform method, we mean a numerical method that generates numerical solutions {U satisfying an uniform error estimate of the form
}
N
sup
0¡ 61
U ^{N} − u _{} _{} 6CN ^{−}^{p} ;
p¿ 0;
(2)
where C; p are constants independent of and N , and
numerical solution U
U ^{N} is the piecewise linear interpolant of the
N . From (2), we see that we want to construct approximations that are de ned
at each point of the domain
in the de nition of the norm the maximum is taken over the whole of . It is well known that classical numerical methods applied to singularly perturbed problems are not uniform [3]. Therefore, various nonclassical approaches are used to design robust uniform numerical methods for such problems. Such approaches can be either iterative or noniterative. With a noniterative approach it is necessary [3] to use a nonstandard nite di erence operator (or a set of nonpolynomial basis functions in a nite element framework) and=or a specially distributed set of mesh or nodal points. On the other hand, with an iterative approach we can use standard Schwarz methods with overlapping subdomains (see, for example, [14] and the references therein), which in principle, permit the use of a di erent numerical method in each subdomain. This means that Schwarz methods can be adapted locally to any singularity in the solution that arises in a speci c subdomain. A further advantage of such methods is that at each stage of the solution process it may be possible to avoid the use of a nonuniform mesh. In the context of noniterative methods, parameteruniform nite element methods with special exponential basis functions were examined for onedimensional problems in [13], but the extension of these methods to partial di erential equations is di cult. Sun and Stynes [16] showed that nite element methods based on standard piecewise polynomial basis functions and a piecewiseuniform tted meshes are parameteruniform in various norms for similar problems in one dimension. Finite di erence methods, consisting of a centred nite di erence operator on a piecewiseuniform tted mesh, were also applied successfully to such problems (see, e.g. [10,11]) and extensions to higher dimensions were given in [15]. In the context of iterative methods, Garbey [6] and Garbey and Kaper [7] examined discrete Schwarz methods for singularly perturbed problems. In their methods the number of mesh points N is inversely proportional to the size of the singular perturbation parameter , which implies that these methods are not uniform. Boglaev and Sirotkin [1] and Farrell et al. [4] examined Schwarz methods for singularly perturbed semilinear analogues of problem (1), using a complicated tted nite di erence operator with special nonuniform meshes on the subdomains. In their methods strong restrictions on the distribution of the nodes are imposed that do not permit the use of a uniform mesh in each subdomain. Both Mathew [9] and Nataf and Rogier [12] examined the theoretical convergence properties of continuous, but not discrete, Schwarz methods for singularly perturbed problems. MacMullen et al. [8] showed by numerical experiments that for a onedimensional singu larly perturbed convection–di usion problem, for which the continuous Schwarz method is known to be parameteruniform, the corresponding discrete Schwarz method (using uniform meshes in each
, and not simply at the nite set of mesh points. We note also that
H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
233
subdomain) is not parameteruniform. Boglaev [2] examined a nonoverlapping Schwarz method for a timedependent singularly perturbed analogue of problem (1), using a standard nite di erence op erator on a special piecewiseuniform mesh. However, this method is not uniform, as the restriction N 61 is imposed on the method. In the present paper, a discrete Schwarz method based on a standard nite di erence operator with a uniform mesh in each subdomain is constructed and shown to be uniform for problem (1). This method is similar to the one proposed in Shishkin [15], where various theoretical results were announced. However, no detailed proofs, no consideration of numerical results and no iteration counts were provided in [15]. In the present paper, a detailed proof of the parameteruniform convergence of the method is given and numerical results validating this theoretical result are presented. Iteration counts for the method are presented and their dependence on is also discussed. An outline of the rest of the paper is as follows. In Section 2, the solution is decomposed into smooth and singular components. Parameter explicit bounds on the derivatives of these components are given. In Section 3, the continuous Schwarz method is introduced and error bounds are given. In Section 4, the discrete Schwarz method is described and bounds on the di erence between the discrete Schwarz iterates and the continuous solution are derived. This leads to the main theoretical result of the paper: a parameteruniform error estimate in the maximum norm of the discrete Schwarz iterates. In Section 5 results of a series of numerical experiments are presented which demonstrate the theoretical estimates derived in the earlier sections.
Notation. Throughout this paper, the letter C denotes a generic constant that is independent of
the singular perturbation parameter , the discretization parameter N counter k.
and the Schwarz iteration
2. The continuous problem
The reduced problem corresponding to (1) is the problem b(x)v _{0} (x)= f(x) whose solution v _{0} (x)= f(x)=b(x) cannot be made to satisfy arbitrary preassigned boundary conditions at the boundary points {0; 1} of . Thus, in general, u _{} exhibits boundary layer behaviour at these points, the width of the
boundary layers being 0( ^{√} ) (see, for example, [3] or [10]). It is well known that L _{} satis es the following
(x)¿0 for
all x ∈ (a; b) implies that
Comparison principle: Let a; b ∈ and assume that
(x)¿0 for all x ∈ [a; b] ⊂ .
(a)¿0 and
(b)¿0. Then L _{}
The uniqueness and stability of the solution u _{} of (1) are immediate consequences of this com parison principle. We state without proof the following lemma which gives classical explicit bounds on the deriva tives of the solution of problems in a problem class containing problem (1). A proof of this lemma is given in [10].
Lemma 1. Let 
_{} be the solution of the problem 
L _{} _{} = f; 
x ∈ (a; b) ⊂ ; 
234 H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
where
_{} (a); _{} (b) are given and  _{} (a); _{} (b)6C. Then; for all k; 06k64;
(k)

(x)6C(1 + ^{−}^{k}^{=}^{2} (e ^{−}^{(}^{x}^{−}^{a}^{)} √ ^{} ^{=} ^{} + e ^{−}^{(}^{b}^{−}^{x}^{)} √ ^{} ^{=} ^{} ));
x ∈ [a; b];
where C is a constant independent of .
In what follows, we make extensive use of the following decomposition of the solution u _{} . We write u _{} = v _{} + w _{‘} + w _{r} where the smooth component v _{} and singular components w _{‘} ;w _{r} are de ned to be the solutions of the problems
L _{} v _{} = f;
L _{} w _{‘} = 0;
L _{} w _{r} = 0;
v _{} (0) = f(0)=b(0);
w _{‘} (0) = u _{} (0) − v _{} (0);
w _{r} (0) = 0;
v _{} (1) = f(1)=b(1);
w _{‘} (1) = 0;
w _{r} (1) = u _{} (1) − v _{} (1):
This decomposition enables us to establish nonclassical sharper explicit bounds on the derivatives of the solution of (1). These are contained in the following.
Lemma 2 (Miller et al. [11]). The solution u _{} of (1) can be written in the form
u _{} = v _{} + w _{‘} + w _{r} ;
where; for all k; 06k64;
v _{}  _{k} 6C(1 + ^{1}^{−}^{k}^{=}^{2} ) and for all x ∈ ,
w
‘ (k) (x)6C ^{−}^{k}^{=}^{2} e ^{−}^{x} √ ^{} ^{=} ^{} ;
w
(k) _{(}_{x}_{)}_{}_{6}_{C} _{} −k=2 _{e} −(1−x) ^{√} = _{;}
r
where C is a constant independent of .
3. Continuous Schwarz method
We now describe a continuous Schwarz method for (1), which is an iterative process generating
[k] , which converge as k → ∞ to the exact solution u _{} . First, we introduce
a sequence of iterates u
three overlapping subdomains of :
_{c} = ( ; 1 − );
_{l} = (0; 2 );
_{r} = (1 − 2 ; 1);
where the subdomain parameter is an appropriate constant, speci ed in Section 4, which satis es
0 ¡ 60:25:
Then for each integer k¿0, the Schwarz iterates u
[0] (x) ≡ 0;
u
and for all k¿1,
[k]
u
= ^{u}
u
[k]
c
[k]
i
0 ¡x¡ 1;
in _{c} ;
in _{i} \ _{c} ;
u
[0]
i = l; r;
(0) = u _{} (0);
[k] are then de ned as follows. For k = 0 we put
u
[0]
(1) = u _{} (1)
H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
where the u
[k]
i
L u
[k]
i
=
and
L u
[k]
c
=
are the solutions of the problems
f
f
in
_{i} ;
in _{c} ;
u
[k] = u
i
[k−1]
on @ _{i} ;
u
[k]
c
(
) = u ^{[}^{k}^{]} ( );
l
i = l; r
u
[k]
c
(1 − ) = u
[k]
r
(1 − ):
235
The parameteruniform convergence of these Schwarz iterates to u _{} is established in the following lemma. This is a wellknown result (see, for example, [4,10,9].
Lemma 3. For all k¿1
u
[k]
−
u _{} _{} 6Cq ^{k} ;
where C is a constant independent of k and and
_{q} _{=} _{e} − ^{√} = _{¡} _{1}_{:}
4. Discrete Schwarz method
The discrete Schwarz method is obtained from the continuous Schwarz method by using a uniform mesh ^{N} ; i = c; l; r on each subdomain _{i} and replacing the di erential operator L _{} by the standard centred nite di erence operator L ^{N} . For any mesh function Z, on a uniform mesh with N subintervals L ^{N} is given by
^{2} Z _{i} = N ^{2} (Z _{i}_{+}_{1} − 2Z _{i} + Z _{i}_{−}_{1} ):
N ; we
de ne the piecewise linear interpolant
For each j; 06j62, at each point of _{j} associated with any mesh function Z de ned on
i
L ^{N} Z _{i} = − ^{2} Z _{i} + b(x _{i} )Z _{i} ;
j
Z j .
Then the sequence of discrete Schwarz iterates
0 ¡x¡ 1;
U
U
[0]
(x) ≡ 0;
[0]
U
(0) = u _{} (0);
[k]
is de ned by
[0]
U
(1) = u _{} (1):
For k¿1 the iterates
U
[k]
are de ned by
[k]
U
=

[k] 

U
U 
c in _{c} ; [k] i i = l; r; in _{i} \ _{c} ; 
where the
L ^{N} U
i
U
[k]
[k]
L ^{N} U
c
[k]
i are the solutions of the problems
= f
= f
in ^{N} ;
i
in ^{N} ;
c
U
i
[k]
[k]
U
c
= U
[k−1]
(
) =
U [k]
l
(
on @ ^{N} ;
i
i = l; r;
);
[k]
U
c
(1 − ) = U
[k]
r
(1 − );
and
U is the linear interpolant of U .
Note that the centred nite di erence operator L ^{N}
satis es the following discrete comparison
N
j
principle in
;
j = l; c; r.
Discrete comparison principle: Assume that _{0} ¿0 and _{N} ¿0. Then L ^{N} _{i} ¿0 for all x _{i} ∈
N
; j = l; c; r; implies that _{i} ¿0 for all x _{i} ∈ ; j = l; c; r.
N
j
j
236 H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
An immediate consequence of this is the following parameteruniform stability result for L ^{N} . Let Z _{i} be any mesh function on ; j = l; c; r. Then for all i; 06i6N ,
N
j
Z _{i} 6(1= )
16j6N−1 ^{}^{L} N
max
Z _{j}  + max{Z _{0} ;Z _{N} }:
In order that the convergence properties of the discrete Schwarz method are parameteruniform, we take the subdomain parameter to be
(3)
The discrete Schwarz iterates are now decomposed in an analogous way to u _{} . Thus we write
= min{ _{4} ; 2 = ln N }:
1
[k]
U
[k]
= V
+
[k]
W
‘
+
[k]
W
r
:
Each term of U
[k] in the sequence of discrete Schwarz approximations is decomposed as follows:
U
[k]
=
V
[k]
+
W
[k]
‘
+
W
[k]
r
=
V
V
[k]
c
[k]
i
+
+
W
W
[k]
‘; c ^{+}
[k]
‘;i ^{+}
W
W
[k]
r;
[k]
r;i
_{c}
in _{c} ;
in _{i} \ _{c} ;
i = l; r;
where
L ^{N} V
i
[k]
[k]
L ^{N} V
c
= f
= f
in ^{N} ;
i
in ^{N} ;
c
V
i
[k]
[k]
V
c
= V
[k−1]
(
) =
V [k]
l
(
on @ ^{N} ;
i
i = l; r;
);
[k]
V
c
(1 − ) = V
[k]
r
(1 − );
and for W _{‘}
[k]
‘;i
[k]
‘; c
L ^{N} W
L ^{N} W
=
=
0
0
in
in
^{N} ;
i
^{N} ;
c
[k]
‘;i
[k]
‘; c
W
W
W
[k−1]
‘
=
on
_{l} ( );
(
) = W
[k]
‘;
@ ^{N} ; i = l; r;
i
[k]
‘; c
W
(1 − ) = W
[k]
‘;
_{r} (1 − );
and for W _{r}
L ^{N} W
[k]
r;i
=
= 0
0
in ^{N} ;
i
in ^{N} ;
c
[k]
W
r;i
[k]
W
r; c
W
[k−1]
r
=
(
The sequences are started by taking
[k]
L ^{N} W
r; c
) = W
[k]
r; l
(
on
);
@ _{i} ; i = l; r;
[k]
W
r; c
(1 − ) = W
[k]
r;
_{r} (1 − ):
V
W
W
[0]
[0]
‘
[0]
r
(x) 
≡ 0; 
0 ¡x¡ 1; 
(x) 
≡ 0; 
0 ¡x¡ 1; 
(x) 
≡ 0; 
0 ¡x¡ 1; 
[0]
V
(0) = V _{} (0);
[0]
W
‘
[0]
W
r
(0) = W _{‘} (0);
(0) = 0;
[0]
V
(1) = V _{} (1);
[0]
W
r
(1) = 0;
(1) = W _{r} (1):
[0]
W
‘
In the following two lemmas parameteruniform error estimates of the iterates are established. The rst lemma concerns the smooth components.
Lemma 4. Let v _{} and
be chosen as in (3). Then; for all k¿1,
V ^{[}^{k}^{]} denote the regular components of u _{} and U ^{[}^{k}^{]} ; respectively; and let
v _{} − V
[k]
_{} 6CN ^{−}^{2} + C2 ^{−}^{k} ;
where C is a constant independent of k; N and .
H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
[1]
Proof. Note that (v _{} − V
l
[1]
)(0) = 0 and (v _{} − V
l
)(2 ) = v _{} (2 )6C _{0} . For x _{i} ∈ ^{N}
l
[1]
L ^{N} (v _{} − V
l
)(x _{i} ) = (L ^{N} −
6 C _{1} N ^{−}^{2} :
L _{} )(v _{} (x _{i} ))6C (2 ) ^{2} N ^{−}^{2} v _{}  _{4}
,
237
Here we have used the following standard local truncation error estimate for z ∈ C ^{4} (x _{i}_{−}_{1} ;x _{i} ) and x _{i}_{+}_{1} − x _{i} = x _{i} − x _{i}_{−}_{1} = CN ^{−}^{1} , then
 ^{2} z − z ^{}^{} 6(CN ) ^{−}^{2} z _{4}_{;}_{(}_{x} _{i}_{−}_{1} _{;}_{x} _{i}_{+}_{1} _{)}
and Lemma 2. Consider the two mesh functions
C 0 x i
+ ^{C} ^{1} N ^{−}^{2} ± (v _{} − V
[1]
l
2
)(x _{i} ):
Then, from the discrete minimum principle, we get, for all x _{i} ∈ ^{N}
l
[1]
l
)(x _{i} )6 ^{C} ^{0} ^{x} ^{i} + ^{C} ^{1}
(v _{} − V
2
Likewise, for all x _{i} ∈ r ^{N} ,
_{N}
−2 _{:}
[1]
(v _{} − V
r
)(x _{i} )6 ^{C} ^{0} ^{(}^{1} ^{−} ^{x} ^{i} ^{)} + ^{C} ^{1}
2
_{N}
−2 _{:}
For all x _{i} ∈ ^{N} , we obtain
c
[1]
L ^{N} (v _{} − V
c
)(x _{i} ) = (L ^{N} − L _{} )(v _{} (x _{i} ))6C N ^{−}^{2} v _{}  _{4} 6C _{1} N ^{−}^{2} ;
,
with
and
Hence
[1]
(v _{} − V
c
[1]
(v _{} − V
c
[1]
)( ) = (v _{} − V
l
)( )6 ^{C} ^{0} + C _{1} N ^{−}^{2}
2
[1]
)(1 − ) = (v _{} − V
r
)(1 − )6 ^{C} ^{0} + C _{1} N ^{−}^{2} :
2
[1]
(v _{} − V
c
)(x _{i} )6C _{1} N ^{−}^{2} + ^{C} ^{0} ;
2
x _{i} ∈ c ^{N} :
[2]
Consider now the second iteration. Observe that (v _{} −V For x _{i} ∈ ^{N}
l
l
[2]
L ^{N} (v _{} − V
l
)(x _{i} )6C _{1} N ^{−}^{2} :
[2]
)(0)=0 and (v _{} −V
l
Consider the two mesh functions
^{} C 0
2
^{+} C 1
x
i
2
[2]
N ^{−}^{2} ± (v _{} − V
l
)(x _{i} ):
Then, from the discrete minimum principle, we get, for all x _{i} ∈ ^{N}
l
[2]
(v _{} − V
l
)(x _{i} )6 ^{C} ^{0}
2
^{+} C 1
x
i
2
_{N} −2
,
)(2 )6C _{1} N ^{−}^{2} +C _{0} ==2.
238 H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
and for all x _{i} ∈ r ^{N} ,
[2]
(v _{} − V
r
Hence,
[2]
(v _{} − V
c
)(x _{i} )6 ^{C} ^{0} 2 
^{} (1 − x _{i} ) 

2
^{C} 0 
+ ^{C} ^{1} 

)( )6 ^{C} ^{1} 
_{N} 
−2 _{+} 
4 
and 
and thus
_{N}
−2 _{:}
[2]
(v _{} − V
c
) (1 − )6 ^{C} ^{1}
_{N} −2 _{+} ^{C} 0
4
[2]
c
)(x _{i} )6 ^{C} ^{1}
_{N} −2 _{+} ^{C} 0
;
(v _{} − V
x _{i} ∈ c ^{N} :
We now use the standard interpolation error estimate for linear interpolation. That is, if z ∈ C ^{2} (x _{i}_{−}_{1} ;x _{i} ) and z is the linear interpolant then
4
z − z ∞;(x _{i}_{−}_{1} ;x _{i} ) 6C(x i − x i−1 ) ^{2} z ^{}^{} ∞;(x _{i}_{−}_{1} ;x _{i} )
which leads to
v _{} −
V [k]
l
_{} _{l} 6
6
V [k]
l
V [k]
l
− v _{} + v _{} − v _{}
−
v _{} + CN ^{−}^{2} (2 ) ^{2} v _{}  _{2}
6
C _{0} 2 ^{−}^{k} + ^{C} ^{1} N ^{−}^{2} + C _{2} N ^{−}^{2} :
This completes the proof.
The next lemma gives error estimates for the singular components.
Lemma 5. Let w _{‘} ; w _{r} and W
; and let be chosen as in (3). Then; for all k¿1 we have
[k]
‘
W
[k]
r
denote the singular components of u _{} and U ^{[}^{k}^{]} ; respectively;
(ii) w _{r} − W
[k]
r
_{} 6C(N ^{−}^{1} ln N ) ^{2} + C2 ^{−}^{k} ;
(i)
w _{‘} − W
where C is a constant independent of k; N and .
[k]
‘
_{} 6C(N ^{−}^{1} ln N ) ^{2} + C2 ^{−}^{k} ;
Proof. We give the proof of (i); the proof of (ii) is analogous. Consider rst the case when ¡ For x _{i} ∈ ^{N}
l
,
[1]
L ^{N} (w _{‘} − W _{‘} )(x _{i} ) = (L ^{N} − L _{} )(w _{‘} (x _{i} ))6C (2 ) ^{2} N ^{−}^{2} w _{l}  _{4}
‘;
6 C(2 ) ^{2} N ^{−}^{2} ^{−}^{1} 6C(N ^{−}^{1}
ln N ) ^{2} :
Hence, by the discrete minimum principle,
w _{‘} − W
‘; ‘ ^{} ^{N}
l
[1]
Therefore
6C(N ^{−}^{1} ln N ) ^{2} :
w _{‘} − W
Likewise
[1]
‘; ‘ ^{}
_{} _{‘} 6C(N ^{−}^{1} ln N ) ^{2} + CN ^{−}^{2} (2 ) ^{2} w _{‘}  _{2} 6C(N ^{−}^{1} ln N ) ^{2} :
w _{‘} − W
[1]
‘; r ^{} ^{}
_{} _{r} 6C(N ^{−}^{1} ln N ) ^{2} :
1
4 ^{.}
H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
239
Note that
[1]
‘; c
L ^{N} (W
)=0;
on c ^{N} ;
_{}_{W} [1]
‘; c
_{}_{W} [1]
‘; c
(
(1 − ) =  W
) =  W
[1]
_{l} ( )6w _{‘} ( ) + C(N ^{−}^{1} ln N ) ^{2} ;
‘;
[1]
‘;
_{r} (1 − )6w _{‘} (1 − ) + C(N ^{−}^{1} ln N ) ^{2} ;
and we conclude that
Hence
W
[1]

‘; c ^{N}
c
6C(N ^{−}^{1} ln N ) ^{2} :
w _{‘} − W
[1]
‘; c ^{}
_{} _{c} 6 w _{‘} − w
_{} _{c} + C(N ^{−}^{1} ln N ) ^{2} :
‘
Note that for any function z we have
z − z  _{(}_{x} _{i}_{−}_{1} _{;}_{x} _{i} _{)} =
6
i−1 z ^{} (t)dt − i−1 z ^{} (t)dt (x − x _{i}_{−}_{1} )=(x _{i} − x _{i}_{−}_{1} )
x
x
x
i
x
i−1
z ^{} (t)dt
^{;}
x
x
i
and so, using Lemma 2, we have
w _{‘} − w
‘ (x _{i}_{−}_{1} ;x _{i} ) 6
x
x
i
i−1
w _{‘} (t)dt
_{6}_{e} −x _{i}_{−}_{1} ^{√} =
6 e ^{−} ^{} √ ^{} ^{=} ^{} 6C(N ^{−}^{1} ln N ) ^{2}
for x _{i}_{−}_{1} ¿ :
We conclude that
w _{‘} − W
[1]
‘; c ^{} ^{}
_{} _{c} 6C(N ^{−}^{1} ln N ) ^{2} :
1
The proof is completed by an induction argument. For the case of = _{4} , use the argument in the previous lemma and note that ^{2} = 6C( ln N ) ^{2} .
Combining this with Lemma 3 immediately yields the main theoretical result of the paper, which is contained in
Theorem 1. Let u _{} be the solution of problem (1) and let { U iterates with chosen as in (3). Then; for all k¿1
u _{} − U
[k]
_{} 6C(N ^{−}^{1} ln N ) ^{2} + C2 ^{−}^{k} ;
where C is a constant independent of k; N and .
5. Numerical results
[k] } be the set of discrete Schwarz
Numerical results are presented in this section, which con rm the theoretical estimates established in the previous section. The discrete Schwarz method described in Section 4 is applied to two
240 H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
problems from problem class (1). For notational reasons, it is helpful to introduce the piecewise
uniform mesh ^{N}
(4)
For both examples, the stopping criterion for the Schwarz iterations is taken to be
associated with the overlapping subdomains by
^{N} ≡
^{N} ∪ ( ^{N} _{c} ) ∪ ( ^{N} _{c} ):
c
l
\
r
\
max
x _{i} ∈ ^{N}
[k]
U
(x _{i} ) − U
[k−1]
(x _{i} )610 ^{−}^{8} :
Our rst problem is the constant coe cient problem
− u (x) + u _{} (x)=0;
x ∈ ;
(5a)
(5b)
Its exact solution in closed form is easy to nd, which means that the exact pointwise errors can be calculated. The discrete Schwarz iterates are computed on a sequence of meshes with N = 8; 16;:::; 1024 for = 2 ^{−}^{2}^{p} , p = 0; 1; 2;:::; 29. Estimates of the global error
u _{} (0) = u _{} (1) = 1:
U ^{N} − u _{}
are obtained by evaluating
E
N ; global ^{=} x ^{m}^{a}^{x} _{i} ∈ ^{∗}
 U ^{N} (x _{i} ) − u _{} (x _{i} );
where ^{∗} =
∗
l
∪ ∪
∗
c
∗
r
and
= {x _{i} x _{i} = 1 − + i =4096; 06i64096}:
l = {x _{i} x _{i} = i =4096; 06i64096};
∗
∗
c
∗
r
= {x _{i} x _{i} = + i(1 − 2 )=4096; 06i64096};
Note that ^{∗} depends on , but not on N . Estimates of the parameteruniform global pointwise error are obtained from
E
N
global ^{=} ^{m}^{a}^{x}
E ^{N}
; global
and estimates of the parameteruniform order of convergence are computed for each N from
p
^{N}
global ^{=} ^{l}^{o}^{g} _{2} E
N
global
E
2N
global
:
The values of E
given in Table 1. In this and all subsequent tables, the dots indicate that the intermediate computed
values are essentially the same as the given values. It is clear from Table 1 that this method is parameteruniform for problem (5). The computed doublemesh order of convergence corresponding to an asymptotic convergence rate is (N ^{−}^{1} ln N ) ^{2} is
N
; global ^{;}^{E} global ^{a}^{n}^{d} ^{p} ^{N}
N
_{g}_{l}_{o}_{b}_{a}_{l} for the discrete Schwarz method applied to problem (5) are
p
^{N} asym ^{=} ^{l}^{o}^{g} _{2}
(N ^{−}^{1} ln N )
_{(}_{2}_{N} _{)}_{)} _{2} = 2 1 − log _{2} ^{l}^{n} ^{2}^{N}
2
ln N
(2N ) ^{−}^{2} (
ln
which correspond closely to the computed orders of convergence given in the last row of Table 1.
H. MacMullen et al. / Journal of Computational and Applied Mathematics 130 (2001) 231–244
241
Table 1 Computed global maximum pointwise errors E
discrete Schwarz method applied to problem (5) for various values of and N
Mult mai mult decât documente.
Descoperiți tot ce are Scribd de oferit, inclusiv cărți și cărți audio de la editori majori.
Anulați oricând.