• 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
  15. 15
    15
  16. 16
    16
  17. 17
    17
  18. 18
    18
  19. 19
    19
  20. 20
    20
  21. 21
    21
  22. 22
    22
  23. 23
    23
  24. 24
    24

In this piece of coursework, I will use three different methods (Change of Sign, Newton-Raphson, and the Rearrangement Method) to find the roots of a series of different equations. The number of roots found differs from method to method.

Extracts from this document...

Introduction

Colin Tebbett

Pure Mathematics 2: Coursework Assessment

In this piece of coursework, I will use three different methods (Change of Sign, Newton-Raphson, and the Rearrangement Method) to find the roots of a series of different equations.  The number of roots found differs from method to method.  A comparison of the three methods will be made at the end of the report.

Change of Sign Method

Equation:        x3 + x2 - 2x + 3 = 0

Using the above equation, the function f(x) = x3 + x2 - 2x + 3 may be generated.

This may be expressed in graphical form (see page 2)

This may be solved using the method of Interval Bisection (see page 3)

image00.jpg

<--------Interval------->

Mid Point

Height at A

Height at B

Height at M

Curve

a

b

Mid Point

f(a)

f(b)

f(m)

y=x^3+x^2-2*x+3

-3

-2

-2.5

-9

3

-1.375

-2.5

-2

-2.25

-1.375

3

1.171875

-2.5

-2.25

-2.375

-1.375

1.171875

-0.005859375

-2.375

-2.25

-2.3125

-0.005859375

1.171875

0.606201172

-2.375

-2.3125

-2.34375

-0.005859375

0.606201172

0.306060791

-2.375

-2.34375

-2.359375

-0.005859375

0.306060791

0.151584625

-2.375

-2.359375

-2.3671875

-0.005859375

0.151584625

0.073235035

-2.375

-2.3671875

-2.37109375

-0.005859375

0.073235035

0.033781111

-2.375

-2.37109375

-2.373046875

-0.005859375

0.033781111

0.013984211

-2.375

-2.373046875

-2.374023438

-0.005859375

0.013984211

0.004068256

-2.375

-2.374023438

-2.374511719

-0.005859375

0.004068256

-8.94099E-04

-2.374511719

-2.374023438

-2.374267578

-8.94099E-04

0.004068256

0.001587443

-2.374511719

-2.374267578

-2.374389648

-8.94099E-04

0.001587443

3.46763E-04

The root 'x' can be seen to be in between

-2.374511719

and

-2.374267578

ie.

-2.374511719

<    x    <

-2.374267578

An estimate for the root is x=

-2.374389648

±

1.22070E-04

or

-2.3744

(correct to 4 decimal places)

The Change of Sign Method can, however, fail when certain equations must be solved.

...read more.

Middle

2.409090909

2.936232156

12.41115702

2.172510859

X3

2.172510859

0.39126991

9.159410291

2.129793053

X4

2.129793053

0.011815313

8.608055342

2.128420465

X5

2.128420465

1.20350E-05

8.590521025

2.128419064

X6

2.128419064

1.25322E-11

8.590503134

2.128419064

X7

2.128419064

-1.77636E-15

8.590503134

2.128419064

An estimate for root 'c' is

2.128419064

or

2.12842

(correct to 5 decimal places)

Error bounds for ‘c’

The value found in the spreadsheet above for root ‘c’ is 2.12842 (5 d.p.)

Because this value is to 5 decimal places, the error boundaries are as follows:

2.128415        <        c        <        2.128425

We can check that this is correct using the Change of Sign Method (Interval Bisection) as described above (see page 11).

<--------Interval------->

Mid Point

Height at A

Height at B

Height at M

Curve

a

b

Mid Point

f(a)

f(b)

f(m)

y=x^3-5*x+1

2

3

2.5

-1

13

4.125

2

2.5

2.25

-1

4.125

1.140625

2

2.25

2.125

-1

1.140625

-0.029296875

2.125

2.25

2.1875

-0.029296875

1.140625

0.530029297

2.125

2.1875

2.15625

-0.029296875

0.530029297

0.244049072

2.125

2.15625

2.140625

-0.029296875

0.244049072

0.105808258

2.125

2.140625

2.1328125

-0.029296875

0.105808258

0.037865162

2.125

2.1328125

2.12890625

-0.029296875

0.037865162

0.00418669

2.125

2.12890625

2.126953125

-0.029296875

0.00418669

-0.012579434

2.126953125

2.12890625

2.127929688

-0.012579434

0.00418669

-0.00420246

2.127929688

2.12890625

2.128417969

-0.00420246

0.00418669

-9.40741E-06

2.128417969

2.12890625

2.128662109

-9.40741E-06

0.00418669

0.002088261

2.128417969

2.128662109

2.128540039

-9.40741E-06

0.002088261

0.001039331

The root 'x' can be seen to be in between

2.128417969

and

2.128662109

ie.

2.128417969

<    x    <

2.128662109

An estimate for the root is x=

2.128540039

±

1.22070E-04

or

2.12854

(correct to 5 decimal places)

The Newton-Raphson Method can, however, fail when certain equations must be solved.  Below is an example:

Equation:        5 – 1/((x – 1)2 + 0.2)) = 0

Function:        f(x) = 5 - 1/((x – 1)2 + 0.2))

This cannot be solved using the Newton-Raphson Method because the gradient of the tangent at the starting point is very shallow.  Therefore the method makes the tangent diverge away from the root.

The function expressed in graphical form is shown on page 13.

An attempt to solve the equation using the Newton-Raphson Method is shown below:

If y = 5 – 1/((x – 1)2 + 0.2))

Then dy/dx = (50 * (x - 1)) / (5x2 – 10x + 6)2

