• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

Solution of equations by Numerical Methods.

Extracts from this document...

Introduction

Ashley Hilsdon Div 3

Pure 2 Coursework

Solution of equations by Numerical Methods

Method 1: The Change of Sign method

The simplest method for solving an f(x) function is to use a change of sign method; these include the methods of bisection, decimal search and linear interpolations.

Unfortunately, as well as being the simplest methods, they are also relatively cumbersome. The bisection was employed below for the function of f(x)=x5+3x2+x+2. This was also displayed graphically in the graph below.

image00.png

The actual calculations for this method are summarised below in this table. I placed these with relevant diagrams

The error bounds for this result are conveniently provided by the use of this method, and are -1.485<x<-1.475. The maximum error is therefore ± 0.005.

However, this method is clearly not particularly easy to work with. In addition, as with many methods there are some functions for x, which do not work. An example is the function f(x)=x3-2x2-x. This is shown below.

image01.png

...read more.

Middle

Using an estimate for (a.) as 0, the Newton-Raphson iterative formula was then used.

This next diagram gives some indication as to how the Newton- Raphson method actually works. What it basically does is to ‘slide’ the tangent across and is indeed sometimes known as ‘tangent sliding’.

image03.png

For this method, the root can be calculated much more quickly then using the Change of Sign method. In accordance with the question the root was calculated to five significant figures, this means that the real value of x exists between 0.16655 and 0.16665, which give an error value of ± 0.00005.

This method, despite its speed in calculation a root, does not work for every function; this is illustrated below.

Method 3: Fixed Point Estimation- Rearranging the function

The third and final method for numerically solving a function of x is by rearranging an existing function of x and then using fixed-point iteration. This is illustrated for the function f(x)=x3+x-3 below.

Diagram of f(x)=x3+x-3

As is displayed graphically, the function with regards to (g)

...read more.

Conclusion

Rearranging the function is another useful technique, especially when a ‘cobweb’ effect is produced, as this gives natural error bounds for the root. However, it relies on an important rearrangement of the function, in conjunction with the plotting of at least two graphs. Once this has been done, the iterative formula is used, though within my calculations did not prove as fast as the Newton-Raphson method.

As I have already mentioned, the rearrangement method, relies more heavily on suitable graphical generating software or hardware; this is therefore a clear disadvantage that it faces. However, the change of sign method requires an interval for the root and the Newton-Raphson method requires an approximation to the result. Though, as this investigation has proved clear, regardless of the method, it has been necessary to have some idea of the function before attempting calculations. This is particularly important in the case of turning points and roots close to each other.

...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

    C3 Coursework - different methods of solving equations.

    5 star(s)

    -1.96180 -0.004775254 -1.96179 -0.004280068 -1.96178 -0.003784896 -1.96177 -0.003289738 -1.96176 -0.002794593 -1.96175 -0.002299463 -1.96174 -0.001804347 -1.96173 -0.001309244 -1.96172 -0.000814155 -1.96171 -0.000319081 -1.96170 0.00017598 X f(x) -2.0 -2 -1.99 -1.45736 -1.98 -0.92928 -1.97 -0.41553 -1.96 0.084135 -1.95 0.569938 -1.94 1.042111 -1.93 1.500882 -1.92 1.946474 -1.91 2.37911 -1.90 2.79901 The root of the function f(x)

  2. Marked by a teacher

    The Gradient Function

    5 star(s)

    1158.56201 1345.6201 4 1024 4.01 1036.86416 1286.416 4 1024 4.001 1025.28064 1280.6402 2 32 2.1 40.84101 88.4101 2 32 2.01 32.8080401 80.80401 2 32 2.001 32.08008004 80.08004 1 1 1.1 1.61051 6.1051 1 1 1.01 1.05101005 5.101005 1 1 1.001 1.00501001 5.01001 x x4 5x4 1 1 5 2 16

  1. MEI numerical Methods

    must equal negative and f(b) must be positive. In the question we are provided with an interval which is 0 < x < ?/2. Lets assume K = 1 F(0) = -1 F(?/2) = a very large positive number. Our current interval is 0 < x < ?/2, in order to get a better approximation we must find the midpoint of the interval (h), and do the f(h).

  2. This coursework is about finding the roots of equations by numerical methods.

    >1 then we would expect the iteration to diverge away from the root as a staircase. Comparison I am going to compare advantages and disadvantages of all three methods. y=-3x�-x�+x+2 There are three intervals containing roots: (-0, 1) To find the root in the interval (0, 1)

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

    =B3^3-5*B3^2+4*B3+2 =IF(G2>0,D2,F2) =D3^3-5*D3^2+4*D3+2 3 =IF(G3>0,F3,B3) =B4^3-5*B4^2+4*B4+2 =IF(G3>0,D3,F3) =D4^3-5*D4^2+4*D4+2 4 =IF(G4>0,F4,B4) =B5^3-5*B5^2+4*B5+2 =IF(G4>0,D4,F4) =D5^3-5*D5^2+4*D5+2 5 =IF(G5>0,F5,B5) =B6^3-5*B6^2+4*B6+2 =IF(G5>0,D5,F5) =D6^3-5*D6^2+4*D6+2 c f(c) Error =(B2+D2)/2 =F2^3-5*F2^2+4*F2+2 =(B2+D2)/2 =(B3+D3)/2 =F3^3-5*F3^2+4*F3+2 =H2/2 =(B4+D4)/2 =F4^3-5*F4^2+4*F4+2 =H3/2 =(B5+D5)/2 =F5^3-5*F5^2+4*F5+2 =H4/2 =(B6+D6)/2 =F6^3-5*F6^2+4*F6+2 =H5/2 This is a sample I select form my actual table to show how a spread sheet can help.

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

    1 1.5 -1 1.25 -0.15625 0.25 3 1 1 1.25 -0.15625 1.125 0.39453125 0.125 4 1.125 0.39453125 1.25 -0.15625 1.188 0.11083984 0.0625 5 1.1875 0.110839844 1.25 -0.15625 1.219 -0.0249634 0.03125 6 1.1875 0.110839844 1.21875 -0.0249633 1.203 0.04239655 0.015625 7 1.203125 0.042396545 1.21875 -0.0249633 1.211 0.0085783 0.0078125 8 1.210938 0.0085783 1.21875

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

    -1.80065 0.001538(positive) Therefore, my answer is correct and it lies between this interval. Below shows the formulae for using in the Excel: A B f(a)<0 f(b)>0 (a+b)/2 y=2x�-3x�-8x+7 -2 -1 =2*B4^3-3*B4^2-8*B4+7 =2*C4^3-3*C4^2-8*C4+7 =(B4+C4)/2 =2*F4^3-3*F4^2-8*F4+7 =IF(G4>0,B4,F4) =IF(G4>0,F4,C4) =2*B4^3-3*B4^2-8*B4+8 =2*C4^3-3*C4^2-8*C4+8 =(B4+C4)/3 =2*F4^3-3*F4^2-8*F4+8 =IF(G4>0,B4,F5)

  2. C3 COURSEWORK - comparing methods of solving functions

    0.8xn3+2 xn2-1 1 0 -1 2 -1 0.2 3 0.2 -0.9136 4 -0.9136 0.05929 5 0.05929 -0.9928 6 -0.9928 0.188464 7 0.188464 -0.92361 From the table above, we can see that the iteration is diverging away from the root in interval [0, -1] This is illustrated graphically below: X3 y= 0.8x³+2x²-x–1 X1 y= x X2 We can conclude that g'(x)

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