27.12.2012 Views

Wave Propagation in Linear Media | re-examined

Wave Propagation in Linear Media | re-examined

Wave Propagation in Linear Media | re-examined

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

0.001<br />

-6<br />

1. 10<br />

-9<br />

1. 10<br />

-12<br />

1. 10<br />

-15<br />

1. 10<br />

0 50 100 150 200<br />

6Towards a quadratu<strong>re</strong> rout<strong>in</strong>e<br />

Figu<strong>re</strong> 6.3: Extrapolation error e S (k)<br />

n , S for n = 0 and vary<strong>in</strong>g k, computed with the 2 algorithm<br />

( ) and the -algorithm ( ).<br />

The<strong>re</strong> is one exception to the afo<strong>re</strong>mentioned operation pr<strong>in</strong>ciple of the sequence transformation:<br />

If WynnDeg<strong>re</strong>e is set to Inf<strong>in</strong>ity, as many transformations as possible a<strong>re</strong> carried<br />

out <strong>in</strong> a row without <strong>re</strong>start<strong>in</strong>g the process. This is now the case whe<strong>re</strong> the -array is <strong>re</strong>ally<br />

computed from left to right, which matches the descriptions of the -algorithm known<br />

from the literatu<strong>re</strong>.<br />

It is worthwile to <strong>re</strong>view the <strong>re</strong>sults of the p<strong>re</strong>vious example (6.12) with a view to the extrapolation<br />

algorithm used. Be<strong>in</strong>g <strong>in</strong>di e<strong>re</strong>nt to this detail <strong>in</strong> the last chapter, we left the<br />

sett<strong>in</strong>gs of SequenceLimit at their defaults, which selected the 2 algorithm. If we choose<br />

the -algorithm (for example with WynnDeg<strong>re</strong>e->Inf<strong>in</strong>ity) and carry out the computation<br />

anew, we can compa<strong>re</strong> both algorithms di<strong>re</strong>ctly. Fig. 6.3 shows this comparison for the case<br />

whe<strong>re</strong> the number of terms subject to extrapolation a<strong>re</strong> varied, and g. 6.4 the alternative<br />

with a xed number of extrapolation terms and a di e<strong>re</strong>nt start<strong>in</strong>g <strong>in</strong>dex. In either case, the<br />

-algorithm yields better <strong>re</strong>sults for a given number of sequence members.<br />

Apart from the algorithm used, which is likely to be chosen once and for all <strong>in</strong> a series of<br />

computations, the<strong>re</strong> a<strong>re</strong> <strong>in</strong> pr<strong>in</strong>ciple two knobs for the ne tun<strong>in</strong>g of the extrapolation <strong>re</strong>sults.<br />

So far, we only twiddled either one or the other, explor<strong>in</strong>g the boundaries of this parameter<br />

space. Yet it might be possible to nd a good compromise for the values of n and k, and<br />

the<strong>re</strong>fo<strong>re</strong> we want to study their e ects <strong>in</strong> some detail now. We aga<strong>in</strong> take the <strong>in</strong>tegral (6.12),<br />

this time with a = 20, and vary both NSumTerms and NSumExtraTerms (he<strong>re</strong> denoted as ns<br />

and ne). We compute this array for di e<strong>re</strong>nt values of WynnDeg<strong>re</strong>e and plot the logarithm to<br />

the base 10 of the approximation error, which is essentially the number of cor<strong>re</strong>ct digits.<br />

150

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!