§ 2.11. Remainder Terms; Stokes Phenomenon

Permalink:: http://dlmf.nist.gov/2.11

§2.11(i)Numerical Use of Asymptotic Expansions
§2.11(ii)Connection Formulas
§2.11(iii)Exponentially-Improved Expansions
§2.11(iv)Stokes Phenomenon
§2.11(v)Exponentially-Improved Expansions (continued)
§2.11(vi)Direct Numerical Transformations

§ 2.11(i). Numerical Use of Asymptotic Expansions

Notes:: See Olver (1997b, pp. 76–78).
Referenced by:: §2.11(ii)
Permalink:: http://dlmf.nist.gov/2.11.SS1

When a rigorous bound or reliable estimate for the remainder term is unavailable, it is unsafe to judge the accuracy of an asymptotic expansion merely from the numerical rate of decrease of the terms at the point of truncation. Even when the series converges this is unwise: the tail needs to be majorized rigorously before the result can be guaranteed. For divergent expansions the situation is even more difficult. First, it is impossible to bound the tail by majorizing its terms. Secondly, the asymptotic series represents an infinite class of functions, and the remainder depends on which member we have in mind.

As an example consider

2.11.1 $I(m)=\int _{{0}}^{{\pi}}\frac{\cos\!\left(mt\right)}{t^{2}+1}dt,$

Defines:: $I(m)$ : integral
Permalink:: http://dlmf.nist.gov/2.11.E1
Encodings:: TeX, pMathML, png

with $m$ a large integer. By integration by parts (§2.3(i))

2.11.2 $I(m)\sim(-1)^{m}\sum _{{s=1}}^{{\infty}}\frac{q_{s}(\pi)}{m^{{2s}}},$ $m\to\infty$ ,

Defines:: $I(m)$ : integral and $q_{s}(t)$ : coefficients
Symbols:: $\sim$ : asymptotically equal
Referenced by:: §2.11(i)
Permalink:: http://dlmf.nist.gov/2.11.E2
Encodings:: TeX, pMathML, png

with

2.11.3

$q_{1}(t)=-\frac{2t}{(t^{2}+1)^{2}},$

$q_{2}(t)=\frac{24(t^{3}-t)}{(t^{2}+1)^{4}},$

$q_{3}(t)=-\frac{240(3t^{5}-10t^{3}+3t)}{(t^{2}+1)^{6}}.$

Defines:: $q_{s}(t)$ : coefficients
Permalink:: http://dlmf.nist.gov/2.11.E3
Encodings:: TeX, TeX, TeX, pMathML, pMathML, pMathML, png, png, png

On rounding to 5D, we have $q_{1}(\pi)=-0.05318$ , $q_{2}(\pi)=0.04791$ , $q_{3}(\pi)=-0.08985$ . Hence

2.11.4 $I(10)\sim-0.00053\; 18+0.00000\; 48-0.00000\; 0 1=-0.00052\; 71.$

Defines:: $I(m)$ : integral
Symbols:: $\sim$ : asymptotically equal
Referenced by:: §2.11(i)
Permalink:: http://dlmf.nist.gov/2.11.E4
Encodings:: TeX, pMathML, png

But this answer is incorrect: to 7D $I(10)=-0.00045\; 58$ . The error term is, in fact, approximately 700 times the last term obtained in (2.11.4). The explanation is that (2.11.2) is a more accurate expansion for the function $I(m)-\frac{1}{2}\pi e^{{-m}}$ than it is for $I(m)$ ; see Olver (1997b, pp. 76–78).

In order to guard against this kind of error remaining undetected, the wanted function may need to be computed by another method (preferably nonasymptotic) for the smallest value of the (large) asymptotic variable $x$ that is intended to be used. If the results agree within $S$ significant figures, then it is likely — but not certain — that the truncated asymptotic series will yield at least $S$ correct significant figures for larger values of $x$ . For further discussion see Bosley (1996).

