• 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

C3 Coursework: Numerical Methods

Extracts from this document...

Introduction

C3 Coursework: Sapphire Mason-Brown C3 Coursework Numerical Methods The place in which the graph of a line crosses the x axis is known as the root of the equation. It is not always possible to find the solution of an equation by algebraic or analytical methods such as factorising. This applies to equations such as y=3x3-11x+7. To solve equations such as these, numerical methods such as change of sign, x=g(x) and Newton-Raphson can be used to give estimates of the roots. Change of Sign Method The Change of sign method is a method used to look for when a sequence of numbers in the boundary of a root change from negative the positive or vice versa. This change means that the root of the equation is somewhere between the interval where there is a change of sign. This is the graph of the equation y=3x3-11x+7 There are 3 roots to the equation y=3x3-11x+7, this is illustrated by the three intersections with the x axis. There appears to be a root between 0 and 1. By taking increments of 0.1 between 0 and 1 it will be possible to use decimal search to look for a change in sign. This will make it possible to find an approximation for to the root between 0 and 1. This table shows the results of the numbers in increments of 0.1 between 0 and 1. ...read more.

Middle

The x co-ordinates for the intersection between and y=x give a root of the equation y=x5+2x�-10x+6. This is the first iteration to find the root of the equation. The point x=1 is the starting point and it gives the estimate x=0.9. After 15 iterations, they eventually converge on the point x=0.675839. This means that the final estimate of the root for the curve, y=x5+2x�-10x+6, is 0.67584. I shall now attempt to use the Change of Sign method to establish error bounds. However, the x=g(x) method does not work for all equations. Some equations cause the iterations to diverge instead of converge. This is the graph of the equation of the curve, y=5x5+6x3+9x2-15x-2 I shall use the x=g(x) method to attempt to find root between 0.5 and 1. In order to find this root, it is necessary to find x=g(x). For this equation x=g(x) is. To find this root I shall use 1 as a starting point. When using the x=g(x) method, it is not possible to find the root of the equation y=2x5+6x3=15x+2. This is because the x=g(x) method uses the gradient of the points to find the equation of the root. As the gradient of the curve at the points used to find the root is greater than 1 the iterations diverge as opposed to converge. This means that the x=g(x) ...read more.

Conclusion

To conclude, I believe the method that was easiest to use with the software was the x=g(x). This is because, it required the least work and using the method was not as tedious. It was easy to notice any typing errors in my formula as the formula was not greatly complex. Although an element of manual work was required to use the x=g(x) method (re-arranging the equation) it was partially eliminated by the simplicity of typing in the x=g(x) equation and replicating it. The second easiest method to use with the software was the Decimal search method. Although this required slightly more work than the other two methods, the software made this additional work less time-consuming. As the formulae and intervals between the numbers could easily be replicated the decimal search method was fairly simple to use in conjunction with the software I used. The method that was the least easy to use with the software at hand was the Newton Raphson method. This is mainly because of the complexity of the formula. As a result of this complexity it was more difficult to notice any typing error made when inputting the formulae used. This method was also not as simple because the software does not calculate the whole formula. An element of manual work is still required to differentiate the formula and substitute the different areas of the equation into the Newton Raphson Formula. ?? ?? ?? ?? C3 Coursework: Numerical Methods Sapphire Mason-Brown 1 ...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)

    Fixed point Iteration This method is probably the hardest method to use out of the three. It involves rearranging a y = f(x) formula into x = g(x), by using any one of the x values in the f(x) formula.

  2. MEI numerical Methods

    This is then divided by the function of the second approximation minus the function of the first approximation to give the third approximation. I can use this method because my x(0) is equal to ?/2, and x(1) is equal to 0; hence if we were to substitute these values into

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

    And also I am impressed how they work out the roots. However, there are differences in the speed of convergence and the ease of use. Therefore, I am going to compare three methods how they work. Afterwards, I am going to compare the speed of convergence and ease of use with available hardware and software.

  2. Solving Equations. Three numerical methods are discussed in this investigation. There are advantages and ...

    Microsoft Excel can also helpful and therefore a spread sheet is set up: n xn g(xn) g'(x) 1 0.5 =0.5*B2^3-B2^2+1 =(3/2)*B2^2-2*B2 2 =C2 =0.5*B3^3-B3^2+1 =(3/2)*B3^2-2*B3 3 =C3 =0.5*B4^3-B4^2+1 =(3/2)*B4^2-2*B4 -number of iteration done. - value of x - output of x when - gradient of xn n xn g(xn) g'(xn)

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

    Fixed point iteration- Rearranging the equation f(x) = 0 into the form x = g(x) In this method, an equation of f (x) =0 is rearranged into the form x= g (x). In this case, I am going to use a non-trivial and cubic equation--- y = (x-3) (x-1) (x+4)

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

    I know that this method for finding the root has worked and I am going to show how it works graphically in this root. It is shown as below: Now I am going to find the positive root of this function.

  1. Numerical integration coursework

    Hence: Therefore when you double the amount of strips (n) the error decreases by about a factor of 4, the error multiplier is therefore 0.25. Error in the trapezium rule The error connected to the trapezium rule is the same as the error in the mid-point rule.

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

    We can now conclude that the iteration of z2 + z0 would either extend to infinity (escape) or would not go to infinity (stay bounded), as the Mandelbrot set just determines the record of the fate of the orbit, whether it be chaotic, cyclic, or fixed, and is determined by the value of c.

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