6.1.2 Algorithm for Fixed-Point Iteration The computer algorithm for fixed-point iteration is extremely simple. It consists of a loop to iteratively compute new estimates until the termination criterion has been met. Figure 6.4 presents pseudocode for the algorithm. Other open methods can be pro- grammed in a similar way, the major modification being to change the iterative formula that is used to compute the new root estimate. 6.2 THE NEWTON-RAPHSON METHOD FUNCTION Fixpt(x0, es, imax, iter, ea) xr = x0 iter = 0 DO xrold = xr xr = g(xrold) iter = iter + 1 IF xr 0 THEN xr-xrold ea = 100 xr FIGURE 6.4 Pseudocode for fixed-point iteration. Note that other open methods can be cast in this general format. END IF IF ea es OR iterimax EXIT END DO Fixpt = xr END Fixpt 151