Asymptotic Expression

Also found in: Wikipedia.

Asymptotic Expression


a comparatively simple elementary function, approximately equal (with as small a relative error as desired) to a more complex function at large values of the argument (or for argument values that are close to a given value—for example, zero). An asymptotic expression is sometimes called an asymptotic formula or estimate. The exact definition is the following: A function φ (x) is an asymptotic expression for f (x) as x → ∞ (or xa), if f (x) / φ (x) → 1 as x (or xa), or, to put it differently, if f (x) = φ(x) [l + a (x)], where a (x) → 0 as x (or xa). In this case it is written: f (x) ~ φ (x) as xφ (or xa). As a rule, φ (x) must be an easily computable function. The simplest examples of asymptotic expressions for x → 0 are sin xx, tan xx, cot x ∼ 1/x, 1 − cos xx2/2, ln (1 + x) ∼ x, ax − 1 ∼ x In a (a > 0, a ≠ 1). More complex asymptotic expressions as x arise for important functions from the theory of numbers and special functions of mathematical physics. For example, π (x) ∼ x/ln x, where π (x) is the number of prime numbers not exceeding x:

where ┌ (u) is the gamma function; for integer-number values x = n we have ┌(n + 1) = n!, which reduces to Stirling’s formula: Asymptotic Expression as n. Still more complex asymptotic expressions are found, for example in Bessel functions.

Asymptotic expressions are also considered in the complex plane, z = x + iy. Thus, for example, ǀsin(x + iy)ǀ ∼eǀvǀ2 as yφ and yφ.

An asymptotic expression is, in general, a particular case (principal term) of more complex (and accurate) approximate expressions, which are called asymptotic series or expansions.


Debruijn, N. G.Asimptoticheskie methody v analize. Moscow, 1961. (Translated from English.)

Evgrafov, M. A. Asymptoticheskie otsenki i tselye funktsii, 2nd ed. Moscow, 1962.


References in periodicals archive ?
alpha]] the asymptotic expression for <X> and [[sigma].
Note that the asymptotic expressions (12) and (13) have the same form as obtained in the case of the pure power-law memory kernel [33].
Suppose that the moment generating function satisfies the asymptotic expression
The goal of this paper is to obtain an asymptotic expression for the s-th moment [m.
In our previous work paperl, we derived an asymptotic expression for the probability that a random decomposable combinatorial structure of size n in the exp-log class has a given restricted pattern.
We derive an asymptotic expression for P(X [r]/n (S) > k).
These are mainly the statements connected with the definition of the asymptotic expressions.

Full browser ?