• 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

Solving Equations by numerical methods.

Extracts from this document...

Introduction

Solving Equations by numerical methods. The fact that the vast majority of the numbers on the real number line are irrational (i.e. cannot be put in the form p/q, where p and q are integers) has an associated consequence that the vast majority of equations involving powers of x (i.e. polynomials) are insoluble by closed analytical techniques. This coursework's solution implies finding values of x say c1, c2-...c3 where f(c1)=0; f(c2)=0 and so on. Further transcendental equations and non- linear equations require numerical methods for their solution. It is to be noted that in no way are numerical methods inferior to analytical solutions, they are indeed the only practical solutions available, however on the down side no exact solution is possible and error bounds have to be placed on the solution given. In this coursework three main methods of solution from one-dimensional equations are given, each of the methods could be extended to the multi-dimensional case. The aim of this coursework is to show example of the methods in action, where these are successful and where they are not. A comparison between the methods will also be attempted. Method 1: Decimal Search SOLVING AN EQUATION WITH THIS METHOD Fig1. Shows the function f(x) = 12 ln(x) - x3/2. (Where ln(x) represents the natural logarithm of x.) To find the roots, the equation is: 12 ln(x) - x3/2 = 0 This equation can not be solved numerically because x appears inside the function ln(x) ...read more.

Middle

in the form x=g(x). A series of iterations attempts to improve on values of x; geometrically the method is relating on the intersection of the curve y=x with that of y=g(x). An initial value of x is chosen say x0. From this x value the value of the curve g(x) is obtained and a line drawn to the y=x curve, dropping down from this intersection point the value x1 is obtained from where the procedure continues as before. Eventually a point is reached simultaneous with the curve y=x and the curve g(x). In applying this method to the equation f(x) = 2ln(x-1) -x + 7.5 = 0, y = x f(x) = 2ln(x-1) - x + 7.5 x = 2ln(x - 1) + 7.5 = g(x) x = e^(0.5(x - 7.5)) + 1 = g(x) We immediately see the problem of this method. There are two choices for the iteration: 1. x n+1= 2ln(xn-1) + 7.5 2. xn+1= e^(0.5(xn-7.5)) + 1 1. Which of the choices of iteration for x should be used? Without a detailed analysis this question cannot be answered. However one criterion that could and should be used by the user is that for a successful iteration on an increasing function of x approaching the intersection with the curve y=x is that g'(x) should be less than 1 and greater than -1. For a decreasing function in this vicinity things are less clear cut. ...read more.

Conclusion

A simple program (see appendix) can be programmed into the calculator that generates the x-values, or alternatively spreadsheet software such as Excel can be used. Overall Conclusion. Decimal search is largely reliable, if not slow. It required little programming, and would only fail in situations where the use was not careful. However even in taking care it is possible to miss roots in highly oscillatory local situations. Newton Raphson also can present problems; one often has to conduct an analysis to find the initial point, (not always possible with more complicated equations) on the range of values of x one can get away with in the initial trial for convergence to a root. The conclusion here must also be that further research is required into this method. Fixed point estimation iteration presents real problems for the user. By experience he must select from a number of options the most likely iterative method (normally it appears to be safest to choose an iteration with a (1/n)th root in it. Also one cannot be sure which root if any your chosen iterate will converge too, one can however for increasing functions use the criteria of the gradient of the iterative function should be less than 1 in the vicinity of the root. In other examples such as xn+1=K (1-xn) chaotic functions arise. Also in the literature using complex numbers Julia sets with beautiful and chaotic boundaries arise. The world of fractals may also be mentioned here as an area to explore if more time was available. Daniel Antelo Pure2 Coursework St Charles Sixth Form College ?? ?? ?? ?? ...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)

    root is between -1 and 0 When I do the iterations starting at the point -1, it turns out like below. The green line is my original equation showing my real root and this clearly shows that the root that is being implied by the y = g(x)

  2. Marked by a teacher

    The Gradient Function

    5 star(s)

    18 3.1 19.22 12.4 3 18 3.01 18.1202 12.04 3 18 3.001 18.012002 12.004 2 8 2.1 8.82 8.4 2 8 2.01 8.0802 8.04 2 8 2.001 8.008002 8.004 1 2 1.1 2.42 4.4 1 2 1.01 2.0402 4.04 1 2 1.001 2.004002 4.004 x x2 2x2 gradient 1 1

  1. MEI numerical Methods

    The difference between the two methods is that the secant method uses two approximations which are the most recent approximations of the root. The false position method also uses two approximations; it uses the most recent approximation of the root and the most recent root which has the opposite sign of the most recent approximation of the root.

  2. Numerical solutions of equations

    = 4x3+6x2+3 The iterative formula is: xn+1 = xn- f(xn) f'(xn) So the iterative formula for this equation is: xn+1 = xn- xn4+2xn3+3xn-4 4xn3+6xn2+3 On my diagram of this function, I have taken my x1 value to be about -1.6 x1 = -1.6 x2 = 3.682591 x3 = 2.658976 x4

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

    Comparison of Methods I am going to solve the equation I did in decimal search and use all of the other methods in order to compare them with each other in order to find the root to the same degree of accuracy. This was the equation f(x) =0 where f(x)

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

    If f(X)= x�-5x�+4.67x-0.418 then f'(x)= 3 x�-10x+4.67 Xn+1= Xn- (Xn �-5 Xn �+4.67 Xn -0.418) / (3 Xn �-10 Xn +4.67 x y 1.0000 1.9665 1.9665 0.5902 0.5902 13.2493 13.2493 15.1964 15.1964 17.1002 X=g(x) method Example: y=-3x�-x�+x+2 The solution is near to 1 Take x1 = 1 Roots are given by -3x�-x�+x+2=0 Rearranges to: 3x�= -x�+x+2 x� = 1/3(-x�+x+2)

  1. C3 COURSEWORK - comparing methods of solving functions

    y=0.7x³+3x²+2x–2.5 x f(x)=0.7x³+3x²+2x–2.5 -4 -7.3 -3 -0.4 -2 -0.1 -1 -2.2 0 -2.5 Change in sign 1 3.2 2 19.1 An integer search gives the table previous. It shows that there is only one root in the interval [0, 1] but in fact, there are 3.

  2. Evaluating Three Methods of Solving Equations.

    in which every new value of x is getting closer to the root, until we eventually get to it Let me now illustrate the point by taking an example. My equation for this method is: f(x)=x3+8x2-13x-23 From the graph of this function I find that its root must lie between

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