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 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 where 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.
First we define an asymptotic scale, and then give the formal definition of an asymptotic expansion.
If
\varphin
L
\varphin+1(x)=o(\varphin(x)) (x\toL) .
(
L
x\toL
If
f
N
N | |
\sum | |
n=0 |
an\varphin(x)
if
f(x)-
N-1 | |
\sum | |
n=0 |
an\varphin(x)=O(\varphiN(x)) (x\toL)
or the weaker condition
f(x)-
N-1 | |
\sum | |
n=0 |
an\varphin(x)=o(\varphiN-1(x)) (x\toL)
is satisfied. Here,
o
N
f(x)\sim
infty | |
\sum | |
n=0 |
an\varphin(x) (x\toL) .
In contrast to a convergent series for
f
x
N\toinfty
N
x\toL
L
B2m
s\overline{2m-1
N>|s|
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
1 | |
1-w |
infty | |
=\sum | |
n=0 |
wn.
w\ne1
|w|<1
e-w/t
infty | |
\int | |
0 |
| ||||||||
1-w |
dw=
infty | |
\sum | |
n=0 |
tn+1
infty | |
\int | |
0 |
e-uundu,
after the substitution
u=w/t
| |||||
e | \operatorname{Ei}\left( |
1 | |
t |
\right)=
infty | |
\sum | |
n=0 |
n!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
\operatorname{Ei}\left(\tfrac{1}{t}\right)
x=-\tfrac{1}{t}
\operatorname{Ei}(x)=-E1(-x)
Using integration by parts, we can obtain an explicit formulaFor any fixed
z
|en(z)|
n\sim|z|
\verten(z)\vert\leq\sqrt{
2\pi | |
\vertz\vert |
For a given asymptotic scale
\{\varphin(x)\}
f(x)
\{an\}
L
\pminfty
A given function
f(x)
An asymptotic expansion may be an asymptotic expansion to more than one function.