- In applied mathematics, asymptotic analysis is used to build numerical methods to approximate equation solutions.
- In mathematical statistics and probability theory, asymptotics are used in analysis of long-run or large-sample behaviour of random variables and estimators.
- in computer science in the analysis of algorithms, considering the performance of algorithms.
- the behavior of physical systems, an example being statistical mechanics.
- in accident analysis when identifying the causation of crash through count modeling with large number of crash counts in a given time and space.
A simple illustration, when considering a function f(n), is when there is a need to describe its properties as n becomes very large. Thus, if f(n) = n2+3n, the term 3n becomes insignificant compared to n2, when n is very large. The function f(n) is said to be "asymptotically equivalent to n2 as n → ∞", and this is written symbolically as f(n) ~ n2.
Formally, given functions f and g of a natural number variable n, one defines a binary relation
if and only if (according to Erdelyi, 1956)
This relation is an equivalence relation on the set of functions of n. The equivalence class of f informally consists of all functions g which are approximately equal to f in a relative sense, in the limit.
If , then
for any real r, and
If and , then
This allows asymptotically equivalent functions to be freely exchanged in many algebraic expressions.
An asymptotic expansion of a function f(x) is in practice an expression of that function in terms of a series, the partial sums of which do not necessarily converge, but such that taking any initial partial sum provides an asymptotic formula for f. The idea is that successive terms provide an increasingly accurate description of the order of growth of f. An example is Stirling's approximation.
In symbols, it means we have
for each fixed k.
In view of the definition of the symbol, the last equation means
in the little o notation, i.e.,
- is much smaller than .
- takes its full meaning if ,
which means the form an asymptotic scale.
In that case, some authors may abusively write
to denote the statement
One should however be careful that this is not a standard use of the symbol, and that it does not correspond to the definition given in § Definition.
In the present situation, this relation actually follows from combining steps k and (k−1), by subtracting from one gets
In case the asymptotic expansion does not converge, for any particular value of the argument there will be a particular partial sum which provides the best approximation and adding additional terms will decrease the accuracy. However, this optimal partial sum will usually have more terms as the argument approaches the limit value.
Asymptotic expansions typically arise in the approximation of certain integrals (Laplace's method, saddle-point method, method of steepest descent) or in the approximation of probability distributions (Edgeworth series). The famous Feynman graphs in quantum field theory are another example of asymptotic expansions which often do not converge.
Use in applied mathematics
Asymptotic analysis is a key tool for exploring the ordinary and partial differential equations which arise in the mathematical modelling of real-world phenomena. An illustrative example is the derivation of the boundary layer equations from the full Navier-Stokes equations governing fluid flow. In many cases, the asymptotic expansion is in power of a small parameter, ε: in the boundary layer case, this is the nondimensional ratio of the boundary layer thickness to a typical lengthscale of the problem. Indeed, applications of asymptotic analysis in mathematical modelling often centre around a nondimensional parameter which has been shown, or assumed, to be small through a consideration of the scales of the problem at hand.
Method of dominant balance
The method of dominant balance is used to determine the asymptotic behavior of solutions to an ODE without fully solving it. The process is iterative, in that the result obtained by performing the method once can be used as input when the method is repeated, to obtain as many terms in the asymptotic expansion as desired.
The process goes as follows:
- Assume that the asymptotic behavior has the form
- Make an informed guess as to which terms in the ODE might be negligible in the limit of interest.
- Drop these terms and solve the resulting simpler ODE.
- Check that the solution is consistent with step 2. If this is the case, then one has the controlling factor of the asymptotic behavior; otherwise, one needs try dropping different terms in step 2, instead.
- Repeat the process to higher orders, relying on the above result as the leading term in the solution.
Example. For arbitrary constants c and a, consider
This differential equation cannot be solved exactly. However, it is useful to consider how the solutions behave for large x: it turns out that behaves like as x → ∞ .
More rigorously, we will have , not . Since we are interested in the behavior of y in the large x limit, we change variables to y = exp(S(x)), and re-express the ODE in terms of S(x),
Now suppose first that a solution to this ODE satisfies
as x → ∞, so that
as x → ∞. Obtain then the dominant asymptotic behaviour by setting
If satisfies the above asymptotic conditions, then the above assumption is consistent. The terms we dropped will have been negligible with respect to the ones we kept.
is not a solution to the ODE for S, but it represents the dominant asymptotic behavior, which is what we are interested in. Check that this choice for is consistent,
Everything is indeed consistent.
Thus the dominant asymptotic behaviour of a solution to our ODE has been found,
By convention, the full asymptotic series is written as
so to get at least the first term of this series we have to take a further step to see if there is a power of x out the front.
Proceed by introducing a new subleading dependent variable,
and then seek asymptotic solutions for C(x). Substituting into the above ODE for S(x) we find
Repeating the same process as before, we keep C' and (c-a)/x to find that
The leading asymptotic behaviour is then
- Asymptotic computational complexity
- Asymptotic theory
- Asymptotic expansion
- Big O notation
- Leading-order term
- Method of matched asymptotic expansions