Wave Propagation in Linear Media | re-examined
Wave Propagation in Linear Media | re-examined
Wave Propagation in Linear Media | re-examined
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
5.1 Univariate numerical quadratu<strong>re</strong><br />
Po<strong>in</strong>ca<strong>re</strong>-type asymptotic expansions<br />
(x) x<br />
1X<br />
i=0<br />
i<br />
: (5.5)<br />
xi Speci cally, (x) may be written as (x) = (x)+ (x), whe<strong>re</strong> its polynomial part (x) isof<br />
deg<strong>re</strong>e and (x) P 1 i=0 +i=x i as x !1. The xl a<strong>re</strong> taken to be the zeros of u , (x) ,so<br />
they approach the zeros of f(x) only asymptotically. The W -algorithm <strong>in</strong> comb<strong>in</strong>ation with<br />
a Clenshaw-Curtis rule was used by Hasegawa and Torii [127] to compute <strong>in</strong> nite <strong>in</strong>tegrals<br />
with circular functions as oscillat<strong>in</strong>g factors.<br />
R xl<br />
a f(x) dx by (xl) = R xl+1<br />
xl<br />
In an even later work [128], Sidi <strong>re</strong>turns to the ideas of Lyness and <strong>re</strong>places the <strong>in</strong>tegrals<br />
f(x) dx, thus form<strong>in</strong>g a sequence of <strong>in</strong>tegrals between successive<br />
zeros of u , (x) , whose members a<strong>re</strong> at least for large xl alternat<strong>in</strong>g <strong>in</strong> sign. Nonetheless, he<br />
uses a modi cation of his W -algorithm to accelerate the convergence of the <strong>re</strong>sult<strong>in</strong>g series<br />
P1i=,1 (xi), whe<strong>re</strong> (x,1) = Rx0 f(x)dx denotes the <strong>in</strong>tegral from the lower <strong>in</strong>terval limit<br />
a<br />
to the rst zero that is g<strong>re</strong>ater than a. In contrast to the orig<strong>in</strong>al W -transformation, the<br />
modi ed version needs only analysis of the phase (x) of oscillations, whe<strong>re</strong>as <strong>in</strong>formation<br />
on the amplitude is not <strong>re</strong>qui<strong>re</strong>d. The choice of the partition po<strong>in</strong>ts xl is simple, too, as it<br />
<strong>in</strong>volves noth<strong>in</strong>g mo<strong>re</strong> than the determ<strong>in</strong>ation of the largest zero of a given polynomial.<br />
As a variant to Sidi's method, Eh<strong>re</strong>nmark [129] proposes not to use subdivision, but aga<strong>in</strong><br />
the sequence of truncated <strong>in</strong>tegrals F (xn) = Rxn f(x)dx. However, he chooses not the zeros<br />
a<br />
of f(x) as xn, but seeks those values of x at which the truncated <strong>in</strong>tegral equals its limit<br />
limx!1 F (x).<br />
Another approach by Khanh [130] is based on the di<strong>re</strong>ct evaluation of the tail of the <strong>in</strong>tegral.<br />
It is applicable to <strong>in</strong>tegrands that satisfy either the l<strong>in</strong>ear di e<strong>re</strong>ntial equation of rst order<br />
f(x) =p(x)f 0 (x)orthat of second order f(x) =p(x)f 0 (x)+q(x)f 00 (x) with f(x), p(x), and<br />
q(x) hav<strong>in</strong>g asymptotic expansions at <strong>in</strong> nity. Then the tail R 1<br />
f(x) dx may be approximated<br />
x<br />
by a l<strong>in</strong>ear comb<strong>in</strong>ation of these expansions and their derivatives. The error can be controlled<br />
by choos<strong>in</strong>g the po<strong>in</strong>t whe<strong>re</strong> the tail is to be evaluated and the number of <strong>in</strong>volved terms<br />
su ciently large. The <strong>re</strong>ma<strong>in</strong><strong>in</strong>g nite <strong>in</strong>tegral R x<br />
f(x) dx has to be calculated us<strong>in</strong>g some<br />
a<br />
other method.<br />
5.1.2 Computer rout<strong>in</strong>es<br />
Compa<strong>re</strong>d to the large number of scienti c papers that have add<strong>re</strong>ssed the problem of <strong>in</strong> nitely<br />
oscillat<strong>in</strong>g <strong>in</strong>tegrals, the<strong>re</strong> a<strong>re</strong> astonish<strong>in</strong>gly few <strong>re</strong>ady-to-use computer programs available.<br />
Many of them a<strong>re</strong> public doma<strong>in</strong> softwa<strong>re</strong> and a<strong>re</strong> conta<strong>in</strong>ed <strong>in</strong> the comp<strong>re</strong>hensive library<br />
Netlib that is accessible via the World-Wide-Web under the add<strong>re</strong>ss http://www.netlib.org.<br />
Another entry po<strong>in</strong>t for seek<strong>in</strong>g computer rout<strong>in</strong>es is the GAMS (Guide to Available Mathematical<br />
Softwa<strong>re</strong>) that is ma<strong>in</strong>ta<strong>in</strong>ed by the US National Institute of Standards and Technology<br />
at http://gams.nist.gov and provides a classi cation scheme allow<strong>in</strong>g fast <strong>re</strong>trieval<br />
of appropriate rout<strong>in</strong>es. For other softwa<strong>re</strong> <strong>re</strong>sources on the Internet, see also the book by<br />
Uberhuber [131].<br />
127