• 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

Systematic search for a change of sign - pure maths

Extracts from this document...

Introduction

Pure 2 Coursework                Saqub Malik

Pure 2 Coursework

Task I) Systematic search for a change of sign.

We are looking for solutions to f (x)=0, i.e. where the curve crosses the x-axis. The first thing to do is to draw a graph. For this method, initial boundary values are needed, and a graph is a good way to do this, and to check that the particular equation can be solved using this method.

image00.png

It is convenient if the boundary values c & d are a whole unit apart e.g. 2 and 3.It will be noted that c and d have opposite signs, in this example c is -ve and d +ve. Now, you have to calculate f (x) for x, which is incremented in steps of 0.1 from c to d. The resulting table might look like this:

Decimal Search

X = c +

0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1.0

f(x)

-ve

-ve

-ve

-ve

-ve

-ve

-ve

+ve

+ve

+ve

+ve

image01.png

We now know that the root we are looking for lies between: c+0.6 and c+0.7
because this is where there is a change of sign and the graph obviously crosses the x-axis. Also note that you only need to calculate values until there is a change of sign, one need not go further. These are the limits for the root, which must lie between them. We can find the next decimal value of the root by repeating this method using an interval of 0.01 . Once further bounds are found you can repeat the decimal search using an interval of 0.001 and so on to the required accuracy.

...read more.

Middle

Unlike the change of Sign method, this requires only one starting value, which should be an estimate of the root we wish to find for f(x)=0. First, a graph should be drawn, if only a rough sketch.
image10.png
image09.png

Now, you find the tangent to the curve at x1, and find where it hits the x-axis. This point is your new estimate, x2, and you repeat this technique to a required accuracy.

We can see how this method gives us a good approximation to the root, as each step gets us a lot closer to the root.

The gradient of the tangent at (x1, f(x1) ) is given by:

y - f(x1)    =   f ' (x1)

       x  - x1                      

Where (x,y) is a point on the tangent and f ' (x1) is dy/dx of the curve at x1. Where the tangent cuts the x-axis, x = x2 and y = 0:

0  -  f(x1)  =  f ' (x1)

      x2 - x1

-  f(x1)  =  x2  -  x1

      f ' (x1)

      x2  =  x1  -   f(x1)

                   f ' (x1)

This is a form of the Newton-Raphson Formula:

     Xn+1 = Xn -  f(Xn)

                 f'(Xn)

Using this formula iteratively, one can find an accurate approximate root fairly fast.

An Example of its use:

I will use this method to find all roots of y = f(x) = 2x^4.5 - 4x^3.5 + x
First, a graph
image11.png

There are three roots, the first of which is 0 because the intercept is 0 and other parts are positive powers of x.

...read more.

Conclusion

In the terms of which method was easier and quicker I would say that the change of sign method was the most convenient. Alternatively the Newton-raphson method required you to differentiate first then work out the values.

The use of Microsoft excel and omni graph was far more beneficial for all three methods in the sense that the values for which x lay between were much easier to obtain, as was the use of tangents.

Conclusion

I have found that the Change of sign method is a very simple method to use, and only requires some simple checks before using it. The built in error-bounds and steady rate of convergence at 1 decimal place per cycle make it useful. Once programmed in to a computer, the many simple calculations become even easier.

The rearrangement of equations was complicated and required a certain amount of thinking before a calculator/computer could take over, including checking that g’ (x) was between -1 and 1. Its rate of convergence also varied a lot, depending on g’ (x). It also often requires more than one rearrangement to find all roots to an equation.

The Newton Raphson method converged the fastest of them all and was very easy to use once programmed in to my computer. It always tries to converge to a real root, but you may find the wrong one if your initial estimate was near a turning point.

I think that the Newton Raphson method is the best because of its speed of convergence and because a good starting estimates will always find the required root.

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

    x� = Gradient of PQ = (x+h) � - x� = x� + 2hx + h� - x� = 2hx + h� = 2x+h = 2x x +h-x h h x^n = Gradient of PQ = (x+h)n - xn = xn + (nx n-1)

  2. Decimal Search.

    However, if it were to be done by hand, it would have taken much longer. Rearrangement This rearrangement cannot be solved by this method, as the gradient is not between 1 and -1 at any point. y = x4+2x3-5x2+1 0 = x4+2x3-5x2+1 -2x3 = x4 - 5x2 + 1 x

  1. Pure 2 coursework - Decimal Search Method

    The function is f(x)=20-((x-3)2+0.05)-1 It is clear from simply looking at the function that one root is going to be x=3. However, if the Newton-Raphson method is used, the following data is obtained x xn+1 3.4000 2.5600 2.5600 3.6320

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

    B. Here the b) equation is chosen to solve the equation. Graph 3.2 From the Graph 3.2, y = x and intersect at the 3 roots which are around 3.5, 0.5 and -4. Graph 3.3 x=(x�+8)/13 N x 1 -2 2 0 3 0.61538462 4 0.63331116 5 0.63492387 6 0.63507352 7 0.63508745 8 0.63508874

  1. maths pure

    -0.04 -0.03 -0.01 0.003 The above calculations show us that the root lies in the interval [-1.078, -1.077]. From this we can conclude that the root to f(x) = 4x3+5 is ?1.0775 +/- 0.0005. Error Bounds The change of sign method automatically provide bounds, the two ends of the interval,

  2. The method I am going to use to solve x−3x-1=0 is the Change ...

    If my prediction is correct, my calculations above have found a wrong root (the blue arrow), which is not the root I want (the green arrow). The Decimal Search method has failed to find the root that I want from 5x^4+x�-2x�-0.1x+0.1=0.

  1. The Gradient Fraction

    All the points at the 'x' scale have gradients of 2. I begin to comprehend the relationship between the equation and the gradient. The equation of this graph is 'y=2x'. The 2 in front of the 'x' shows the gradient in the straight line.

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

    or generate attracted sequences. However, it is way too tedious to require performing all of the iterations of the possible values of c, therefore we use The Escape Criterion, which states that if |c| is less than or equal to 2 and if the absolute value of zn under z2

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