This page consists of two major sections, analytic iteration methods which allow "nice" functions to be iterated non-integer number of times in such a way that the general iterate is real-analytic or complex-analytic with respect to t in f t(x), and non-integer tetration methods which only apply to tetration (and iterated exponentials), not the iteration of any function. Before we get to these sections, however, it should be noted that one approach is not covered in these sections, namely continuous iteration. Continuous iteration is the approach of finding a continuous bivariate function that describes the iterates of a univariate continuous function such that the bivariate function is also continuous. This is very easy to do, and can be done with line segments or Lagrange interpolating polynomials. Continuous iteration is by no means unique to a given function, but in many cases a unique analytic iterate exists for a given function, which also makes it harder to find. One such method for interpolating integer iterates (but not obeying the functional equation f n(x) = f(f n-1(x)), which is fundamental to the concept of iteration) is S. C. Woon's formula:
Since S. C. Woon's formula does not satisfy the functional equation of iteration in general, one could say that it can't be called "iteration" at all. His formula is certainly analytic, and it corresponds to integer iterates, but together it does not constitute analytic iteration, because although it is "analytic" it is not "iteration". There is a posibility, however, that there exists a w such that S. C. Woon's formula does satisfy the functional equation of iteration, but how such a w could be found is unknown.
The other continuous iteration methods described earlier can also suffer from this problem of only satisfying "analicity" or "iteration" requirements but not both. For example for a piecewise defined function with a line-segment between x and f(x) and defined elsewhere by f n(x) = f(f n-1(x)) will of course satisfy this "iteration" requirement, but it will fail to be analytic in general. This theme is prevalent thoughout all methods discussed here, where the best methods are the ones that produce what seems to be a unique solution are those that are both "analytic" and "iteration".
|
Turns composition M[ f ·g] into matrix multiplication M[ f ] M[g]. |
|
Solve the FE: f(x) = gn(x) (for g). |
|
Solve the FE: A[f](f(x)) = A[f](x) + 1 (for A). |
|
Solve the FE: S[f](f(x)) = c S[f](x) (for S). |
|
Solve the FE: B[f](f(x)) = (B[f](x))c (for B). |
|
Solve the Abel linearization equation (used in my paper). |
|
Turn the composition B[ f ·g] into B[g] B[ f ]. |
|
Turn the composition M[ f ·g] into M[ f ] M[g]. |
|
Interpolate points of the form: (x0, x1) ... (xn, f (x0)). |
|
Iterates any operator complex-s times. |