In $\Complex$ both the modulus and phase of the asymptotic variable $z$ need to be taken into account. Suppose an asymptotic expansion holds as $z\to\infty$ in any closed sector within $\alpha<\mathrm{ph}z<\beta$ , say, but not in $\alpha\leq\mathrm{ph}z\leq\beta$ . Then numerical accuracy will disintegrate as the boundary rays $\mathrm{ph}z=\alpha$ , $\mathrm{ph}z=\beta$ are approached. In consequence, practical application needs to be confined to a sector $\alpha^{{\prime}}\leq\mathrm{ph}z\leq\beta^{{\prime}}$ well within the sector of validity, and independent evaluations carried out on the boundaries for the smallest value of $|z|$ intended to be used. The choice of $\alpha^{{\prime}}$ and $\beta^{{\prime}}$ is facilitated by a knowledge of the relevant Stokes lines; see §2.11(iv) below.

However, regardless whether we can bound the remainder, the accuracy achievable by direct numerical summation of a divergent asymptotic series is always limited. The rest of this section is devoted to general methods for increasing this accuracy.

§ 2.11(ii). Connection Formulas

Referenced by:: §2.11(iii)
Permalink:: http://dlmf.nist.gov/2.11.SS2

From §Ch.8 the generalized exponential integral is given by

2.11.5 $E_{{p}}\!\left(z\right)=\frac{e^{{-z}}z^{{p-1}}}{\Gamma\!\left(p\right)}\int _{{0}}^{{\infty}}\frac{e^{{-zt}}t^{{p-1}}}{1+t}dt$

Symbols:: $\Gamma\!\left(z\right)$ : Gamma function
Referenced by:: §2.11(iii)
Permalink:: http://dlmf.nist.gov/2.11.E5
Encodings:: TeX, pMathML, png

when $\realpart{p}>0$ and $|\mathrm{ph}z|<\frac{1}{2}\pi$ , and by analytic continuation for other values of $p$ and $z$ . Application of Watson's lemma (§2.4(i)) yields

2.11.6 $E_{{p}}\!\left(z\right)\sim\frac{e^{{-z}}}{z}\sum _{{s=0}}^{{\infty}}(-1)^{s}\frac{\left(p\right)_{{s}}}{z^{s}}$

Symbols:: $\left(a\right)_{{n}}$ : Pochhammer's symbol and $\sim$ : asymptotically equal
Referenced by:: §2.11(ii), §2.11(iii), §2.11(iii), §2.11(iv), §2.11(iv)
Permalink:: http://dlmf.nist.gov/2.11.E6
Encodings:: TeX, pMathML, png

when $p$ is fixed and $z\to\infty$ in any closed sector within $|\mathrm{ph}z|<\frac{3}{2}\pi$ . As noted in §2.11(i), poor accuracy is yielded by this expansion as $\mathrm{ph}z$ approaches $\frac{3}{2}\pi$ or $-\frac{3}{2}\pi$ . However, on combining (2.11.6) with the connection formula (Ch.8), with $m=1$ , we derive

2.11.7 $E_{{p}}\!\left(z\right)\sim\frac{2\pi ie^{{-p\pi i}}}{\Gamma\!\left(p\right)}z^{{p-1}}+\frac{e^{{-z}}}{z}\sum _{{s=0}}^{{\infty}}(-1)^{s}\frac{\left(p\right)_{{s}}}{z^{s}},$

Symbols:: $\Gamma\!\left(z\right)$ : Gamma function, $\left(a\right)_{{n}}$ : Pochhammer's symbol and $\sim$ : asymptotically equal
Referenced by:: §2.11(ii), §2.11(iv), §2.11(iv), §2.11(iv)
Permalink:: http://dlmf.nist.gov/2.11.E7
Encodings:: TeX, pMathML, png

valid as $z\to\infty$ in any closed sector within $\frac{1}{2}\pi<\mathrm{ph}z<\frac{7}{2}\pi$ ; compare (Ch.8). Since the ray $\mathrm{ph}z=\frac{3}{2}\pi$ is well away from the new boundaries, the compound expansion (2.11.7) yields much more accurate results when $\mathrm{ph}z\to\frac{3}{2}\pi$ . In effect, (2.11.7) “corrects” (2.11.6) by introducing a term that is relatively exponentially small in the neighborhood of $\mathrm{ph}z=\pi$ , is increasingly significant as $\mathrm{ph}z$ passes from $\pi$ to $\frac{3}{2}\pi$ , and becomes the dominant contribution after $\mathrm{ph}z$ passes $\frac{3}{2}\pi$ . See also §2.11(iv).

§ 2.11(iii). Exponentially-Improved Expansions

Notes:: See Olver (1991b).
Referenced by:: §2.11(v), §5.11(ii)
Permalink:: http://dlmf.nist.gov/2.11.SS3

