Asymptotic analysis of a family of polynomials associated with the inverse
error function
Diego Dominici
Department of Mathematics
State University of New York at New Paltz
1 Hawk Dr. Suite 9
New Paltz, NY 12561-2443
dominicd@newpaltz.edu
Charles Knessl
Department of Mathematics, Statistics and Computer Science
University of Illinois at Chicago (M/C 249)
851 South Morgan Street
Chicago, IL 60607-7045
knessl@uic.edu
Abstract
We analyze the sequence of polynomials defined by the differential-difference equation asymptotically as . The polynomials arise in the computation of higher derivatives of the inverse error function . We use singularity analysis and discrete versions of the WKB and ray methods and give numerical results showing the accuracy of our formulas.
and its inverse , which we will
denote by satisfies The
function appears in several problems of heat conduction
[12]. In [10] we considered the function
It follows from (8) that estimating for large
values of is equivalent to finding an asymptotic approximation of the
polynomials when .
The objective of this work is to study asymptotically as
for various ranges of We shall obtain different
asymptotic expansions for and (i) (ii)
and (iii)
The paper is organized as follows: in Section 2 we approach the
problem using a singularity analysis of the generating function
[14] of the polynomials In Section 3 we
apply the WKB method to the differential-difference equation (6). In
[15], we used this approach in
the asymptotic analysis of computer science problems and in [6]
to study the Krawtchouk polynomials. Finally, in Section 4 we
analyze (6) again using the ray method [13] and obtain an
asymptotic approximation valid in various regions of the domain. In [4],
[5], [7], we employed the same
technique to analyze asymptotically other families of polynomials and in [8],
[9] to study some queueing problems.
2 Singularity analysis
In [10] we obtained the exponential generating function
which implies that
where the integration contour is a small loop around the origin in the complex
plane. Using (4), we have
and therefore
(9)
Since has singularities at and we consider the functions
where is a small loop about in the complex plane, with
To expand (11) for with a fixed we employ singularity analysis. The function
has singularities at By (1), we have
so that
and by symmetry we have
The integrand in (11) thus has singularities at and
but for the former is closer to We expand (11) around by setting and using
(12)
Then, we deform the contour in (11) to a new contour
that encircles the branch point at (see Figure 1). This leads to
(13)
where
Here corresponds to the approximation of
for above or below the right branch cut in
Figure 1.
Figure 1: A sketch of the contours and .
For large we have
and then evaluating the elementary integral in (13) leads to
as with
(14)
and
(15)
In Figure 2 we plot and . We see that the approximation is very good for
but it becomes less precise as This is because
our previous analysis assumes that with If
either or we must modify it, which we will do next.
Figure 2: A plot of (solid line) and (ooo).
When or more generally when the
singularities at and are nearly equidistant from
On the scale we have
which differs from (7). This suggests that another scale must be
analyzed, where and are both large. Thus, we consider the case of
, with Now the
singularity at in (11) becomes close to since
we use the form (9) and expand for
and Setting with
we obtain
Thus, we have
(19)
Here the contour is a small loop about Now we again employ
singularity analysis, with the branch point at determining the
asymptotic behavior for A deformation similar to that in
Figure 1 leads to
By examining (14) and (20), we can obtain the following
approximation
(21)
which is more uniform in , since it holds both for and for large and for with
fixed. However, we must still use (18) if is large and is small.
In Figure 4 we plot and and confirm that (21) is a better approximation
than (14) for large values of
Figure 4: A plot of (solid line) and (ooo).
3 WKB analysis
We shall now rederive the results in the previous section by using only the
recurrence (6) and (7). We apply the WKB method to
(6), seeking solutions of the form
with
(22)
Thus, we are assuming an exponential dependence on and an additional
weaker (e.g., algebraic) dependence that arises from the function
Using (22) in (6) leads to
where is a constant of integration. To fix we assume that expansion
(22), as will asymptotically match to
(7), when this is expanded for In view of
(22) this implies that
so that
In view of (25) this is possible only if and then from
(15) we have
(26)
We next analyze (24). Using (26) to compute we
obtain
Solving this first order PDE by the method of characteristics, we obtain
where is at this point an arbitrary function.
However, since is large and we need only the behavior of
for large values of its argument. We again argue
that by matching to (7) we have
where must be determined. We could solve (34),
using (35), but its solution would involve another arbitrary function
of . Thus, considering higher order terms will not help in determining
Instead, we employ asymptotic matching to (27).
Expanding (27) for and comparing the result to
(28) as with (30), (32) and
(35), we conclude that
(36)
But then our approximation for is not consistent with for odd We return to (29) and observe
that the equation also admits an asymptotic solution of the form
We argue that any linear combination of (30) and (37) is also
a solution and that the combination which vanishes at for odd has
and as in
(36). We have thus obtained, for
This agrees with (18), obtained by singularity analysis in section 2.
To summarize, we have shown how to infer the asymptotics of using
only the recursion (6) and the large behavior (7). Our
analysis does need to make some assumptions about the forms of various
expansions and the asymptotic matching between different scales.
4 The discrete ray method
We shall now find a uniform asymptotic approximation for using a
discrete form of the ray method [11]. This approximation will
apply for and/or large. We seek an approximate solution for
(6) of the form
In Figure 6 we compare and for and in Figure 7 for We note
that the asymptotic approximation (71) is more uniform than
(14), (18) and (20) but it is less explicit since
must be obtained numerically.
Figure 6: A plot of (solid line) and (ooo).
Figure 7: A plot of (solid line) and (ooo).
Next, we compare the results of this section with those in the previous two
sections. We first consider with and
From (62), we have
(72)
where was defined in (15). Using (72) and
(68) in (70), we get
which agrees with (14) after taking (69) into account.
Now we consider the limit with and
From (62), we have
The work of D. Dominici was supported by a Humboldt Research Fellowship for
Experienced Researchers from the Alexander von Humboldt Foundation.
The work of C. Knessl was supported by the grants NSF 05-03745 and NSA H 98230-08-1-0102.
References
[1]
M. Abramowitz and I. A. Stegun, editors.
Handbook of mathematical functions with formulas, graphs, and
mathematical tables.
Dover Publications Inc., New York, 1992.
[2]
L. Carlitz.
The inverse of the error function.
Pacific J. Math., 13:459–470, 1963.
[3]
R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth.
On the Lambert function.
Adv. Comput. Math., 5(4):329–359, 1996.
[4]
D. Dominici.
Asymptotic analysis of the Hermite polynomials from their
differential-difference equation.
J. Difference Equ. Appl., 13(12):1115–1128, 2007.
[5]
D. Dominici.
Asymptotic analysis of generalized Hermite polynomials.
Analysis (Munich), 28(2):239–261, 2008.
[6]
D. Dominici.
Asymptotic analysis of the Krawtchouk polynomials by the WKB
method.
Ramanujan J., 15(3):303–338, 2008.
[7]
D. Dominici.
Asymptotic analysis of the Bell polynomials by the ray method.
J. Comput. Appl. Math., (To appear.), 2009.
[8]
D. Dominici and C. Knessl.
Geometrical optics approach to Markov-modulated fluid models.
Stud. Appl. Math., 114(1):45–93, 2005.
[9]
D. Dominici and C. Knessl.
Ray solution of a singularly perturbed elliptic PDE with
applications to communications networks.
SIAM J. Appl. Math., 66(6):1871–1894 (electronic), 2006.
[10]
D. E. Dominici.
The inverse of the cumulative standard normal probability function.
Integral Transforms Spec. Funct., 14(4):281–292, 2003.
[11]
T. Dosdale, G. Duggan, and G. J. Morgan.
Asymptotic solutions to differential-difference equations.
J. Phys. A, 7:1017–1026, 1974.
[12]
V. V. Frolov.
Group properties of the nonlinear heat-conduction equation and the
solution of inverse problems.
Inž.-Fiz. Ž., 30(3):546–553, 1976.
[13]
J. B. Keller.
Rays, waves and asymptotics.
Bull. Amer. Math. Soc., 84(5):727–750, 1978.
[14]
C. Knessl.
Some asymptotic results for the queue with ranked
servers.
Queueing Syst., 47(3):201–250, 2004.
[15]
C. Knessl and W. Szpankowski.
Quicksort algorithm again revisited.
Discrete Math. Theor. Comput. Sci., 3(2):43–64 (electronic),
1999.