What do we mean when we say a function is asymptotic?
Two functions f(x) and g(x) are said to be asymptotic if a binary relation is defined on them as thus:
f(x)∼g(x) as x→∞ if and only if limx→∞f(x)g(x)=1 (de bruijn, 1981).
In this case the functions are said to be asymptotically equivalent because the symbol ∼ defines an equivalence relation on the set of functions of x.
The domain of f and g can be defined over any set of numbers e.g R,C,Z+.
The study of asymptotes seeks to descrobe the limit behaviour of functions.
Example of a simple asymptotic functions can be obtained in the function f(n)=n2+3n, as n becomes very large the term 3n becomes small and insignificant compared to n2. The function f(n) is said to be "asymptotically equivalent to n2, as n→∞". This is often written symbolically as f(n)∼n2, which is read as "f(n) is asymptotic to n2".
An example of a special case of an asymptotic relation is the Stirling approximation n!∼√2πn(ne)n.
Properties of asymptotic functions
If f∼g and a∼b, then the following holds:
- f×a∼g×b
- f/a∼g/b
- log(f)∼log(g)
- fr∼gr for every real r
These properties allow asymptotically-equivalent functions to be freely exchanged in many algebraic expressions.
Read more on asymptote. Wikipedia: Asymptotic analysis
0 Comments
Comments