Evaluating numerical algorithm
The Fixed Point Iteration Method rewrites an equation into the self-feeding form . Starting from an initial guess , each output becomes the next input, drawing a staircase or cobweb diagram straight into the fixed point!
Find the root of starting at initial guess .
Isolate to define :
Plug initial guess into :
Feed back into :
| Iteration (k) | Input Guess (x_{k-1}) | Output Next Guess (x_k) | Difference (|x_k - x_{k-1}|) |
|---|---|---|---|
| 1 | 1.500000 | 1.357209 | 0.142791 |
| 2 | 1.357209 | 1.330861 | 0.026348 |
| 3 | 1.330861 | 1.325884 | 0.004977 |
| 4 | 1.325884 | 1.324942 | 0.000942 |
| 5 | 1.324942 | 1.324764 | 0.000178 |
| 6 | 1.324764 | 1.324730 | 0.000034 |
Continuous self-feeding evaluation quickly stabilizes at the exact root 1.32472 because the slope derivative condition holds!