(page 39 example 1.4):

Need help with programming part pls

Fixed-point Iteration Consider f(x) = 2x2 - 6x - 1. Suppose the three roots are known as ri = -1.641783527452926, r2 = -0.168254401764093, r3 = +1.810037929236685. Written part (a) Design gi(x), i = 1, 2, 3, for finding roots ri, i = 1,2,3, by Fixed- point iteration (FPI). That is, g(r:) = ri, i = 1, 2, 3. (b) Verify that the gs you designed generate convergent sequences ap- proaching the three roots correspondingly. You may use the same g to find different roots or different g's to find different roots. The g's you are using should generate reasonably fast convergent sequences. That is, the total number of fixed-point iterations cannot exceed 30. Newton's method is NOT allowed. Programming part Write a MATLAB program to run FPI for each g(t) you derived from above. Print your results in the same format as shown in the text (page 39 example 1.4). Use %13.9f to show the floating point numbers. Use while to do the iteration with stopping criterion In - r|