• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month
Page
  1. 1
    1
  2. 2
    2
  3. 3
    3
  4. 4
    4
  5. 5
    5
  6. 6
    6
  7. 7
    7
  8. 8
    8
  9. 9
    9
  10. 10
    10
  11. 11
    11
  12. 12
    12
  13. 13
    13
  14. 14
    14

Numerical solutions of equations

Extracts from this document...

Introduction

Kosturi Ash 12/3

A2 Mathematics Coursework C3

Year 12

Numerical solutions of equations

Solving 0 = x5+x-5 using the “Change Of Sign” Method

The method I will use to solve 0 = x5+x-5 is the Change of Sign Method involving the Decimal Search method. I have drawn this graph using the Autograph Software, and the print screen of this is below:

image00.png

image01.png

From my graph above, I can see that the root of this equation is between x =1 and x = 1.5. The table of x values and f(x) values is shown below. I can work out the f(x) values by substituting the x-values into the equation.

x

1

1.1

1.2

1.3

1.4

1.5

f(x)

-3

-2.28949

-1.31168

0.01293

1.77824

4.09375

From my table of values above, it is clear that the change of sign from negative to positive occurs between x = 1.2 and x = 1.3. So, I can narrow these values down further to find another change of sign.

x

f(x)

1.21

-1.19626

1.22

-1.07729

1.23

-0.95469

1.24

-0.82837

1.25

-0.69824

1.26

-0.56420

1.27

-0.42616

1.28

-0.28403

1.29

-0.13769

1.30

0.01293

I can see that the change of sign is between x = 1.29 and x = 1.30.

x

f(x)

1.291

-0.12283

1.292

-0.10792

1.293

-0.09296

1.294

-0.07797

1.295

-0.06293

1.296

-0.04784

1.297

-0.03271

1.298

-0.01754

1.299

-0.00233

1.300

0.01293

The change of sign is in the interval [1.299, 1.300]

x

f(x)

1.2991

-0.000805

1.2992

0.000720

1.2993

0.002244

The root of this equation lies in the interval [1.2991, 1.2992]. This means that I can take the root to be x = 1.29915(5 decimal places).

...read more.

Middle

3+6x2+3

The iterative formula is: xn+1 = xn- f(xn)

                                       f’(xn)

So the iterative formula for this equation is: xn+1 = xn- xn4+2xn3+3xn-4

                                                              4xn3+6xn2+3

On my diagram of this function, I have taken my x1 value to be about –1.6

x1 = -1.6

x2 = 3.682591

x3 = 2.658976

x4 = 1.899865

x5 = 1.353797

x6 = 1.003365

x7 = 0.847116

x8 = 0.819172

x9 = 0.818390

x10 = 0.818389

x11 = 0.818389

From that, I can quite clearly see that there is a convergence beginning to show towards the positive root. However, my aim was to find the negative root, and I could not find it. Therefore, the Newton-Raphson method has failed to find that particular root, even though the starting value was close to it.

Another example where the Newton-Raphson would not work is the function (x+21/2)1/2 ln (x+21/2) = 0. The graph and calculations of this is below:

image07.png

The function is: (x+21/2)1/2 ln (x+21/2) = 0

f’(x) = ((x+21/2)1/2X 1                 ) + (ln (x+21/2) X ½ (x+21/2) -1/2)

x + 2 1/2

(x+21/2)1/2   + ln (x+21/2) (x+21/2) -1/2

(x+21/2)1                2

        1         + ln(x+21/2)

                  (x+21/2)1/2               2(x+21/2)1/2

