• 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

Examining, analysing and comparing three different ways in which to find the roots to an equation.

Extracts from this document...


Advanced Mathematics (C3) Coursework Introduction: For my investigation, I will be examining, analysing and comparing three different ways in which to find the roots to an equation. It will include the "Change of Sign Method", the "Newton-Raphson Method" and finally the method of rearranging "f(x) = 0" into the form "x = g(x)". I will be finding roots of equations using the methods, and hence compare the merits and flaws of the methods with each other. I will analyse which is the best in terms of factors such as a speed of convergence and ease of use with available software and hardware. Change of Sign Method: This method finds a root to an equation by looking at when values of f(x) change sign from positive to negative or vice versa. This works because when the value of f(x) changes its sign, it must have passed through the x axis, and thus the root is somewhere between the two values that changed. The technique of the method can be done in many ways such as by interval bisection or linear interpolation. However, I will be using the decimal search method. With decimal search, you first draw the graph of the curve that is to be investigated, and look for where the curve passes through the x axis, as these points are where the roots are. But as you cannot guess exactly where the roots are, you take intervals: the two points surrounding where the curve passes through the x axis. These points are taken as whole numbers. The next step is then to investigate where exactly between this interval, the value of f(x) changes to positive, or negative. To do this you go one decimal point further between these values. For example if the root was between 3 and 4, you would now investigate every 0.1 value, such as 3.1, 3.2, 3.3 and so on. ...read more.


These were the results: x1 0.281250000000 x2 0.255561828613 x3 0.254172803842 x4 0.254105133149 x5 0.254101855184 x6 0.254101696443 x7 0.254101688756 x8 0.254101688384 x9 0.254101688366 x10 0.254101688365 x11 0.254101688365 As shown, the values converge to a single point, 0.254101688365, which is the root to the degree of accuracy of 12 decimal places. The convergence of these values is shown on the graph on the following page, which illustrates each of the approximations that were taken, showing how they got closer and closer to the root, and finally reached it: The magnitude of g`(x) could be calculated by first finding g`(x) of the equation which was done by differentiation: g`(x) = 3x/4 So with a starting point of 1, the gradient of the line at that point would be: (3 x 1)/4 = 0.75 As the value was less than 1, but still higher than -1, the iteration converged towards the root, and didn't diverge. Failure of Rearranging Method: This method can fail when the gradient, g`(x), of "a" is above 1 or less than -1, as then the iteration does not converge towards the root, and instead diverges away from it. This can be shown in the example below. By taking the same equation, I rearranged it in a different way, giving the resulting equation: x = x� - 3x + 1 I then drew the graph to see where the roots were: I then chose to try and investigate one of the roots. I picked the root at the interval, [1, 2] and chose the starting value of 2. The results of the iteration were as follows: x1 2.0000000000 x2 3.097656250000 x3 7.680870190263 x4 113.534706794433 x5 365869.522500695000 x6 12243869989713700.000000000000 As the results showed, the iteration was not converging towards a root, but instead was diverging, and eventually the program failed as it was "overflowing". This happened as the gradient of "a" was larger than 1, and thus the iteration will not converge towards the root. ...read more.


Comparison of Speed of Convergence: The speed of convergence for the Newton-Raphson was much faster than that of the Rearranging Method. This is because by finding the tangent to the curve each time, it is getting closer to the root of the equation faster, rather than finding the points of intersection between the curve y = g(x) and y =x, as that takes more iterations in order to reach the root. For the equation, it took the Newton-Raphson method only 5 steps to reach the answer, whereas it took the Rearranging Method 11 steps, thus over twice as slow. However, both of these methods are faster than that of the Change of Sign method, as for that you must examine a huge amount of values of x in order to find where the sign changes, and it takes a very long time to find the root to the same amount of accuracy as the rest. The actual number of calculations needed was 132, compared to that of 5 and 11 steps for the other methods, makes it a very tedious method. Comparison of Ease of Use with Available Software and Hardware: The Rearranging Method and Newton-Raphson Method are relatively similar in their demands for software and hardware, as they both require a machine and software that is able to plot graphs, so that the roots can be spotted and fixed point estimations can be made. The Change of Sign Method however, does not require this as it can simply see when the sign changes and thus discover the roots. The iterations of the Newton Raphson Method and Rearranging Method can be calculated via easy formulas in a spreadsheet program such as Excel, though they require no more hardware or software than that of the Change of Sign method, which also uses simple spreadsheet formulas to calculate the value of f(x). However, the Change of Sign method does require more hard disk space as the calculations can be very large at times in comparison with the other methods. Daniel Hoij 13.6 DCGS Centre No. 52205 Candidate No. 8670 ...read more.

The above preview is unformatted text

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)

    � - 2x� = 2(x� +3x�h + 3h�x+h�) - 2x� = 2x� + 6x�h + 6h�x +h� - 2x� x + h - x h h = 6x�h + 6h�x +h� = 6x� + 6hx + h� = 6x� + (6)(0x) + 0� = 6x� h I need not explain this any further.

  2. The open box problem

    X 0.5 1.0 1.5 2.0 2.5 3.0 V 40 40.5 32 30 17.5 0 This table shows that the maximum volume is between 0.5 and 1.5. I will now draw another table to show this closer up so that I will be able to see the maximum volume more clearly.

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

    -0.3125 -0.000301953 -0.32 -0.0001482 0.00390625 9 -0.320313 4.11911E-06 -0.31641 -0.000148166 -0.32 -7.181E-05 0.001953125 10 -0.320313 4.11911E-06 -0.31836 -7.18133E-05 -0.32 -3.379E-05 0.000976563 11 -0.320313 4.11911E-06 -0.31934 -3.37918E-05 -0.32 -1.482E-05 0.000488281 12 -0.320313 4.11911E-06 -0.31982 -1.48222E-05 -0.32 -5.348E-06 0.000244141 13 -0.320313 4.11911E-06 -0.32007 -5.34794E-06 -0.32 -6.135E-07 0.00012207 14 -0.320313 4.11911E-06 -0.32019 -6.13511E-07

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

    Raphson Method, I can't get the point I want, but the further one. Therefore, it is failure. Rearranging equation method: This method is rearranging the equation f(x) =0 into form x=g(x).Thus y=x and y=g(x) can cross together, and then we can get a single value which can be estimated for the root.

  1. Functions. Mappings transform one set of numbers into another set of numbers. We could ...

    have to factorise first ==> If we have fractions in the numerator or denominator, multiply to remove the fraction Multiplying and Dividing ==> Multiply the numerators and multiply the denominators. ==> Cancel where necessary ==> Where one fraction is divided by another, invert/flip the second fraction and multiply.

  2. Methods for Advanced Mathematic

    x f(x) -3 -31 -2 -8 -1 5 0 2 1 1 2 44 Newton Raphson Method Newton Raphson Method is an iterative process. It is used for finding approximations to the roots of a real valued equation. Here is the procedure to perform the Newton Raphson Method: 1.

  1. Using Decimal search

    But instead finds the root in the interval (-0.6,-0.7). We can express this information as, the root can be taken as -0.60507 with maximum error of + 0.000005. Therefore -0.605065 < X < -0605075. To check for the different signs, f(-0.605065)

  2. Change of Sign Method.

    The above illustration shows that for x0=2, the gradient of y=g(x)= 1/4( x3+2x2-4.58) is greater than that of y=x, i.e. greater than 1. Without further calculation, this can be seen by the fact that the line y=g(x) is steeper than the line of y=x. The gradient of y=g(x) 1/4( x3+2x2-4.58)

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