The iteration (of Latin iterare, "„repeat "“) is a term from numeric mathematics and calls itself a method, the solution of a computing problem gradually to approximate but purposefully. It exists in the repeated application of the same computing procedure.

One mostly iterates with feedback: The results of an iteration step are taken as initial values of the next in each case step - until the result (and/or change of an inventory size) places contently. An example of it is the Newton procedure. Sometimes one sets the next step from the results of the previous two steps (or before still more steps), for example with the Regula Falsi.

It must be still proven afterwards that the iteration sequence converges and that the limit value agrees with the looked for solution. The speed of the convergence is a measure for it how useful the iteration method is.

Application of the method

• In cases, in which the result is not closed calculable (for example transcendental Kepler equation or generally optimization procedure) or be improved must (sets of equations);
• Frequent already is a good approximation satisfying. Particularly for application problems the input data can be faulted, then the accurate solution of the given problem is not necessarily better than their approximation. The iterative method is attractive thus if it supplies a good approximation faster, than the computation of the accurate solution needs.
• Some functions on pocket calculators or Fraktale are for example iterative computed.

Example: Solution of an equation

The zero of an equation is iterative often more rapidly found than with accurate, closed formulas:

1. Try, where the zero of y = f (x) lies approximately
2. twice computation of y with x1 and x2
3. Better value x3 with the Regula Falsi, which accepts an approximately straight piece of curve:
4. x_3 = x_2 + y_2 \ cdot \ frac {x_2 - x_1} {y_2 - y_1} and repeats, to exactly enough.

Efficiency versus elegance

As algorithm the iteration is often more efficient than the more elegant recursive way. Examples are the computations of the faculty, the Fibonacci sequence with the golden section as limit value as well as the Wallis product with the circle number of pi as limit value.

Iteration in computer science

Apart from mathematical iterative problem solution in computer science also spoken of iteration, if an access iterative, i.e. gradually, and/or repeats, on data structures one takes place. (e.g.: FOR loop) here stands the term data structure for collections of objects, object references or data types. Usually in the following it concerns with these collections (English collections) arrays, lists, pairs of key values (map, Hashes) or quantities (sets).

The moreover one iteration can being designated regarding zones in the Domain Name service (DNS) than "“referring"”.

Iteration in the software technology

In the software technology an iteration designates an individual development cycle, depending upon model beginning with planning, analysis or draft, ending with implementation, test or maintenance.

See also

• Iterator
• Procedural model (software)
• Extreme Programming
• Rationally Unified Process

Articles in category "Iteration"

We found here 2 articles.

Related Websites

We found here 6 related websites.

• 1.1 Iteration
  This page is a part of The Chaos Hypertextbook


• Graphical Iteration
  This applet demonstrates graphical iteration. In this example, we use the quadratic iterator xn+1 = fa(xn) , fa(x) = ax(1-x), 0<=a<=4 ...


• Infinity and Iteration Discussion
  First a new word: Repeating a set of rules or steps over and over is called iteration. Each step is an iterate. Student: So when we ran the tortoise and ...


• iteration
  Definition of iteration, possibly with links to more information and implementations.


• Iteration - Wikipedia, the free encyclopedia
  The word iteration is sometimes used in everyday English with a meaning virtually ... Iteration in mathematics may refer to the process of iterating a ...


• Looping and Iteration
  Looping and Iteration. ... This chapter will look at C's mechanisms for controlling looping and iteration. Even though some of these mechanisms may look ...