Asymptotic expansion

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, an asymptotic expansion, asymptotic series or Poincaré expansion (after Henri Poincaré) is a formal series of functions which has the property that truncating the series after a finite number of terms provides an approximation to a given function as the argument of the function tends towards a particular, often infinite, point. Investigations by Template:Harvtxt revealed that the divergent part of an asymptotic expansion is latently meaningful, i.e. contains information about the exact value of the expanded function.

The theory of asymptotic series was created by Poincaré (and independently by Stieltjes) in 1886.[1]

The most common type of asymptotic expansion is a power series in either positive or negative powers. Methods of generating such expansions include the Euler–Maclaurin summation formula and integral transforms such as the Laplace and Mellin transforms. Repeated integration by parts will often lead to an asymptotic expansion.

Since a convergent Taylor series fits the definition of asymptotic expansion as well, the phrase "asymptotic series" usually implies a non-convergent series. Despite non-convergence, the asymptotic expansion is useful when truncated to a finite number of terms. The approximation may provide benefits by being more mathematically tractable than the function being expanded, or by an increase in the speed of computation of the expanded function. Typically, the best approximation is given when the series is truncated at the smallest term. This way of optimally truncating an asymptotic expansion is known as superasymptotics.[2] The error is then typically of the form Template:Math where Template:Math is the expansion parameter. The error is thus beyond all orders in the expansion parameter. It is possible to improve on the superasymptotic error, e.g. by employing resummation methods such as Borel resummation to the divergent tail. Such methods are often referred to as hyperasymptotic approximations.

See asymptotic analysis and big O notation for the notation used in this article.

Formal definition

First we define an asymptotic scale, and then give the formal definition of an asymptotic expansion.

If  φn  is a sequence of continuous functions on some domain, and if  L  is a limit point of the domain, then the sequence constitutes an asymptotic scale if for every Template:Mvar,

φn+1(x)=o(φn(x))(xL) .

( L  may be taken to be infinity.) In other words, a sequence of functions is an asymptotic scale if each function in the sequence grows strictly slower (in the limit  xL ) than the preceding function.

If  f  is a continuous function on the domain of the asymptotic scale, then Template:Mvar has an asymptotic expansion of order  N  with respect to the scale as a formal series

n=0Nanφn(x)

if

f(x)n=0N1anφn(x)=O(φN(x))(xL)

or the weaker condition

f(x)n=0N1anφn(x)=o(φN1(x))(xL) 

is satisfied. Here, o is the little o notation. If one or the other holds for all  N , then we writeTemplate:Cn

f(x)n=0anφn(x)(xL) .

In contrast to a convergent series for  f , wherein the series converges for any fixed  x  in the limit N, one can think of the asymptotic series as converging for fixed  N  in the limit  xL  (with  L  possibly infinite).

Examples

Plots of the absolute value of the fractional error in the asymptotic expansion of the Gamma function (left). The horizontal axis is the number of terms in the asymptotic expansion. Blue points are for Template:Nowrap and red points are for Template:Nowrap. It can be seen that the least error is encountered when there are 14 terms for Template:Nowrap, and 20 terms for Template:Nowrap, beyond which the error diverges.

Worked example

Asymptotic expansions often occur when an ordinary series is used in a formal expression that forces the taking of values outside of its domain of convergence. Thus, for example, one may start with the ordinary series

11w=n=0wn.

The expression on the left is valid on the entire complex plane w1, while the right hand side converges only for |w|<1. Multiplying by ew/t and integrating both sides yields

0ewt1wdw=n=0tn+10euundu,

after the substitution u=w/t on the right hand side. The integral on the left hand side, understood as a Cauchy principal value, can be expressed in terms of the exponential integral. The integral on the right hand side may be recognized as the gamma function. Evaluating both, one obtains the asymptotic expansion

e1tEi(1t)=n=0n!tn+1.

Here, the right hand side is clearly not convergent for any non-zero value of t. However, by truncating the series on the right to a finite number of terms, one may obtain a fairly good approximation to the value of Ei(1t) for sufficiently small t. Substituting x=1t and noting that Ei(x)=E1(x) results in the asymptotic expansion given earlier in this article.

Integration by parts

Using integration by parts, we can obtain an explicit formula[3]Ei(z)=ezz(k=0nk!zk+en(z)),en(z)(n+1)! zezzettn+2dtFor any fixed z, the absolute value of the error term |en(z)| decreases, then increases. The minimum occurs at n|z|, at which point |en(z)|2π|z|e|z|. This bound is said to be "asymptotics beyond all orders".

Properties

Uniqueness for a given asymptotic scale

For a given asymptotic scale {φn(x)} the asymptotic expansion of function f(x) is unique.[4] That is the coefficients {an} are uniquely determined in the following way: a0=limxLf(x)φ0(x)a1=limxLf(x)a0φ0(x)φ1(x)aN=limxLf(x)n=0N1anφn(x)φN(x) where L is the limit point of this asymptotic expansion (may be ±).

Non-uniqueness for a given function

A given function f(x) may have many asymptotic expansions (each with a different asymptotic scale).[4]

Subdominance

An asymptotic expansion may be an asymptotic expansion to more than one function.[4]

See also

Asymptotic methods

Notes

References

Template:Authority control