Double exponential function


[Image:Double Exponential Function.svg|right|thumb|320px|A double exponential function (red curve) compared to a single exponential function (blue curve).]
A double exponential function is a constant raised to the power of an exponential function. The general formula is, which grows much more quickly than an exponential function. For example, if a = b = 10:
Factorials grow faster than exponential functions, but much more slowly than double exponential functions. However, tetration and the Ackermann function grow faster. See Big O notation for a comparison of the rate of growth of various functions.
The inverse of the double exponential function is the double logarithm log. The complex double exponential function is entire, because it is the composition of two entire functions and.

Double exponential sequences

A sequence of positive integers is said to have double exponential rate of growth if the function giving the th term of the sequence is bounded above and below by double exponential functions of.
Examples include
Aho and Sloane observed that in several important integer sequences, each term is a constant plus the square of the previous term. They show that such sequences can be formed by rounding to the nearest integer the values of a double exponential function with middle exponent 2.
Ionaşcu and Stănică describe some more general sufficient conditions for a sequence to be the floor of a double exponential sequence plus a constant.

Applications

Algorithmic complexity

In computational complexity theory, 2-EXPTIME is the class of decision problems solvable in double exponential time. It is equivalent to AEXPSPACE, the set of decision problems solvable by an alternating Turing machine in exponential space, and is a superset of EXPSPACE. An example of a problem in 2-EXPTIME that is not in EXPTIME is the problem of proving or disproving statements in Presburger arithmetic.
In some other problems in the design and analysis of algorithms, double exponential sequences are used within the design of an algorithm rather than in its analysis. An example is Chan's algorithm for computing convex hulls, which performs a sequence of computations using test values hi = 22i, taking time O for each test value in the sequence. Because of the double exponential growth of these test values, the time for each computation in the sequence grows singly exponentially as a function of i, and the total time is dominated by the time for the final step of the sequence. Thus, the overall time for the algorithm is O where h is the actual output size.
In a different direction, Witteveen & Jeffery showed that any QMA protocol can be amplified to have doubly-exponential error.

Number theory

Some number theoretical bounds are double exponential. Odd perfect numbers with n distinct prime factors are known to be at most, a result of Nielsen.
The maximal volume of a polytope in a d-dimensional integer lattice with k ≥ 1 interior lattice points is at most
a result of Pikhurko.
The largest known prime number in the electronic era has grown roughly as a double exponential function of the year since Miller and Wheeler found a 79-digit prime on EDSAC1 in 1951.

Theoretical biology

In population dynamics the growth of human population is sometimes supposed to be double exponential. Varfolomeyev and Gurevich experimentally fit
where N is the population in millions in year y.

Physics

In the Toda oscillator model of self-pulsation, the logarithm of amplitude varies exponentially with time, thus the amplitude varies as double exponential function of time.
Dendritic macromolecules have been observed to grow in a doubly-exponential fashion.