• 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

Numerical Solutions of Equations.

Extracts from this document...


P2 Maths Coursework Numerical Solutions of Equations HANNAN SHAH Introduction In this coursework I intend to use numerical methods to find the solutions of equations that cannot be solved algebraically. Many simple equations can be solved using methods such as factorising or the quadratic formula but such methods cannot be applied to more complicated equations. My intention is to use three methods of numerical analysis to solve some of these more complex equations, show problems associated with these methods and then to compare their relative merits. The methods I will be using are decimal search, fixed point iteration using Newton-Raphson and fixed point iteration after rearranging f(x) = 0 into the form x = g(x). Decimal Search Assuming that you are looking for the roots of the equation f(x) = 0 you want to find the values of x for which the graph of y = f(x) crosses the x-axis. As y = f(x) crosses the x-axis, f(x) changes sign (from + to -), provided that f(x) is continuous. Using decimal search I will attempt to find one root of the equation y = x5+4x�-1. The graph for this function is shown below. The graph clearly shows that there are three roots in the intervals [-2, -1]. [-1,0] and [0,1]. I am going to attempt to find the value of the root in the interval [0,1]. I will start at one decimal place by taking values of x between 0 and 1 in increments of 0.1. The table on the left shows that there is a change of sign between x = 0.4 and x = 0.5. ...read more.


-1.618 as this is nearest to the point where the tangent of x = 0.8 meets the x axis and the following tangents do not have such a low gradient that may cause them to diverge away from x = -1.618 and back towards the root in the interval [0,1]. Fixed Point Iteration (Rearranging f(x) = 0 in the form x = g(x) This method uses an estimate for the value of x using an iterative process. By rearranging f(x) = 0 into the form x = g(x) provides an iterative formula which will converge to a required root by picking an appropriate starting value. On a graph the roots will be equal to the values of x where the curve y = f(x) intersects the line y = x. The graph for y = x5-3x+1 shows the roots lie in the intervals [-2,-1], [0,1] and [1,2]. x5-3x+1 = 0, therefore x = x5+1 3 This provides the iterative formula: xn+1 = xn5+1 3 The curves above show y = x and y = g(x) = x5+1. 3 With the equation in the form x = g(x) means that you are now finding the points of intersection between the curves rather than when the curve y = x5-3x+1 crosses the x-axis. I will first attempt to find the root in the interval [0,1]. I will take the end point of this interval (x = 1) as the starting point. xn xn+1 = x5+1 3 x0 = 1 x1 = (15 + 1) � 3 = 0.66667 x1 = 0.66667 x2 = (0.666675 + 1) ...read more.


Yet decimal search also had a problem by not showing a change of sign in the first set of calculations when the root had two decimal places. Therefore, ignoring any potential problems I think that fixed point iteration and Newton-Raphson are quicker than decimal search at converging to the required root. I have already made some mention of the use of technology to help speed up the process of finding the roots. Microsoft Excel was of great benefit when making calculations, as it only required the input of the initial values and the formulae. A few mouse clicks gave the results for the entire set of values within a few seconds. Autograph was another very useful piece of software as it could be used to instantly visualise curves and gradient functions. This meant that within seconds I could produce an accurate curve instead of having to make some calculations and draw the curve myself. Autograph also allowed me to see the intervals of the roots (or points of intersection in fixed point iteration). This saved a lot of time as I could easily pick appropriate starting values without having to waste time using trial and error to pick my starting value. Autograph was very useful for both Newton-Raphson and fixed point iteration as it had an inbuilt function to make the various calculations in with a few mouse clicks and these could be used to confirm the values obtained from Microsoft Excel. It was also excellent for showing the iterative processes for both methods by zooming in on the roots as I have shown many times when using these numerical methods. HANNAN SHAH P2 Maths Coursework Hannan Shah Numerical Solutions of Equations Page 2 of 14 ...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)

    Here, it is a little hard to prove this in the normal sense as (x+h) is square rooted, so I will need to rationalize the numerator. V (x+h) - Vx = V (x+h) - Vx x + h -x h V (x+h)

  2. Am going to use numerical methods to solve equations that can't be solved algebraically

    4 I am now going to find the root lies in the interval [0, 1] Taking x=1 as my starting point: X1= 1 X2= 0.75 X3= 0.559326171 X4= 0.513685659 X5= 0.508941846 X6= 0.508536519 X7= 0.50850258 X8= 0.508499743 X9= 0.508499506 X10= 0.508499486 X11= 0.508499484 X12= 0.508499484 In this case the interaction has converged quickly for which 1 was looking for.

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

    -4.06333 x5 = -4.05608 x6 = -4.05606 x7 = -4.05606 This is also correct to 6 significant figures... It is negative when -4.056065 is inserted in to the equation. f(-4.056065) = -0.0000171 It is positive when -4.056055 is inserted in to the equation.

  2. C3 Mei - Numerical Methods to solve equations

    The Newton-Raphson method was the quickest, finding the root within a certain degree of accuracy in only three iterations. Second was the Decimal Search, which took five iterations and last was the Rearrangement Method, which took the most number of iterations, 6.

  1. C3 Coursework: Numerical Methods

    Unlike the Change of Sign method, before using the x-g(x) method it is necessary to calculate g(x) first. This adds additional time to the procedure making the g(x) method slightly slower. If this method was to be carried out manually it would probably take much more time than when using software.

  2. MEI numerical Methods

    Hence the equation, x +ktanx = 1, turns into, x + ktanx - 1 = 0, this is our function (f). As explained earlier the method of bisection requires an interval which supports the sign change argument. This means that the f(a) must equal negative and f(b) must be positive.

  1. Solutions of equations

    ROOT B ANSWER = 0.66667 (5 d.p.) ROOT A As mentioned earlier the method failed for Root A as there was no change of sign between f(0.4) and f(0.5). I know there is a root because of the graph and f(x) = 0 for x = (4/9) or 0.44444 (5.d.p).

  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

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