Estimates:

...read more.

Conclusion

The Newton-Raphson method, however, took 30 steps and still was not fully finished.  This is time-consuming and unnecessary.

The Rearrangement Method took 10 steps in order to prove success or express failure.  It also involved the use of manual calculations, which are relatively slow when compared to the use of a spreadsheet.

Thus, the Change of Sign method was the easiest and quickest method to use.

The Hardware available plays a large part in the ease of each method.  A computer helps greatly, as complex and repetitive calculations can be done easily.  This is helpful in all three methods, as may be seen above.

Graphical calculators can also make the methods easier to complete.  Methods that are graph-intensive, such as the Rearrangement Method, can either be completed or checked using a graphical calculator.

Other Hardware can also be used, however, these are generally large, specialised machines that are specifically designed to find the root to complex equations.

The Software available also can make different methods a lot easier.  Spreadsheets (using Microsoft Excel) and Graphs (predominantly drawn using Autograph) can be incorporated into text documents (Microsoft Word) quickly and clearly, and thus reference can be made to them throughout a report.  Difficult equations (such as that used in Rearrangement 2 in the Rearrangement Method) can be differentiated using Derive, which is helpful as it saves time and prevents mistakes.  Therefore, the software available plays a large part in the ease of which each method can be completed.

        -  -

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

    function. x= x5 + 6x2 + 4 --> g(x) = x5 + 6x2 + 4 g'(x) = 5x4 + 12x From this graph, you can se that the starting x value for the iteration would be -2 G'(x) = 5(-2)4 + 12(-4) G'(x) = 32 --> 32 > 1 there fore this function should either overflow or diverge away.

  2. Sequences and series investigation

    2(n -1) (n - 1) + 2n - 1 2) 2(n2 - 2n + 1) + 2n - 1 3) 2n2 - 4n + 2 + 2n - 1 4) 2n2 - 2n + 1 Therefore my final equation is: 2n2 - 2n + 1 Proving My Equation and Using

  1. Numerical solutions of equations

    Therefore, I have found a rearrangement of the same equation (Rearrangement 1) where the iteration has failed to converge to the required root. Comparison of methods I will now use the equation 0=x5+4x2-2 that I solved using the Rearrangement method and see if I can find the same root using

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

    =2*B4^3-3*B4^2-8*B4+16 =2*C4^3-3*C4^2-8*C4+16 =(B4+C4)/11 =2*F4^3-3*F4^2-8*F4+16 =IF(G4>0,B4,F13) =IF(G4>0,F4,C13) =2*B4^3-3*B4^2-8*B4+17 =2*C4^3-3*C4^2-8*C4+17 =(B4+C4)/12 =2*F4^3-3*F4^2-8*F4+17 =IF(G4>0,B4,F14) =IF(G4>0,F4,C14) =2*B4^3-3*B4^2-8*B4+18 =2*C4^3-3*C4^2-8*C4+18 =(B4+C4)/13 =2*F4^3-3*F4^2-8*F4+18 =IF(G4>0,B4,F15) =IF(G4>0,F4,C15) =2*B4^3-3*B4^2-8*B4+19 =2*C4^3-3*C4^2-8*C4+19 =(B4+C4)/14 =2*F4^3-3*F4^2-8*F4+19 =IF(G4>0,B4,F16) =IF(G4>0,F4,C16) =2*B4^3-3*B4^2-8*B4+20 =2*C4^3-3*C4^2-8*C4+20 =(B4+C4)/15 =2*F4^3-3*F4^2-8*F4+20 =IF(G4>0,B4,F17) =IF(G4>0,F4,C17) =2*B4^3-3*B4^2-8*B4+21 =2*C4^3-3*C4^2-8*C4+21 =(B4+C4)/16 =2*F4^3-3*F4^2-8*F4+21 =IF(G4>0,B4,F18) =IF(G4>0,F4,C18) =2*B4^3-3*B4^2-8*B4+22 =2*C4^3-3*C4^2-8*C4+22 =(B4+C4)/17 =2*F4^3-3*F4^2-8*F4+22 =IF(G4>0,B4,F19)

  1. Solving Equations. Three numerical methods are discussed in this investigation. There are advantages and ...

    3x2+6x+0.5 6.549861 0.060656 0.676186 3 0.676186 0.018947 3x2+6x+0.5 5.9288 0.003196 0.67299 4 0.67299 5.13E-05 3x2+6x+0.5 5.89669 8.7E-06 0.672982 5 0.672982 3.8E-10 3x2+6x+0.5 5.896603 6.45E-11 0.672982 6 0.672982 0 3x2+6x+0.5 5.896603 0 0.672982 After 6 converge we can see that the 1st target root is to , with an error bound and solution bound.

  2. Numerical solution of equations, Interval bisection---change of sign methods, Fixed point iteration ---the Newton-Raphson ...

    = 0. x -2 -1 0 1 2 3 f (x) -29 -1 5 1 -1 11 Table1.2 From the table1.2 above, it can be seen that the roots lie in the interval of [-1, 0], [1, 2] and [2, 3] Here, I can take a=1 and b=2, whereas the mid-value is taken as (a+b)

  1. Fixed point iteration: Rearrangement method explained

    Hence the points converge. The magnitude of g?(x) will affect whether your results will converge or diverge. Now I will show a case where the rearrangement method fails. I will use the same function. In this case g(x)

  2. Fractals. In order to create a fractal, you will need to be acquainted ...

    whole numbers, the Mandelbrot Set requires the use of fractions for the values of the real and imaginary parts, or else we?d only be talking about a few points. For example, the iteration of .7 + 6i is not considered a point in the Mandelbrot Set only after three iterations:

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