Wave Propagation in Linear Media | re-examined
Wave Propagation in Linear Media | re-examined
Wave Propagation in Linear Media | re-examined
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
6.4 Asymptotic partition<br />
of the <strong>in</strong>tegrand. The terms `zero' and `ext<strong>re</strong>mum' lose their mean<strong>in</strong>gs as they now <strong>re</strong>fer to<br />
the approximation rather than to the <strong>re</strong>al <strong>in</strong>tegrand. Thus we would actually bene t from<br />
the e ect we discussed <strong>in</strong> the last section only for x !1.<br />
In the computation of the limit we used the complete sequence of partial sums with almost 250<br />
members. Normally, wewould not beg<strong>in</strong> with that large a number because their determ<strong>in</strong>ation<br />
could be time consum<strong>in</strong>g. As the rst few sequence members look fairly ir<strong>re</strong>gular, the burn<strong>in</strong>g<br />
question is how many wemust take <strong>in</strong> order to obta<strong>in</strong> a <strong>re</strong>liable <strong>re</strong>sult for the limit and how<br />
we can improve the accuracy if needed. This obviously <strong>re</strong>qui<strong>re</strong>s that mo<strong>re</strong> sequence members<br />
be taken <strong>in</strong>to account, however, the<strong>re</strong> a<strong>re</strong> two possibilities to do so:<br />
1. We can <strong>in</strong>c<strong>re</strong>ase the number of sequence members used <strong>in</strong> the extrapolation, that is, we<br />
compute limk!1 e S (k)<br />
n with n = 0 if we start with the very rst member.<br />
2. We leave the length k of the subset subject to extrapolation xed and start the extrapolation<br />
at a member with a higher <strong>in</strong>dex, which islimn!1 e S (k)<br />
n .<br />
Both limit<strong>in</strong>g processes have not <strong>re</strong>ceived much attention <strong>in</strong> the literatu<strong>re</strong>. Sidi [126] found<br />
that for his W -transformation, method 1 gives better <strong>re</strong>sults and is mo<strong>re</strong> e cient.<br />
We now exam<strong>in</strong>e these two possibilities brie y for our example. For the rst one, we take<br />
the rst k members of the sequence to determ<strong>in</strong>e the limit and plot the absolute value of the<br />
approximation error e S (k)<br />
n , S depend<strong>in</strong>g on k.<br />
In[22]:= approxerr1 = Table[Abs[SequenceLimit[Take[partial,f1,kg]] - N[Pi/2]],<br />
fk,10,240g];<br />
LogListPlot[approxerr1,PlotStyle->Po<strong>in</strong>tSize[0.006],PlotRange->All];<br />
0.001<br />
-6<br />
1. 10<br />
-9<br />
1. 10<br />
-12<br />
1. 10<br />
0 50 100 150 200<br />
147