|
|
||
We construct four iterative methods for solving an equation f(x) = 0. They
are: Newton's method, in which we go from the old point to the new by finding
where the linear approximation to f at the old is zero; poor man's Newton which
is the same except we approximate the slope in the linear approximation, and
two interpolative methods.
We also raise the problem of solving two simultaneous equations in two dimensions.
13.0 Solving an Equation in One Variable
13.1 Newton's Method
13.2 Poor Man's Newton
13.4 Divide and Conquer