Iteration — Definition, Formula & Examples
Iteration is the process of repeating a calculation or rule, using each output as the next input, to produce a sequence of values. Each repetition is called an iterate.
Given a function and an initial value , iteration constructs the sequence where for each . The value is called the th iterate of under .
Key Formula
Where:
- = The current value at step n
- = The next value produced by applying the rule
- = The function or rule applied at each step
How It Works
Start with an initial value and a rule . Apply the rule to to get . Then apply the same rule to to get , and so on. The resulting sequence may converge to a fixed point, diverge to infinity, or cycle between values. You stop iterating when you reach a desired number of steps or when the values stabilize to a target accuracy.
Worked Example
Problem: Starting with , iterate the rule three times.
Step 1: Apply the rule to .
Step 2: Apply the rule to .
Step 3: Apply the rule to .
Answer: After three iterations the value is approximately , which is converging toward . This is an example of the Babylonian method for square roots.
Why It Matters
Iteration is the engine behind Newton's method for finding roots, recursive algorithms in computer science, and numerical methods you encounter in precalculus and calculus. Many sequences studied in courses on series and convergence are defined iteratively, so understanding this process is essential for analyzing their behavior.
Common Mistakes
Mistake: Using the original input at every step instead of feeding each new output back into the function.
Correction: Each step must use the previous output: , not . The whole point of iteration is that the input updates after every application.