The procedure followed in §2.11(ii) enabled $E_{{p}}\!\left(z\right)$ to be computed with as much accuracy in the sector $\pi\leq\mathrm{ph}z\leq 3\pi$ as the original expansion (2.11.6) in $|\mathrm{ph}z|\leq\pi$ . We now increase substantially the accuracy of (2.11.6) in $|\mathrm{ph}z|\leq\pi$ by re-expanding the remainder term.

Optimum truncation in (2.11.6) takes place at $s=n-1$ , with $|p+n-1|=|z|$ , approximately. Thus

2.11.8 $n=\rho-p+\alpha,$

Defines:: $\rho$ : radius
Referenced by:: §2.11(iii), §2.11(iii)
Permalink:: http://dlmf.nist.gov/2.11.E8
Encodings:: TeX, pMathML, png

where $z=\rho e^{{i\theta}}$ , and $|\alpha|$ is bounded as $n\to\infty$ . From (2.11.5) and the identity

2.11.9 $\frac{1}{1+t}=\sum _{{s=0}}^{{n-1}}(-1)^{s}t^{s}+(-1)^{n}\frac{t^{n}}{1+t},$ $t\neq-1$ ,

Permalink:: http://dlmf.nist.gov/2.11.E9
Encodings:: TeX, pMathML, png

we have

2.11.10 $E_{{p}}\!\left(z\right)=\frac{e^{{-z}}}{z}\sum _{{s=0}}^{{n-1}}(-1)^{s}\frac{\left(p\right)_{{s}}}{z^{s}}+(-1)^{n}\frac{2\pi}{\Gamma\!\left(p\right)}z^{{p-1}}F_{{n+p}}(z),$

Defines:: $F_{{n+p}}(z)$ : function
Symbols:: $\Gamma\!\left(z\right)$ : Gamma function and $\left(a\right)_{{n}}$ : Pochhammer's symbol
Referenced by:: §2.11(iii), §2.11(iv)
Permalink:: http://dlmf.nist.gov/2.11.E10
Encodings:: TeX, pMathML, png

where

2.11.11 $F_{{n+p}}(z)=\frac{e^{{-z}}}{2\pi}\int _{{0}}^{{\infty}}\frac{e^{{-zt}}t^{{n+p-1}}}{1+t}dt=\frac{\Gamma\!\left(n+p\right)}{2\pi}\frac{E_{{n+p}}\!\left(z\right)}{z^{{n+p-1}}}.$

Defines:: $F_{{n+p}}(z)$ : function
Symbols:: $\Gamma\!\left(z\right)$ : Gamma function
Permalink:: http://dlmf.nist.gov/2.11.E11
Encodings:: TeX, pMathML, png

With $n$ given by (2.11.8), we have

2.11.12 $F_{{n+p}}(z)=\frac{e^{{-z}}}{2\pi}\int _{{0}}^{{\infty}}\exp\!\left(-\rho\left(te^{{i\theta}}-\ln t\right)\right)\frac{t^{{\alpha-1}}}{1+t}dt.$

Symbols:: $\rho$ : radius, $\theta$ : radius and $F_{{n+p}}(z)$ : function
Permalink:: http://dlmf.nist.gov/2.11.E12
Encodings:: TeX, pMathML, png

For large $\rho$ the integrand has a saddle point at $t=e^{{-i\theta}}$ . Following §2.4(iv), we rotate the integration path through an angle $-\theta$ , which is valid by analytic continuation when $-\pi<\theta<\pi$ . Then by application of Laplace's method (§§2.4(iii) and 2.4(iv)), we have

2.11.13 $F_{{n+p}}(z)\sim\frac{e^{{-i(\rho+\alpha)\theta}}}{1+e^{{-i\theta}}}\frac{e^{{-\rho-z}}}{(2\pi\rho)^{{1/2}}}\sum _{{s=0}}^{{\infty}}\frac{a_{{2s}}(\theta,\alpha)}{\rho^{s}},$ $\rho\to\infty$ ,

Defines:: $a_{{2s}}(\theta,\alpha)$ : coefficients
Symbols:: $\sim$ : asymptotically equal, $\rho$ : radius, $\theta$ : radius and $F_{{n+p}}(z)$ : function
Referenced by:: §2.11(iii), §2.11(iii)
Permalink:: http://dlmf.nist.gov/2.11.E13
Encodings:: TeX, pMathML, png

