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

Solving equations by numerical methods - The Interval Bisection method

Extracts from this document...

Introduction

Maxim Protsenko

Pure Mathematics 2 Coursework

Solving equations by numerical methods

The Interval Bisection method

The coursework on Numerical Methods shows the techniques that can be applied to find the solutions of equations, which have no algebraic solution. The first method is the Interval Bisection Method. It involves finding an interval of x in which f(x) changes sigh. If f(x) is a continuous function, it follows that it has a root within that interval. The equation for this method that I took is x³+2x²-x-3=0.

image00.png

It is clearly seen on the graph that one of the roots of the equation is between 1 and 2. Within this interval f(x) changes the sigh from negative to positive. To find the root I built a table where a is the lower limit of the interval (in this case 1) and b is the upper limit of the interval (in this equation it is 2). The table looks like this.

The Interval Bisection Table

x³+2x²-x-3=0

f(x)<0

f(b)>0

A

b

(a+b)/2

f((a+b)/2)

possible error

1

2

1.5

3.375

0.5

1

1.5

1.25

0.828125

0.25

1

1.25

1.125

-0.169921875

0.125

1.125

1.25

1.1875

0.307373047

0.0625

1.125

1.1875

1.15625

0.06338501

0.03125

1.125

1.15625

1.140625

-0.054592133

0.015625

1.140625

1.15625

1.1484375

0.004064083

0.0078125

1.140625

1.1484375

1.14453125

-0.025346935

0.00390625

1.14453125

1.1484375

1.146484375

-0.0106621757

0.001953125

1.146484375

1.1484375

1.1474609375

-0.00330423657

0.0009765625

1.1474609375

1.1484375

1.14794921875

0.000378625351

0.00048828125

So the answer is 1.14794921 to (6 d. p.)

The possible error value represents the distance between the estimated root and the interval limits. The error bunds are a and b, so that x is between the two values. The error bounds for this root of the equation x³+2x²-x-3=0 are

1.1474609375 <x< 1.1484375

...read more.

Middle

, for a root of f(x)=0. Then drawing the tangent to the curve y=f(x) at the point (image02.png, f(image02.png)). The point at which the tangent cuts the x axis then gives the next approximation for the root and the process is repeated.

The equation I took for this method is x³-7x+1=0.

It looks like this:

image24.png

The gradient of the tangent at (image02.png, f(image02.png)) is f ‘(image02.png). The equation of the straight line can be written as

y-image03.png=m(x-image02.png),

the equation of the tangent is:

y-f(image02.png)=f ‘(image02.png)[x-image02.png].

This tangent cuts the x axis at (image04.png, 0), so:

0 -f(image02.png)=f ‘(image02.png)[image04.png-image02.png].

Rearranging this gives:

image04.png=image02.png-image06.png.

=> the Newton-Raphson iterative formula:

image07.png

As my equation is x³-7x+1=0, with the root in the interval [2, 3], I can rewrite it as:

f(x)= x³-7x+1=0 and f ‘(x)=image08.png.

The iterative formula is therefore:

image07.png

=image09.png

Starting with the point image02.png=3 gives

x(n)

f(x)

f '(x)

x(n+1)

3

7

20

2.65

2.65

1.059625

14.0675

2.574676

2.574676

0.044678977

12.886864

2.571209

2.571209

0.00009

12.833342

2.571201

2.571201

0.0000000004

12.83323

2.571201

The Newton-Raphson method gives an extremely rapid rate of convergence.

The first root of the equation I found is 2.571201 with the error bounds of 2.571200<x<2.571202.

...read more.

Conclusion

        But despite of this it takes lots of time to obtain one root and would take ages to do it without any computer or graphic calculator aid. Also the initial search may miss one or more root, for example when the x-axis is a tangent to the urve or when several roots are very close together.

        Newton Raphson method is the easiest way to estimate the root and takes much less time than to estimate the root using the first method. It doesn’t take that much time but it can go wrong very quickly and jump to another root.

        And the last method rearranging is the hardest one. It takes plenty of time to rearrange the equation and then to estimate the root. And it’s very likely to do something wrong using it.

        In conclusion I can say that the most efficient and easiest way for me to estimate the root, was the first one, because it takes not so much time if you get used to it. Very useful were PC programs such as Excel and Autograph. And at last the fact that in excel it is easier to change one equation on another and to get other roots, I can definitely say that it is the best method for me.

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

    root is between -1 and 0 When I do the iterations starting at the point -1, it turns out like below. The green line is my original equation showing my real root and this clearly shows that the root that is being implied by the y = g(x)

  2. Numerical solutions of equations

    0.680762 x8 = 0.6807698 x9 = 0.6807683 x10 = 0.6807686 x11 = 0.6807685 x12 = 0.6807685 I can see a convergence from x8, and there is no change between x11 and x12 for this number of decimal places. I know that this method has worked successfully to find a root.

  1. This coursework is about finding the roots of equations by numerical methods.

    To find the root in the interval (0, 1) Decimal search X y 1 -1 0.9 -0.097 0.8 0.624 0.89 -0.01701 0.88 0.061184 0.889 -0.00911 0.888 -0.00123 0.887 0.006639

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

    Maximum Possible Error 1 0 1 =(B2+C2)/2 =(D2-1)*(D2+2)*(D2-3)-1 =ABS(C2-B2)/2 =A2+1 =IF(E2>0,D2,B2) =IF(E2<0,D2,C2) =(B3+C3)/2 =(D3-1)*(D3+2)*(D3-3)-1 =ABS(C3-B3)/2 =A3+1 =IF(E3>0,D3,B3) =IF(E3<0,D3,C3) =(B4+C4)/2 =(D4-1)*(D4+2)*(D4-3)-1 =ABS(C4-B4)/2 =A4+1 =IF(E4>0,D4,B4) =IF(E4<0,D4,C4) =(B5+C5)/2 =(D5-1)*(D5+2)*(D5-3)-1 =ABS(C5-B5)/2 =A5+1 =IF(E5>0,D5,B5) =IF(E5<0,D5,C5) =(B6+C6)/2 =(D6-1)*(D6+2)*(D6-3)-1 =ABS(C6-B6)/2 =A6+1 =IF(E6>0,D6,B6) =IF(E6<0,D6,C6) =(B7+C7)/2 =(D7-1)*(D7+2)*(D7-3)-1 =ABS(C7-B7)/2 =A7+1 =IF(E7>0,D7,B7)

  1. The open box problem

    I will now draw table sand graphs to find out the volume and the value for x. X 0.5 1 1.5 2 2.5 V 18 24 21 12 0 We can see here that the maximum volume is between 0.5 and 1.5 so I will draw another table focusing in on the data.

  2. Numerical Solutions of Equations

    For fixed point iteration I tried to find a root of y = x5-3x+1. I will now try to find one root of y = x5-3x+1 using decimal search and Newton-Raphson and I will then compare the relative merits of the three methods in terms of speed.

  1. C3 Coursework: Numerical Methods

    The Newton Raphson formula is: In order to use this formula to investigate the roots of the equation y=3x�-9x+4 in must first differentiate the formula. y=3x�-9x+4, when differentiated, is =9x2-9. This means that my formula for to find the roots would be: As stated earlier, there appears to be a root between 1 and 2 at the point, C.

  2. C3 COURSEWORK - comparing methods of solving functions

    Therefore, we might miss the other two after finding the first one. This reason is that the two points are too close to each other. There are 3 root in the graph, 2 in the same interval [-3, -2] and 1 in the interval [0, 1].

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