• 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

In maths equations can be solved using various methods. A very common and efficient method in solving equations is algebraically. But not all equations can be solved algebraically; these equations must be solved using numeric methods.

Extracts from this document...


Introduction In maths equations can be solved using various methods. A very common and efficient method in solving equations is algebraically. But not all equations can be solved algebraically; these equations must be solved using numeric methods. I will study three specific numeric methods on different equations. ~ Change of sign, decimal search process. ~ Newton-Raphson method. ~ Re-arrangement method. I will be testing the numeric methods with separate equations which cannot be solved algebraically. I will also apply all of the methods to one of the equations and check if all the methods give me the same value for the root I want to find. Change of Sign, Decimal Search To find the root of the equation f(x) = 0 means finding values of x for the graph y = f(x). The change of sign method works on the bases that the y = f(x) graph changes signs when it crosses the x-axis. e.g. y = f(x) The sketch above shows that there is a root between the interval [b , c] and the curve of y = f(x) crosses the x-axis and changes its sign from negative ( - ) to positive ( + ), and at the interval [a , b] f(x) curve crosses the x-axis changing its sign from positive ( + ) ...read more.


Also if the initial value is selected close to a turning point then it will also cause the formula to either diverge or converge to another root. eg The selected initial value lies to close to the turning point of the f(x) curve, this creates the tangent from the initial value to diverge outside the area of the f(x) curve. This subsequently renders the method to fail as no further estimates of the root can be obtained. When trying to find the root between the interval [0 , 1] and using the initial value as 0.88. The tangent is forced to diverge from the f(x) curve, this illustrates the failure of the Newton-Raphson method. Newton-Raphson Method in Practise The equation to be used in finding a root using the Newton-Raphson method is, y = x?????????? Sketch of y = x?????????? Magnified view of tangent markings. Newton-Raphson formula calculations. Re-arrangement Method This method operates by re-arranging the initial equation, f(x) = 0 into the form of g(x) = x, this makes the values of x the root of the equation. This method also works using a fixed point estimation process. The sketch of y = g(x) and y = x are plotted on the same set of axes, where the y = x line crosses y = g(x), produces the root(s) ...read more.


The Newton-Raphson method only required two iterations before converging to the required root. The change of sign method had to go through six cycles before producing the required root correct to six decimal places. The re-arrangement method went through four iterations to produce the root value. Although the re-arrangement method only marginally lost in time efficiency when compared to the Newton-Raphson method; the re-arrangement method proves to be the most demanding. As the re-arrangement method relies on producing a re-arrangement to the form of y = g(x) and satisfies the fact y = g` (x) < y = x`. The change of sign, decimal search method is a very straight forward method which can be applied easier then the other methods, but lacks in its rate of convergence. So in an overall comparison I can state that the Newton-Raphson method has the fastest rate of convergence, and thus has an efficient process of finding the desired root of an equation that must be solved numerically. The use of software packages and hardware devices make understanding the methods and application of the methods faster and more accurate. Using Excel spreadsheet in displaying the calculations for the change of sign method proved to be efficient as it enabled repetitions of calculations to be performed much faster than by manual process. Also using graphical displaying software such as Autograph allowed easier demonstration of the process of the different methods, and a more accurate interpretation of the methods. ...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

    C3 Coursework - different methods of solving equations.

    5 star(s)

    It merely touches it. So because this method relies on the line of the graph crossing the X +axis and the value changing signs, it is impossible to solve this with this method. This can be seen more clearly on a graph: Another failure of the method is when the graph doesn't even touch the X-axis at all.

  2. Numerical solutions of equations

    This is shown graphically in Figure 7. My root is: x = 0.68077 (5 decimal places). I know that using Rearrangement 2 helped me find a root of 0=x5+4x2-2. However, Rearrangement 1 of this function would not have helped me find the same root.

  1. Mathematical equations can be solved in many ways; however some equations cannot be solved ...

    , therefore . As we know that the root <-3, g'(x)>1 meaning that it fails as the range which enables the method to succeed -1<g'(x) <1 is not fulfilled by this equation. Rearranging f(x) =0 into x=g(x) working I am going to solve the equation f(x) =0 where f(x) =.

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

    -0.0249633 1.215 -0.0082275 0.00390625 9 1.210938 0.0085783 1.214844 -0.0082274 1.213 0.00016673 0.001953125 10 1.212891 0.000166729 1.214844 -0.0082274 1.214 -0.0040325 0.000976563 11 1.212891 0.000166729 1.213867 -0.0040325 1.213 -0.0019335 0.000488281 12 1.212891 0.000166729 1.213379 -0.0019334 1.213 -0.0008835 0.000244141 13 1.212891 0.000166729 1.213135 -0.0008834 1.213 -0.0003584 0.00012207 14 1.212891 0.000166729 1.213013 -0.0003584 1.213

  1. Numerical Solutions of Equations

    I will also talk about the advantages of computer software when using these three numerical methods. Fixed point iteration: Earlier on it took six calculations to find one of the roots of f(x) = x5-3x+1 to be equal to x = 0.33473 as well as the initial step of rearranging y = f(x)

  2. Maths - Investigate how many people can be carried in each type of vessel.

    However, before doing so, we need to make the co-efficient of "y" the same in both cases: y (AE-DB) + z (AF-DC) = AK-DJ multiply by (HA-BG) => y (HA-BG)(AE-DB) + z(AF-DC)(HA-BG) = (AK-DJ)(HA-BG) y (HA-BG) + z (IA-CG) = (AL-JG) multiply by (AE-DB) => y (AE-DB)(HA-BG) + z (AE-DB)(IA-CG)

  1. MEI numerical Methods

    If we therefore do the function of the upper and lower bounds, where the function is, y=x+tanx-1, if the root is a correct approximation one function will be negative and the other positive. f(0.4797310075)= 0.0000000005 f(0.4797310065)= -0.0000000018 Therefore this interval obeys the change in sign law, the fact that

  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