uniformly when $\theta\in[-\pi+\delta,\pi-\delta]$ ( $\delta>0$ ) and $|\alpha|$ is bounded. The coefficients are rational functions of $\alpha$ and $1+e^{{i\theta}}$ , for example, $a_{0}(\theta,\alpha)=1$ , and

2.11.14 $a_{2}(\theta,\alpha)=\frac{1}{12}(6\alpha^{2}-6\alpha+1)-\frac{\alpha}{1+e^{{i\theta}}}+\frac{1}{(1+e^{{i\theta}})^{2}}.$

Defines:: $a_{{2s}}(\theta,\alpha)$ : coefficients
Symbols:: $\theta$ : radius
Referenced by:: §2.11(iii)
Permalink:: http://dlmf.nist.gov/2.11.E14
Encodings:: TeX, pMathML, png

Owing to the factor $e^{{-\rho}}$ , that is, $e^{{-|z|}}$ in (2.11.13), $F_{{n+p}}(z)$ is uniformly exponentially small compared with $E_{{p}}\!\left(z\right)$ . For this reason the expansion of $E_{{p}}\!\left(z\right)$ in $|\mathrm{ph}z|\leq\pi-\delta$ supplied by (2.11.8), (2.11.10), and (2.11.13) is said to be exponentially improved.

If we permit the use of nonelementary functions as approximants, then even more powerful re-expansions become available. One is uniformly valid for $-\pi+\delta\leq\mathrm{ph}z\leq 3\pi-\delta$ with bounded $|\alpha|$ , and achieves uniform exponential improvement throughout $0\leq\mathrm{ph}z\leq\pi$ :

2.11.15 $F_{{n+p}}(z)\sim(-1)^{n}ie^{{-p\pi i}}\left(\tfrac{1}{2}\mathrm{erfc}\!\left(\sqrt{\tfrac{1}{2}\rho}\, c(\theta)\right)-i\frac{e^{{i\rho(\pi-\theta)}}e^{{-\rho-z}}}{(2\pi\rho)^{{1/2}}}\sum _{{s=0}}^{{\infty}}\frac{h_{{2s}}(\theta,\alpha)}{\rho^{s}}\right).$

Defines:: $c(\theta)$ and $h_{{2s}}(\theta,\alpha)$ : functions
Symbols:: $\sim$ : asymptotically equal, $\rho$ : radius, $\theta$ : radius and $F_{{n+p}}(z)$ : function
Referenced by:: §2.11(iv), §2.11(iv), §2.11(v)
Permalink:: http://dlmf.nist.gov/2.11.E15
Encodings:: TeX, pMathML, png

Here $\mathrm{erfc}$ is the complementary error function (§Ch.7), and

2.11.16 $c(\theta)=\sqrt{2(1+e^{{i\theta}}+i(\theta-\pi))},$

Defines:: $c(\theta)$
Symbols:: $\theta$ : radius
Permalink:: http://dlmf.nist.gov/2.11.E16
Encodings:: TeX, pMathML, png

the branch being continuous with $c(\theta)\sim\pi-\theta$ as $\theta\to\pi$ . Also,

2.11.17 $h_{{2s}}(\theta,\alpha)=\frac{e^{{i\alpha(\pi-\theta)}}}{1+e^{{-i\theta}}}a_{{2s}}(\theta,\alpha)+(-1)^{{s-1}}i\frac{1\cdot 3\cdot 5\cdot\cdot\cdot(2s-1)}{(c(\theta))^{{2s+1}}},$

Defines:: $c(\theta)$ and $h_{{2s}}(\theta,\alpha)$ : functions
Symbols:: $\theta$ : radius and $a_{{2s}}(\theta,\alpha)$ : coefficients
Permalink:: http://dlmf.nist.gov/2.11.E17
Encodings:: TeX, pMathML, png

with $a_{{2s}}(\theta,\alpha)$ as in (2.11.13), (2.11.14). In particular,

2.11.18 $h_{0}(\theta,\alpha)=\frac{e^{{i\alpha(\pi-\theta)}}}{1+e^{{-i\theta}}}-\frac{i}{c(\theta)}.$

Defines:: $c(\theta)$ and $h_{{2s}}(\theta,\alpha)$ : functions
Symbols:: $\theta$ : radius
Permalink:: http://dlmf.nist.gov/2.11.E18
Encodings:: TeX, pMathML, png

