Fixed- Point Iteration

- also knows as one- point iteration or successive substitution

- employs a formula to predict the root by rearranging

f(x)= 0 so that: x=g(x)

- given an initial guess of the root, xi+1= g(x)

EXAMPLE: Determine the root of the equation f(x)= x2+8x+6= 0

POSSIBLE SOLUTION:
g1(x): 6/(x+8) = x
g2(x): (-x2-6)/8 = x
g3(x): √(8x+6) = x

INITIAL VALUE= 1

i xi+1 g1(x) E g2(x) E

0 x1 0.6666666666667 -0.875
1 x2 0.6923076923077 3.7037037037037 -0.845703125 3.4642032332564
2 x3 0.6902654867257 0.2958579881657 -0.8394017219543 0.750701705851
3 x4 0.6904276985743 0.0234944005012 -0.8380744063525 0.1583768209356
4 x5 0.6904148113429 0.001866592556 -0.8377960888229 0.033220199201
5 x6 0.6904158351761 0.0001482922581 -0.8377377858059 0.0069595782842
6 x7 0.690415753837 1.1781177951E-05 -0.8377255747209 0.0014576473931
7 x8 0.690415760299 9.3596337939E-07 -0.8377230173177 0.0003052802819
8 x9 0.6904157597856 7.4358239524E-08 -0.837722481718 6.3935218186E-05
9 x10 0.6904157598264 5.9074448415E-09 -0.837722369547 1.3389998485E-05
10 x11 0.6904157598232 4.6930937645E-10 -0.8377223460549 2.8042755825E-06
11 x12 0.6904157598234 3.7274597726E-11 -0.837722341135 5.8730109057E-07
12 x13 0.6904157598234 2.9588118988E-12 -0.8377223401046 1.2299881511E-07
13 x14 0.6904157598234 0 -0.8377223398888 2.5759720996E-08
14 x15 0.6904157598234 0 -0.8377223398436 5.3948614638E-09
 g3(x) E
3.741657386774
5.9944356777091 37.58116
7.3454397704748 18.39242
8.0475784037062 8.724844
8.3893162551932 4.073489
8.5507034822607 1.887415
8.6258696870568 0.871404
8.660655719774 0.401656
8.6767070803498 0.184994
8.6841036752677 0.085174
8.6875099655852 0.039209
8.6890781861301 0.018048
8.689800083376 0.008307
8.6901323733881 0.003824
8.6902853225372 0.00176