This process may be iterated until finding univariate polynomials. In numerical analysis, fixed-point iteration is a method of computing fixed points of iterated functions. So the two iterated integrals are different. Two important functionals can be defined in terms of iterated functions. Most published research historically has focused on the convergence of the infinitely iterated exponential function. The process is then iterated until it converges. In mathematics, tetration (or hyper-4) is an operation based on iterated, or repeated, exponentiation. This definition can be iterated a finite number of times. The process is iterated on, in the same manner as general data clustering algorithms. The original statement of the law of the iterated logarithm is due to A. Ya. Sets are unordered collections that can be iterated and contain each element at most once. And of course this diagonalization process can be iterated too. This process is iterated until convergence. Next, a random sampling of formula 1 points are iterated through the Mandelbrot function. The homeomorphisms may be iterated, resulting in an iterated function system.