Asymptotic analysis

value that a function (or sequence) approaches as the argument (or index) approaches some value

approximation for factorials

form of Landau notation representing asymptotically equivalent or slower growth

infinite series that is not convergent

mathematical methods used to find an approximate solution to a problem which cannot be solved exactly

theorem

method for finding approximate solutions to linear differential equations with spatially varying coefficients

method for analysis of algorithms

field of mathematics studying the limiting behavior of functions and sequences

series which gives an approximation to a function as the argument tends to some point

the inverse function to a tower of powers

lemma that the Fourier transform of an L¹ function vanishes at infinity

technique used to approximate integrals

on divide and conquer algorithms where the sub-problems have substantially different sizes

L-notation is an asymptotic notation analogous to big-O notation, denoted as L_n[\alpha,c] for a bound variable n tending to infinity. Like big-O notation, it is usually used to roughly convey the rate of growth of a function, such as the computational complexity of a particular algorithm.

algorithm asymptotically very efficient but practically never so due to infeasibly large constants

Mathematical technique

branch of probability theory

A mathematic operator acting on a given space of sequences

extension of Laplace's method for approximating integrals