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

Systematic search for a change of sign - pure maths

Extracts from this document...


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.


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 +

























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.


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.

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)


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

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.


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.


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)

    (xn-2)(h) + ... + hn-1 h 2! Since h limits to 0, all values containing an h term are therefore all worth 0, so therefore the gradient function for xn = nxn-1 However, in this section, this is perhaps only true for positive integers for the value of n.

  2. Investigate the solution of equations, comparing the following methods, Systematic search for change of ...

    = -0.0000077 So, the root is 0.74485 plus or minus 0.00005. This is true to 4 decimal places. I therefore need to show this graphically. I have demonstrated this in the graph below. It clearly shows that the line cuts throught the x-axis in between 0.7448 and 0.7449.

  1. Numerical Method (Maths Investigation)

    FAIL to solve such equation. n Xn f(Xn) f / (x1) Xn+1 1 0.5000000000 0.467106781 0.353553391 -0.82118 2 -0.82117749 #NUM! #NUM! #NUM! 3 #NUM! #NUM! #NUM! #NUM! REARRANGEMENT METHOD Another method of Fixed Iteration Method. Any equation f(X) = 0 can be arranged in the form X = g(X)

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

    into the iterative formula of Rearrangement A, which is y= [(1- 5x�)/3]^(1/5) and the starting value for x(x0) is 0, the same as before. Zx0 = 0 x1 = V[(1-3(x0)^5)/5] = 0.8027416 x2 = V[(1-3(x1)^5)/5] = -0.9417235 x3 = V[(1-3(x2)^5)/5] = -1.0274040 x4 = V[(1-3(x3)^5)/5] = -1.0735437 Immediately, I can

  1. Change of Sign Method.

    = 0.75 - 1 = -0.25 The fact that this value is less than 1, tells us that the chosen value of x0 will lead to a root of the equation. It is necessary to substitute x0=-1 into the iterative formula to find the value of x.

  2. Investigate the number of winning lines in the game of connect 4.

    Formula For Connect 5 As you can see I only followed what I did in connect 4 and 3 for the width of 5 and 4. I noticed in my both my connect 4 and connect 3 equations, that there was an increase in every formula.

  1. Decimal search.

    xn+1 = xn - , n = 0,1,2,3,.......with initial approximation x0. The Newton - Raphson iterative formula is based on evaluating the gradient of the tangent to the curve y = f(x) at x = x0 The gradient of the tangent at (x0, f (x0)

  2. Change of Sign Method

    bounds are likely to be between x=-1.65115 and x=-1.65105 but this must be justified by showing that there is a change of sign between the two. When x=-1.65115 y=-0.00067 and when x=-1.65105 y=0.00051. As there is a change of sign between the two there must be a root there.

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