For the sector $-3\pi+\delta\leq\mathrm{ph}z\leq\pi-\delta$ the conjugate result applies.

Further details for this example are supplied in Olver (1991b, 1994b). See also Paris and Kaminski (2001, Chapter 6), and Dunster (1996b, 1997).

§ 2.11(iv). Stokes Phenomenon

Referenced by:: §2.11(i), §2.11(ii), §2.11(vi)
Permalink:: http://dlmf.nist.gov/2.11.SS4

Two different asymptotic expansions in terms of elementary functions, (2.11.6) and (2.11.7), are available for the generalized exponential integral in the sector $\frac{1}{2}\pi<\mathrm{ph}z<\frac{3}{2}\pi$ . That the change in their forms is discontinuous, even though the function being approximated is analytic, is an example of the Stokes phenomenon. Where should the change-over take place? Can it be accomplished smoothly?

Satisfactory answers to these questions were found by Berry (1989); see also the survey by Paris and Wood (1995). These answers are linked to the terms involving the complementary error function in the more powerful expansions typified by the combination of (2.11.10) and (2.11.15). Thus if $0\leq\theta\leq\pi-\delta$ ( $<\pi$ ), then $c(\theta)$ lies in the right half-plane. Hence from §Ch.7 $\mathrm{erfc}\!\left(\sqrt{\frac{1}{2}\rho}\; c(\theta)\right)$ is of the same exponentially-small order of magnitude as the contribution from the other terms in (2.11.15) when $\rho$ is large. On the other hand, when $\pi+\delta\leq\theta\leq 3\pi-\delta$ , $c(\theta)$ is in the left half-plane and $\mathrm{erfc}\!\left(\sqrt{\frac{1}{2}\rho}\; c(\theta)\right)$ differs from 2 by an exponentially-small quantity. In the transition through $\theta=\pi$ , $\mathrm{erfc}\!\left(\sqrt{\frac{1}{2}\rho}\; c(\theta)\right)$ changes very rapidly, but smoothly, from one form to the other; compare the graph of its modulus in Figure 2.11.1 in the case $\rho=100$ .

2.11.1. Graph of $|\mathrm{erfc}\!\left(\sqrt{50}\, c(\theta)\right)|$ .

Magnify

Symbols:: $\theta$ : radius and $c(\theta)$
Referenced by:: §2.11(iv), §2.11(iv)
Permalink:: http://dlmf.nist.gov/2.11.F1
Encodings:: eps, png

In particular, on the ray $\theta=\pi$ greatest accuracy is achieved by (a) taking the average of the expansions (2.11.6) and (2.11.7), followed by (b) taking account of the exponentially-small contributions arising from the terms involving $h_{{2s}}(\theta,\alpha)$ in (2.11.15).

Rays (or curves) on which one contribution in a compound asymptotic expansion achieves maximum dominance over another are called Stokes lines ( $\theta=\pi$ in the present example). As these lines are crossed exponentially-small contributions, such as that in (2.11.7), are “switched on” smoothly, in the manner of the graph in Figure 2.11.1.

For higher-order Stokes phenomena see Olde Daalhuis (2004b) and Howls et al. (2004).

§ 2.11(v). Exponentially-Improved Expansions (continued)

Referenced by:: §2.7(ii)
Permalink:: http://dlmf.nist.gov/2.11.SS5

Expansions similar to (2.11.15) can be constructed for many other special functions. However, to enjoy the resurgence property (§2.7(ii)) we often seek instead expansions in terms of the $F$ -functions introduced in §2.11(iii), leaving the connection of the error-function type behavior as an implicit consequence of this property of the $F$ -functions. In this context, the $F$ -functions are called terminants (Dingle (1973)).

For illustration, we give re-expansions of the remainder terms in the expansions (2.7.8) arising in differential-equation theory. For notational convenience assume that the original differential equation (2.7.1) is normalized so that $\lambda _{2}-\lambda _{1}=1$ . (This means that, if necessary, $z$ is replaced by $z/(\lambda _{2}-\lambda _{1})$ .) From (2.7.12), (2.7.13) it is then seen that the optimum number of terms, $n$ , in (2.7.14) is approximately $|z|$ . We set

