Fixed-Point Iteration To find a solution to p = g(p) given an initial approximation po: INPUT initial approximation po; tolerance TOL; maximum number of iterations No. OUTPUT approximate solution p or message of failure. Step 1 Seti 1. Step 2 While i No do Steps 3-6. Step 3 Set p = g(po). (Compute pi.) Step 4 If p-pol < TOL then OUTPUT (p); (The procedure was successful.) STOP. Step 5 Set i=i+1. Step 6 Set pop. (Update po.) Step 7 OUTPUT ("The method failed after No iterations, No =', No); (The procedure was unsuccessful.) STOP. We are give the algorithm t the fixed point iteration, we'll understand this using an exampe given below: Find the root of x+-x-10=0 Consider g(x)=(x+10)1/4 let the initial guess xo be 4.0 i 0 1 xj 4.0 1.93434 2 3 4 5 6 1.85866 1.8557 1.85559 1.85558 1.85558 That is for g(x) = (x + 10)1/4 the itirative process is converged to 1.85558.