page_118
file:///G|/%5EDoc%5E/_new_new/got/020349878X/files/page_118.html[22/02/2009 23:52:33]
< previous page page_118 next page >
Page 118
We shall now show that for
t>
0 the approximate solution
uN(x, t)
converges uniformly on [0,
L
] as Let
N>M,
then
where
We see that
R
→0 as
M
→∞ for all
N>M
independently of If is accepted as the
analytic solution of the original problem, then
R
(
αt, M
+1) is a bound on the error. We can estimate
M
such that for any given For example, suppose we wish to assure that our solution at time
αt
=.00001 is within 10−6 of the analytic solution. With
L
=1 we find that
R
(10−5, 334) <10−6 <
R
(10−5, 333).
Hence 333 terms in the transient solution are sufficient for the approximate solution. Of course, our
estimates are not sharp, but we are not far off the mark. For example, a numerical evaluation of (6.1)
for
N=
300 and
αt=
10−5 yields
Since the analytic solution is nonnegative, the error exceeds our tolerance. (We remark that for
N
=333
min
u
333
(x, t)
= −0.83×10−6
is within our tolerance.)
For illustration we show in Fig. 6.1
u
10
(x, t)
and
u
333
(x, t)
for
αt=
10−5 to caution that one cannot
always truncate the series after just a few terms.
In contrast, similar estimates for
αt=
.1 show that only three terms are required in the transient solution
for an error less than 10−6.
< previous page page_118 next page >