2.11.19 $w_{j}(z)=e^{{\lambda _{j}z}}z^{{\mu _{j}}}\sum _{{s=0}}^{{n-1}}\frac{a_{{s,j}}}{z^{s}}+R_{n}^{{(j)}}(z),$ $j=1,2$ ,

Defines:: $a_{{s,j}}$ : coefficients
Symbols:: $R_{n}^{{(j)}}(z)$ : remainder, $\lambda _{j}$ : roots, $\mu _{j}$ : quantities and $w_{j}(z)$ : solutions
Permalink:: http://dlmf.nist.gov/2.11.E19
Encodings:: TeX, pMathML, png

and expand

2.11.20 $R_{n}^{{(1)}}(z)=(-1)^{{n-1}}ie^{{(\mu _{2}-\mu _{1})\pi i}}e^{{\lambda _{2}z}}z^{{\mu _{2}}}\left(C_{1}\sum _{{s=0}}^{{m-1}}(-1)^{s}a_{{s,2}}\frac{F_{{n+\mu _{2}-\mu _{1}-s}}(z)}{z^{s}}+R_{{m,n}}^{{(1)}}(z)\right),$

Defines:: $R_{n}^{{(j)}}(z)$ : remainder
Symbols:: $a_{{s,j}}$ : coefficients, $F_{{n+p}}(z)$ : function, $\lambda _{j}$ : roots, $\mu _{j}$ : quantities and $C_{1}$ , $C_{2}$ : Stokes multipliers
Referenced by:: §2.11(v)
Permalink:: http://dlmf.nist.gov/2.11.E20
Encodings:: TeX, pMathML, png

2.11.21 $R_{n}^{{(2)}}(z)=(-1)^{n}ie^{{(\mu _{2}-\mu _{1})\pi i}}e^{{\lambda _{1}z}}z^{{\mu _{1}}}\left(C_{2}\sum _{{s=0}}^{{m-1}}(-1)^{s}a_{{s,1}}\frac{F_{{n+\mu _{1}-\mu _{2}-s}}(ze^{{-\pi i}})}{z^{s}}+R_{{m,n}}^{{(2)}}(z)\right),$

Defines:: $R_{n}^{{(j)}}(z)$ : remainder
Symbols:: $a_{{s,j}}$ : coefficients, $F_{{n+p}}(z)$ : function, $\lambda _{j}$ : roots, $\mu _{j}$ : quantities and $C_{1}$ , $C_{2}$ : Stokes multipliers
Referenced by:: §2.11(v)
Permalink:: http://dlmf.nist.gov/2.11.E21
Encodings:: TeX, pMathML, png

with $m=0,1,2,\dots$ , and $C_{1},C_{2}$ as in (2.7.17). Then as $z\to\infty$ , with $|n-|z||$ bounded and $m$ fixed,

2.11.22 $R_{{m,n}}^{{(1)}}(z)=\begin{cases}O\!\left(e^{{-|z|-z}}z^{{-m}}\right),&|\mathrm{ph}z|\leq\pi,\\ O\!\left(z^{{-m}}\right),&\pi\leq|\mathrm{ph}z|\leq\frac{5}{2}\pi-\delta,\end{cases}$

Symbols:: $O\!\left(x\right)$ : order symbol, $R_{n}^{{(j)}}(z)$ : remainder and $\delta$ : positive constant
Permalink:: http://dlmf.nist.gov/2.11.E22
Encodings:: TeX, pMathML, png

2.11.23 $R_{{m,n}}^{{(2)}}(z)=\begin{cases}O\!\left(e^{{-|z|+z}}z^{{-m}}\right),&0\leq\mathrm{ph}z\leq 2\pi,\\ O\!\left(z^{{-m}}\right),&-\frac{3}{2}\pi+\delta\leq\mathrm{ph}z\leq 0\text{ and }2\pi\leq\mathrm{ph}z\leq\frac{7}{2}\pi-\delta,\end{cases}$

Symbols:: $O\!\left(x\right)$ : order symbol, $R_{n}^{{(j)}}(z)$ : remainder and $\delta$ : positive constant
Permalink:: http://dlmf.nist.gov/2.11.E23
Encodings:: TeX, pMathML, png

uniformly with respect to $\mathrm{ph}z$ in each case.

