Other Rearrangements

Iteration algorithm with the form $x=g(x)$
\fbox{\parbox{13cm}{
To determine a root of $f(x) = 0$, given a value $x_1$ rea...
...l$\\
Set $x_l = g(x_1)$\\
Until $\vert x_1 - x_2\vert < tolerance value$\\
}}
The method may converge to a root different from the expected one, or it may diverge. Different rearrangements will converge at different rates.
Figure 3: The fixed point of $x=g(x)$ is the intersection of the line $y=x$ and the curve $y = g(x)$ plotted against x.
\includegraphics[scale=1]{figures/1.12.ps} \includegraphics[scale=1]{figures/1.13.ps}
\includegraphics[scale=1]{figures/1.14.ps}  
2004-10-18