Iterative Process
Iterative Process
An algorithm which involves repeated use of the same formula or steps. Typically, the process begins with a starting value which is plugged into the formula. The result is then taken as the new starting point which is then plugged into the formula again. The process continues to repeat.
Examples of iterative processes are factor trees, recursive formulas, and Newton’s method.
Key Formula
xn+1=f(xn)
Where:
- xn = The current value at step n
- xn+1 = The next value, produced by applying the rule to the current value
- f = The function or rule applied at each step
- n = The step number (starting from 0 or 1)
Worked Example
Problem: Use the iterative formula x_{n+1} = (x_n + 5) / 2 with starting value x_0 = 1 to find x_1, x_2, x_3, and x_4. Describe what happens to the values.
Step 1: Start with the given initial value.
x0=1
Step 2: Apply the formula to find x_1. Substitute x_0 = 1 into the rule.
x1=21+5=26=3
Step 3: Now use x_1 = 3 as the input to find x_2.
x2=23+5=28=4
Step 4: Continue the process with x_2 = 4.
x3=24+5=29=4.5
Step 5: One more iteration using x_3 = 4.5.
x4=24.5+5=29.5=4.75
Answer: The sequence is 1, 3, 4, 4.5, 4.75, ... The values are converging toward 5. If the process settles at a fixed value L, then L = (L + 5)/2, giving L = 5.
Another Example
This example shows a real-world application of iteration — Newton's method — where the iterative formula is more complex and convergence is very rapid, unlike the simple linear formula in the first example.
Problem: Use Newton's method to approximate the square root of 10 by solving x² − 10 = 0. Start with x_0 = 3 and perform two iterations.
Step 1: Newton's method formula for f(x) = x² − 10 is derived from the general Newton's formula x_{n+1} = x_n − f(x_n)/f'(x_n). Since f'(x) = 2x, the iterative rule becomes:
xn+1=xn−2xnxn2−10=2xnxn2+10
Step 2: Start with x_0 = 3 and compute the first iteration.
x1=2⋅332+10=69+10=619≈3.16667
Step 3: Use x_1 = 19/6 to compute the second iteration.
x2=2⋅(19/6)(19/6)2+10=38/6361/36+360/36=38/6721/36=228721≈3.16228
Step 4: Compare with the actual value. The true value of √10 ≈ 3.16228. After just two iterations, the approximation is accurate to five decimal places.
10≈3.16228
Answer: After two iterations of Newton's method starting from x_0 = 3, we get x_2 ≈ 3.16228, which matches √10 to five decimal places.
Frequently Asked Questions
What is the difference between an iterative process and a recursive process?
The terms overlap significantly. A recursive formula defines each term using previous terms (e.g., a_{n+1} = 2a_n + 1), and computing its values is an iterative process. However, 'iteration' emphasizes the repeated mechanical action of applying a rule, while 'recursion' emphasizes how the definition refers back to itself. In programming, recursion calls a function within itself, while iteration uses loops.
When does an iterative process converge?
An iterative process converges when the values approach a fixed number as you perform more iterations. For the formula x_{n+1} = f(x_n), convergence to a fixed point L requires that |f'(L)| < 1 near L. If the values keep growing, oscillating wildly, or never settle, the process diverges.
How do you find the fixed point of an iterative formula?
A fixed point is a value L where applying the formula returns the same value: L = f(L). To find it algebraically, replace both x_{n+1} and x_n with L, then solve the equation. For example, if x_{n+1} = (x_n + 5)/2, set L = (L + 5)/2 and solve to get L = 5.
Iterative Process vs. Direct (Closed-Form) Solution
| Iterative Process | Direct (Closed-Form) Solution | |
|---|---|---|
| Definition | Applies a rule repeatedly, using each output as the next input | A single formula that gives the answer in one step |
| Example | x_{n+1} = (x_n + 5)/2 starting from x_0 = 1 | The nth term of an arithmetic sequence: a_n = a_1 + (n−1)d |
| When to use | When no closed-form exists, or when approximating solutions to equations | When you can express the answer as an explicit formula of n |
| Speed to answer | Requires multiple steps; more steps often means more accuracy | One calculation gives the exact answer immediately |
| Accuracy | Approximate (improves with more iterations) | Exact |
Why It Matters
Iterative processes appear across mathematics courses — from simple sequences and series in algebra to Newton's method in calculus and numerical methods in engineering. Many real-world equations cannot be solved with a neat formula, so iteration is often the only practical way to find approximate solutions. Understanding iteration also prepares you for computer science, where loops and repeated calculations form the backbone of most algorithms.
Common Mistakes
Mistake: Using the original starting value every time instead of the most recent output.
Correction: Each iteration must feed the latest result back into the formula. For x_{n+1} = f(x_n), you use x_1 to find x_2, then x_2 to find x_3 — not x_0 each time.
Mistake: Assuming that every iterative process will converge to a fixed answer.
Correction: Some iterative formulas diverge (values grow without bound) or oscillate. Always check whether the sequence is settling down. Convergence depends on the properties of the function and the choice of starting value.
Related Terms
- Algorithm — An iterative process is a type of algorithm
- Formula — The rule applied at each iteration step
- Recursive Formula — Defines sequences using an iterative rule
- Newton's Method — A key iterative method for finding roots
- Factor Tree — Uses repeated factoring as an iterative process
- Sequence — Iteration generates sequences of values
- Convergence — Describes when iteration approaches a limit