The relevant Stokes lines are $\mathrm{ph}z=\pm\pi$ for $w_{1}(z)$ , and $\mathrm{ph}z=0,2\pi$ for $w_{2}(z)$ . In addition to achieving uniform exponential improvement, particularly in $|\mathrm{ph}z|\leq\pi$ for $w_{1}(z)$ , and $0\leq\mathrm{ph}z\leq 2\pi$ for $w_{2}(z)$ , the re-expansions (2.11.20), (2.11.21) are resurgent.

For further details see Olde Daalhuis and Olver (1994). For error bounds see Dunster (1996c). For other examples see Boyd (1990b), Paris (1992a, b), and Wong and Zhao (2002).

Often the process of re-expansion can be repeated any number of times. In this way we arrive at hyperasymptotic expansions. For integrals, see Berry and Howls (1991), Howls (1992), and Paris and Kaminski (2001, Chapter 6). For second-order differential equations, see Olde Daalhuis and Olver (1995a), Olde Daalhuis (1995, 1996), and Murphy and Wood (1997).

For higher-order differential equations, see Olde Daalhuis (1998a, b). The first of these two references also provides an introduction to the powerful Borel transform theory. In this connection see also Byatt-Smith (2000).

For nonlinear differential equations see Olde Daalhuis (2005a, b).

For another approach see Paris (2001a, b).

§ 2.11(vi). Direct Numerical Transformations

Notes:: See Olver (1997b, pp. 540–543) and Weniger (1996). The computations in the example were carried out at NIST.
Permalink:: http://dlmf.nist.gov/2.11.SS6

The transformations in §Ch.3 for summing slowly convergent series can also be very effective when applied to divergent asymptotic series.

A simple example is provided by Euler's transformation (§Ch.3) applied to the asymptotic expansion for the exponential integral (§Ch.6):

2.11.24 $e^{x}E_{1}\!\left(x\right)\sim\sum _{{s=0}}^{{\infty}}(-1)^{s}\frac{s!}{x^{{s+1}}},$ $x\to+\infty$ .

Symbols:: $\sim$ : asymptotically equal
Referenced by:: §2.11(vi)
Permalink:: http://dlmf.nist.gov/2.11.E24
Encodings:: TeX, pMathML, png

Taking $x=5$ and rounding to 5D, we obtain

2.11.25 $e^{5}E_{1}\!\left(5\right)=0.20000-0.04000+0.01600-0.00960+0.00768-0.00768+0.00922-0.01290+0.02064-0.03716+0.07432-\cdots.$

Referenced by:: §2.11(vi)
Permalink:: http://dlmf.nist.gov/2.11.E25
Encodings:: TeX, pMathML, png

The numerically smallest terms are the 5th and 6th. Truncation after 5 terms yields 0.17408, compared with the correct value

2.11.26 $e^{5}E_{1}\!\left(5\right)=0.17042\dots.$

Permalink:: http://dlmf.nist.gov/2.11.E26
Encodings:: TeX, pMathML, png

We now compute the forward differences $\Delta^{j}$ , $j=0,1,2,\dots$ , of the moduli of the rounded values of the first 6 neglected terms:

2.11.27

$\Delta^{0}=0.00768$ ,

$\Delta^{1}=0.00154$ ,

$\Delta^{2}=0.00214$ ,

$\Delta^{3}=0.00192$ ,

$\Delta^{4}=0.00280$ ,

$\Delta^{5}=0.00434$ .

Defines:: $\Delta^{j}$ : $j$ th forward difference
Permalink:: http://dlmf.nist.gov/2.11.E27
Encodings:: TeX, TeX, TeX, TeX, TeX, TeX, pMathML, pMathML, pMathML, pMathML, pMathML, pMathML, png, png, png, png, png, png

Multiplying these differences by $(-1)^{j}2^{{-j-1}}$ and summing, we obtain

2.11.28 $0.00384-0.00038+0.00027-0.00012+0.00009-0.00007=0.00363.$

Permalink:: http://dlmf.nist.gov/2.11.E28
Encodings:: TeX, pMathML, png

Subtraction of this result from the sum of the first 5 terms in (2.11.25) yields 0.17045, which is much closer to the true value.

The process just used is equivalent to re-expanding the remainder term of the original asymptotic series (2.11.24) in powers of $1/(x+5)$ and truncating the new series optimally. Further improvements in accuracy can be realized by making a second application of the Euler transformation; see Olver (1997b, pp. 540–543).

