• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

Fixed point iteration: Rearrangement method explained

Extracts from this document...

Introduction

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. image00.png

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

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

...read more.

Middle

-0.0613

8

-3.72855

-3.69288

-0.0357

9

-3.69288

-3.67197

-0.0209

10

-3.67197

-3.65967

-0.0123

11

-3.65967

-3.65241

-0.0073

12

-3.65241

-3.64811

-0.0043

13

-3.64811

-3.64558

-0.0025

14

-3.64558

-3.64407

-0.0015

15

-3.64407

-3.64318

-0.0009

16

-3.64318

-3.64266

-0.0005

17

-3.64266

-3.64234

-0.0003

18

-3.64234

-3.64216

-0.0002

19

-3.64216

-3.64205

-0.0001

20

-3.64205

-3.64199

-0.0001

21

...read more.

Conclusion

Again the generic formula I will use is: xn+1 = g (xn)

Iterations

x

g(x)

∆x

1

-5

-9.555555556

4.5556

2

-9.55556

-77.87639079

68.3208

3

-77.8764

-51131.22153

########

4

-51131.2

-1.48525E+13

########

5

-1.5E+13

-3.64045E+38

########

6

-3.6E+38

-5.3607E+114

########

7

-5E+114

#NUM!

#NUM!

From this table I can see that ∆x iscontinually increasing. This shows that the difference between x and g(x) is getting larger. Hence the values are diverging. From this I can deduce that the root cannot be obtained with this new form of g(x). Again the magnitude of g’(x) is key. If I look at the graph I can see why there is no convergence: This shows that at the point of intersection the gradient of g(x) is greater than the gradient of y = x. since the gradient of y = x is always 1 it means that the gradient of g(x) at the point of intersection is greater than 1. This means that if I was to continue iterating with my calculations I would get diverging values: image04.pngimage05.png

...read more.

This student written piece of work is one of many that can be found in our AS and A Level Core & Pure Mathematics section.

Found what you're looking for?

  • Start learning 29% faster today
  • 150,000+ documents available
  • Just £6.99 a month

Not the one? Search for your essay title...
  • Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

See related essaysSee related essays

Related AS and A Level Core & Pure Mathematics essays

  1. Marked by a teacher

    The Gradient Function

    5 star(s)

    of the chord PQ also becomes closer to the actual gradient of PQ. Here, he tends to 0, so therefore 2x + h = 2x + 0 = 2x. Therefore the gradient is 2x. According to the previous values used in the increment method, x� is equal to 2x, so

  2. Numerical Method of Algebra.

    -7.1055E-06 -0.66513 1.22584E-05 -0.66512 3.16215E-05 -0.66511 5.09839E-05 Tbl DS-06: Step 6 I have stopped at Step 6, as it will get more and more numbers behind the decimal point if I continue on. However, I haven't got to an answer that I satisfy.

  1. MEI numerical Methods

    Fixed point iteration: If we apply the first order of convergence principles to this method we get the following: The first order of convergence for fixed point iterations remains relatively constant, this value is 0.786 however, bear in mind that the amount of iterations used here is once again loads relative to secant and method of false position.

  2. Arctic Research (Maths Coursework)

    now inform that if the researchers are to visit each observation site once and return to base camp after each trip, whilst flying against 30 km/h westerly wind, they will have to expect to travel for a total of 2.384 hrs (2.384 � 60 = 143.04 minutes)

  1. The Gradient Fraction

    I will try and investigate with more methods. 1. y=x 2. y=2x 3. y=4x+1 First I will start off by drawing a table of values, and then I will investigate on finding the gradients of different 'x' values. 'y=x' solved by 'Triangle Method' x -4 -3 -2 -1 0 1

  2. maths pure

    = (x-1)(x+2)2 but since there is no change of sign, it will not be detected by the decimal search. 2. Newton-Raphson Method The Newton-Raphson Method states that if a is a first approximation to a root of f(x) = 0, a better approximation is, in general,???

  1. Numerical Method (Maths Investigation)

    The more decimal place the more accurate the answer of the root is. X Y -0.69 -0.050563533 -0.68 -0.029629888 -0.67 -0.009507116 -0.66 0.009848393 -0.65 0.028477721 -0.64 0.046419535 -0.63 0.063710194 -0.62 0.080383854 -0.61 0.096472572 Tbl DS-03: Step 3 X Y -0.669 -0.007537736 -0.668 -0.005575983 -0.667 -0.003621818 -0.666 -0.001675197 -0.665 0.000263921 -0.664

  2. Functions Coursework - A2 Maths

    a root of the equation f(x)=0 lies in the interval [1.87,1.88]. The rest of the method could also be illustrated graphically in this way. The next table show values of f(x) at values of x from 1.87 to 1.88, with intervals of 0.001.

  • Over 160,000 pieces
    of student written work
  • Annotated by
    experienced teachers
  • Ideas and feedback to
    improve your own work