Fixed point iteration: Rearrangement method explained

Authors Avatar by Mitul_95 (student)

Maths C3 coursework

Fixed point iteration: Rearrangement method

Another numerical method is called the rearrangement method. As the name states it requires you to rearrange the original function. From that point you can tabulate and calculate your results. Rearranging the original function is key to this otherwise you cannot repeat the number of iterations you do.

The function I will be using is: f (x) = x3+2x2-9x-11:

This image (left) shows that there are 3 roots to this equation. This can be deduced because it has 3 points of intersection with the ‘x’ axis. To find one of these roots I will use the rearrangement method. This I need to rearrange f(x) into a form so that x = g(x). To find a root with this new function I need to also have the values for y = x.

g(x) = 3√ (9x+11-2x2). The steps I followed to derive this were:

f(x) = x3 +2x2 – 9x – 11

0 = x3 +2x2 – 9x – 11

Join now!

9x + 11 – 2x2 = x3

So: 3√ (9x+11-2x2)

Now I will need to create a table to see if my ‘x’ values and g(x) values converge, where they do is the value of a root. Hence the ‘x’ values should be the same as the g(x) values or extremely close. In this case I will quote my answer to 5 s.f. I need to repeat my iterations until x and g(x) is equal to 5 s.f. I will select an arbitrary value for x and call it x0 then from that point onwards; xn+1 = g (xn)

So for ...

This is a preview of the whole essay