Similar improvements are achievable by Aitken's $\Delta^{2}$ -process, Wynn's $\epsilon$ -algorithm, and other acceleration transformations. For a comprehensive survey see Weniger (1989).

The following example, based on Weniger (1996), illustrates their power.

For large $|z|$ , with $|\mathrm{ph}z|\leq\frac{3}{2}\pi-\delta$ ( $<\frac{3}{2}\pi$ ), the Whittaker function of the second kind has the asymptotic expansion (§Ch.13)

2.11.29 $W_{{\kappa,\mu}}\!\left(z\right)\sim\sum _{{n=0}}^{{\infty}}a_{n},$

Defines:: $a_{n}$ : coefficients
Symbols:: $\sim$ : asymptotically equal
Permalink:: http://dlmf.nist.gov/2.11.E29
Encodings:: TeX, pMathML, png

in which

2.11.30 $a_{n}=\frac{e^{{-z/2}}}{z^{{n-\kappa}}n!}\left(\mu^{2}-(\kappa-\tfrac{1}{2})^{2}\right)\*\left(\mu^{2}-(\kappa-\tfrac{3}{2})^{2}\right)\*\cdot\cdot\cdot\left(\mu^{2}-(\kappa-n+\tfrac{1}{2})^{2}\right).$

Defines:: $a_{n}$ : coefficients
Permalink:: http://dlmf.nist.gov/2.11.E30
Encodings:: TeX, pMathML, png

With $z=1.0$ , $\kappa=2.3$ , $\mu=0.5$ , the values of $a_{n}$ to 8D are supplied in the second column of Table 2.11.1.

2.11.1. Whittaker functions with Levin transformation.

$n$	$a_{{n}}$	$s_{{n}}$	$d_{{n}}$
0	0.60653 066	0.60653 066	0.60653 066
1	−1.81352 667	−1.20699 601	−0.91106 488
2	0.35363 770	−0.85335 831	−0.82413 405
3	0.02475 464	−0.82860 367	−0.83323 429
4	−0.00736 451	−0.83596 818	−0.83303 750
5	0.00676 062	−0.82920 756	−0.83298 901
6	−0.01125 643	−0.84046 399	−0.83299 429
7	0.02796 418	−0.81249 981	−0.83299 530
8	−0.09364 504	−0.90614 485	−0.83299 504
9	0.39736 710	−0.50877 775	−0.83299 501
10	−2.05001 686	−2.55879 461	−0.83299 503

Symbols:: $a_{n}$ : coefficients and $d_{n}$ : coeffient
Referenced by:: §2.11(vi), §2.11(vi)
Permalink:: http://dlmf.nist.gov/2.11.T1

The next column lists the partial sums $s_{n}=a_{0}+a_{1}+\dots+a_{n}$ . Optimum truncation occurs just prior to the numerically smallest term, that is, at $s_{4}$ . Comparison with the true value

2.11.31 $W_{{2.3,0.5}}\!\left(1.0\right)=-0.83299\; 50268\; 27526\;\cdots$

Referenced by:: §2.11(vi)
Permalink:: http://dlmf.nist.gov/2.11.E31
Encodings:: TeX, pMathML, png

shows that this direct estimate is correct to almost 3D.

The fourth column of Table 2.11.1 gives the results of applying the following variant of the Levin transformation:

2.11.32 $d_{n}=\frac{\sum _{{j=0}}^{{n}}(-1)^{j}\binom{n}{j}(j+1)^{{n-1}}\frac{s_{j}}{a_{{j+1}}}}{\sum _{{j=0}}^{{n}}(-1)^{j}\binom{n}{j}(j+1)^{{n-1}}\frac{1}{a_{{j+1}}}}.$

Defines:: $d_{n}$ : coeffient
Symbols:: $a_{n}$ : coefficients
Permalink:: http://dlmf.nist.gov/2.11.E32
Encodings:: TeX, pMathML, png

By $n=10$ we already have 8 correct decimals. Furthermore, on proceeding to higher values of $n$ with higher precision, much more accuracy is achievable. For example, using double precision $d_{{20}}$ is found to agree with (2.11.31) to 13D.

However, direct numerical transformations need to be used with care. Their extrapolation is based on assumed forms of remainder terms that may not always be appropriate for asymptotic expansions. For example, extrapolated values may converge to an accurate value on one side of a Stokes line (§2.11(iv)), and converge to a quite inaccurate value on the other.