=        2+ ln((x+21/2)

                2(x+21/2)1/2

The iterative formula for the Newton-Raphson method is:

        xn+1 = xn = f’(xn)

                      f’(xn)

        x n+1 = xn  - 2(x+21/2)ln(x+21/2)

 2 + ln(x+21/2)

I choose my starting value of x (x1) to beabout –1.3.

x1 = -1.3

x2 = -4.22079

x3 = not defined

x4 =

Another example where the Newton-Raphson method would fail is with the function x3-5x+0.1=0.

...read more.

Conclusion

Decimal Search method.

Both the Newton-Raphson method and the Rearrangementmethod were fixed point estimates and involved an iterative process. Therefore, these methods were very similar. However, these two methods differ because there is a specific formula for the Newton-Raphson method. Although the Newton-Raphson method was more complicated than the Rearrangement method, it gave a much more rapid rate of convergence. In fact, the Newton-Raphson method gave the most rapid rate of convergence to 6 decimal places, whereas, for the Decimal Search method, it took me very many calculations to converge to 5 decimal places. So, the Decimal Search method gave the slowest rate of convergence. These two methods were not as time-consuming as the Decimal Search method because it did not involve having to find a change of sign in many particular intervals; there was already a convergence towards the particular root I wanted. However, it was really easy to make mistakes on the calculator due the order of the terms in the iterative formulae.

I used the Autograph software to draw these graphs. This was so much quicker than drawing the graphs by hand, and Excel does not have the facilities to draw such advanced graphs. The Autograph software was very easy to use and it also helped me to find out which rearrangement of a function were suitable (when carrying out the Rearrangement method) and in which interval the root was in (when using the Decimal Search method).

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

    C3 Coursework - different methods of solving equations.

    5 star(s)

    Fixed point Iteration This method is probably the hardest method to use out of the three. It involves rearranging a y = f(x) formula into x = g(x), by using any one of the x values in the f(x) formula.

  2. Marked by a teacher

    The Gradient Function

    5 star(s)

    -1 2 0.5 -0.25 3 0.333333 -0.111111111 4 0.25 -0.0625 I predict that the gradient function for when n=-1 = -x -2, in correspondence to the formula nx n-1. I can tell whether these data do in fact agree with this gradient function, but I shall binomially expand this to verify this is the case: 1 .

  1. Marked by a teacher

    Estimate a consumption function for the UK economy explaining the economic theory and statistical ...

    3 star(s)

    The same conclusion can be gained from the other tests. Such as the p-test, the higher the value of t-test the lower the value of p-test. Thus, the consumption function which incorporating inflation and error correction is successful. The predictions from this equation are shown in Figure 7(a).

  2. Numerical integration can be described as set of algorithms for calculating the numerical value ...

    The formula can be derived analytically and has the advantage of involving the same amount of arithmetic as the trapezium rule with the addition of providing more accurate results. Below is a diagram of incorporating Simpsons rule: The interval a to b is divided into 2n strips, each of width h.

  1. Solving Equations Using Numerical Methods

    I will now try starting slightly further away from the middle root to see if I can get the graph to converge to the first root. My estimate and starting value will be -2.1. n Xn 1 -2.1 2 -2.19 3 -2.502 4 -3.79 5 -13.48 6 -612.2 7 overflow

  2. Numerical Method (Maths Investigation)

    For DECIMAL SEARCH X F(X) 1.51211 =EXP(X_)-3*X_ 1.51212 =EXP(X_)-3*X_ 1.51213 =EXP(X_)-3*X_ 1.51214 =EXP(X_)-3*X_ 1.51215 =EXP(X_)-3*X_ 1.51216 =EXP(X_)-3*X_ 1.51217 =EXP(X_)-3*X_ 1.51218 =EXP(X_)-3*X_ 1.51219 =EXP(X_)-3*X_ Tbl AppA-01: Formula used in Microsoft Excel XP for decimal search From the table above, under the f(X)-value column, it all contains the formula =EXP(X_)-3*X_.

  1. I am going to solve equations by using three different numerical methods in this ...

    -0.345008342 10 -0.27117 -0.34500834 -0.345008188 11 -0.27117 -0.34500819 -0.34500823 12 -0.27117 -0.34500823 -0.345008218 13 -0.27117 -0.34500822 -0.345008221 14 -0.27117 -0.34500822 -0.345008221 15 -0.27117 Root is -0.3450082 to 7d.p. Error bounds is -0.3450082�0.00000005. Root bounds is -0.34500825<x<-0.34500815. Check X Y -0.34500825 -0.345008213 -0.34500815 -0.34500824 X g'(x)

  2. MEI numerical Methods

    If I was to do this on a calculator, fixed point iteration would be fine as all you would have to do is continuously press the = as it is a recurrence relation. However to use a calculator for the method of bisection, would be very tedious as you would

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