Asymptotic series. Comparison of asymptotic and convergent series.

Advantages of application of asymptotic series and decompositions.

An asymptotic series can be viewed as a particular case of an asymptotic

decomposition. Allowing in (2.30) or (2.31) 𝑁 → ∞, one gets an infinitc
asymptotic series of the function 𝑓(𝜀). This series may be convergent in a
classical sense for a certain subspace of ɛ values, or it may be divergent for all ɛ.
A function 𝑓(𝜀) can be represented by a convergent series in the following way:
𝑁

𝑓(𝜀) = lim ∑ 𝑎𝑖 𝑞𝑖 (𝜀) for a given fixed value of ɛ.

𝑁→∞
𝑖=0

In the case of a divergent series a function 𝑓(𝜀) can be represented through

an asymptotic decomposition with the increasing accuracy for small ɛ, so that in a
limit one gets
𝑁

𝑓(𝜀) = lim ∑ 𝑎𝑖 𝑞𝑖 (𝜀) for a given fixed value of 𝑁.

𝑒→0
𝑖=0

It is worth mentioning that the expectation of a formal mathematical

convergence in partical applications belongs to rather unrealistic requirements. It
happens that convergence in a strict mathematical sense depends on behavior of
infineitely small terms, whereas in partice a researcher deals only with first terms
of an asymptotic decomposition and usually believes that these terms tend quickly
to a real solution of the investigated problem. However, very often representing a
function through several terms of an asymptotic series only is more useful than
the application of the whole series. The main advantage of asymptotic
decomposition relies on the error estimation, which is of order of the firs
neglected term, and hence it tends to zero quickly with a decrease of ɛ. For a fixed
value of ɛ an error can be decreased through the increase of the number of
decomposition elements. If a series is divergent, then three is a critical instant
when the further increase of terms cause an increase of error and the process
should be stopped.

Consider, as an example, a representation of the function 𝑓(𝜀) through a

series of small ɛ, where
1⁄
𝜀
1 2 2
𝑓(𝜀) = 1 − 𝑒𝑟𝑓 ( ) = 1 − ∫ 𝑒 −𝑡 𝑑𝑡
𝜀 √𝜋
0

2 𝑥 2 2 𝑥3 1 𝑥5 1 𝑥7
In the above, 𝑒𝑟𝑓 = ∫ 𝑒 −𝑡 𝑑𝑡 = √𝜋 (𝑥 − + 2! − 3! + ⋯ ) governs
√𝜋 0 3 5 7
errors’ function widely used in the theory of probability.
 This series has been obtained through the decomposition of the integrand
exponential function in accordance with the formula (2.7) and then through
successive integrations. One finally gets
∞
2 (−1)𝑛
𝑓(𝜀) = 1 − ∑ =𝐴
√𝜋 𝑛=0 (2𝑛 + 1)𝑛! 𝜀 2𝑛+1

The obtained series A is not an asymptotic one. Series A is absolutoly

convergent, which can be shown through the estimation of its limit (𝑓𝑜𝑟 𝑛 → ∞)
for its two neighboring absolute element values (d’Alembert principle).

On the other hand, successive integration of the function (2.47) by parts can
yield an infinite asymptotic series of rhe form
2 ∞
𝜀𝑒 −1⁄𝜋 1 . 3 … . (2𝑛 − 1) 2𝑛
𝑓(𝜀) = [1 + ∑(−1) 𝜀 ] − 𝐵.
√𝜋 2𝑛
𝑛=1

eries B is divergent for arbitrary ɛ. In spite of that, since for small ɛ first terms of
series B decrease quickly, one may obtain more accurate representation of 𝑓(𝜀),
than that achieved through the application of series A. The reason is that the
convergence of series A is very slow. For example, for ɛ = 0.01 one may take
two terms of series B in order to determine 𝑓(𝜀) with a relative error of order
10−8.