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

Numerical solution of equations

Extracts from this document...


Pure Mathematic 2 Coursework Numerical solution of equations By Michael Pang I am going to show 3 of the numerical methods for solving the equation which cannot be solved algebraically. They are interval estimation, fixed point estimation and Newton-Raphson method. Those of these numerical methods are used when algebraic ones are not available. When you found any equations which cannot be solved algebraically, probably you will draw the graph and see where the roots are. However, the other problem is found that you cannot get all roots accuracy. Actually, the numerical methods cannot find the exactly root but the answers are more accuracy than sketching the graphs. Therefore, we usually provide the answer to 5 or 6 decimal places depending on what the questioner needs. Finally, we check the answer by setting the lower bound and upper bound to see whether it has sign change or not. Even if the three numerical can solve the equation non-algebraically, they have its advantages and disadvantages. And now I am going to show how these methods works and their problems by using the equation F(x) = x�-9x+3. Interval estimation Assume that the roots of the equation F(x) = x�-9x+3, and I am looking for the roots which F(x) = 0. The roots of the equation are the values of x which the graph of y = x�-9x+3 crosses the x axis. By using the computer, I recognise that there are 3 roots on the graph and the value of these 3 roots. However, if we cannot use the computer, we have to use one of the numerical methods - interval estimation. ...read more.


They are - The curve touches the x-axis - The roots are close together - There is a discontinuity The curve touches the x-axis In the above graph, the curve touches the x-axis. Therefore, the sign change could not be found and none of the methods of interval estimation can be used. The roots are close together In the graph, there 3 roots close to together between the interval (0,1). In decimal search, F(0.1) = 0, so that 1 of the root is 0.1 and so further interval cannot be found. In addition, interval bisection and linear interpolation would be unaware of the existence of other roots since the 3 roots are too close together. There is a discontinuity in F(x) This equation y = 1/(x-1.1) has no root, but all change of sign methods will converge on a false root at x = 1.1 Avoid problem To avoid those problems occurring, it is important to start by sketching the graph and therefore the problem will be found. Fixed point estimation It is much different from the method of interval bisection. It involves an iterative process rather than finding interval within the roots must lie. Generally, iterative process means that a sequence of numbers by continued repetition of the same procedure. But this method has some limited which will be introduced when the process are showing. How does it method work? Before starting to use this method, the equation F(x) = 0 has to be rearranged into the form of x = g(x). ...read more.


The other methods to show they are right, I should check their upper bound and lower bound where I set it in Fixed point estimation. And now I show it again to make it clear. - The largest root : F(2.816915) = 0.0000142, F(2.816905) = -0.00013403 - The medium root : F(0.337615) = -0.00005233 F(0.337605) = 0.00003425 - The smallest root : F(-3.154525) = -0.00004153 F(-3.154515) = 0.00016701 Advantage Newton-Raphson method is fast and convenient, the processes are short and that why I didn't use a lot of presentation to show my understanding. It also gives an extremely rapid rate of convergence. I only use 4 to 5 steps for each of the root, so I find that it was much easier to finish than the first 2 methods. Disadvantage Even this method is the fastest and the most convenient, it still has several problems. Firstly, in my case, if I didn't choose the right initial value, I couldn't find the root by only 4 to 5 steps or even faster in other case. However, if the first value I h chose is not close to the root, or near the turning point, a turning point of y = F(x), the iteration may diverge, or converge to another root. And if the initial point is at a stationary point, F'(X) = 0 so the method cannot proceed. Secondly, all numerical methods for solving equations cannot be proceeded when the function is discontinuous function as it doesn't have any real roots. Thirdly, the function is not defined over the whole of. The tangent at the graph may meet the axis at a point outside the domain of the function. ...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)

    To start the process, we have to select two points on the graph visual basis. Looking at the graph you can see that the root is between -2 and -1: x f(x) -1.9620 -0.01468 -1.9619 -0.00973 -1.9618 -0.00478 -1.9617 0.000176 -1.9616 0.005126 -1.9615 0.010074 -1.9614 0.015021 -1.9613 0.019967 -1.9612 0.024911 -1.9611 0.029854 -1.9610 0.034796 x f(x)

  2. MEI numerical Methods

    -4 -0.31838296 -5 -0.24381388 -6 -0.19689847 The relationship between the negative integer K and the root ? is: As k-> -? then ? -> 0 Essentially this means that there is a positive correlation, as the value of K increases the value of ?

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

    Newton Raphson only takes 3 rows of calculations to find 2 results which match to 3 decimal places which is the specified degree of accuracy for the initial decimal search calculation. This is faster than the x=g(x) iteration as this method takes 4 rows of calculations to find 2 results that match to the specified degree of accuracy.

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

    To find the root in the interval (0, 1) Decimal search X y 1 -1 0.9 -0.097 0.8 0.624 0.89 -0.01701 0.88 0.061184 0.889 -0.00911 0.888 -0.00123 0.887 0.006639

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

    -1.735649917 -1.735649917 -1.09912868 27.62106745 -1.695856789 -1.695856789 -0.03431212 25.90287655 -1.694532143 -1.69453214 -3.745E-05 25.8463345 -1.69453069 -1.694530694 -4.48E-11 25.84627268 -1.694530694 -1.694530694 3.55271E-15 25.84627268 -1.694530694 -1.694530694 -7.1054E-15 25.84627268 -1.694530694 -1.694530694 3.55271E-15 25.84627268 -1.694530694 In this spreadsheet, Xr = estimated value Xr. f'(Xr) =the value after differentiated f (Xr)

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

    0.025129 0.007813 9 1.523438 0.025129 1.53125 -0.00827 1.527344 0.008436 0.003906 10 1.527344 0.008436 1.53125 -0.00827 1.529297 8.43E-05 0.001953 11 1.529297 8.43E-05 1.53125 -0.00827 1.530273 -0.00409 0.000977 12 1.529297 8.43E-05 1.530273 -0.00409 1.529785 -0.002 0.000488 13 1.529297 8.43E-05 1.529785 -0.002 1.529541 -0.00096 0.000244 14 1.529297 8.43E-05 1.529541 -0.00096 1.529419 -0.00044 0.000122

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

    f (1.212929046) = f (1.212930954) = Since sign change can be shown, the Interval Bisection method succeeds in finding the root. Failure of the method The method fails when several roots are very close to each other. This can be proved by solving the following non-trivial equation.

  2. Numerical integration can be described as set of algorithms for calculating the numerical value ...

    Algebraically this can be donated as [f(?) + f(?+h)](h/2). The length of the next trapezium in figure 1.1 is [f(2) + f(3)](h/2); similarly in algebraic terms [f(?+h) + f(?????h?]??h???? As a result the total area in figure 1.1 can be given as follows: [f(?) + f(?+h)](h/2) + [f(?+h) + f(?????h?]?h??????[f(?+2h) + f(?????h?]?h??? + [f(?+3h) + f(?????h?]?h?????? [f(??????[f(??h)

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