• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Equations root
 

Equations root

on

  • 1,258 views

 

Statistics

Views

Total Views
1,258
Views on SlideShare
1,254
Embed Views
4

Actions

Likes
0
Downloads
8
Comments
0

2 Embeds 4

http://mileidyacosta.blogspot.com 3
http://www.slideshare.net 1

Accessibility

Upload Details

Uploaded via as Microsoft Word

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Equations root Equations root Document Transcript

    • ROOTS OF EQUATIONS<br />Author: MILEIDY LORENA ACOSTA CREUS<br />Code: 2073966<br />Group: O1<br />Teacher: Ph.D. Eduardo Carrillo Zambrano<br />GRAPHICAL METHOD<br />It is a simple method to obtain an approximation to the equation root f(x) =0. It consists of to plot the function and determine where it crosses the x-axis. At this point, which represents the x value where f(x) =0, offer an initial approximation of the root. <br />The graphical method is necessary to use any method to find roots, due to it allows us to have a value or a domain values in which the function will be evaluated, due to these will be next to the root. Likewise, with this method we can indentify if the function has several roots.<br />  <br />For instance:<br />Root<br />CLOSED METHODS<br />The key feature of these methods is that we evaluate a domain or range in which values are close to the function root; these methods are known as convergent. Within the closed methods are the following methods:<br />BISECTION (Also called Bolzano method)<br />The method feature lie in look for an interval where the function changes its sign when is analyzed. The location of the sign change gets more accurately by dividing the interval in a defined amount of sub-intervals. Each of this sub intervals are evaluated to find the sign change. The approximation to the root improves according to the sub-intervals are getting smaller.<br />The procedure is the following:<br />Step 1: Choose lower, xo, and upper, xf, values, which enclose the root, so that the function changes sign in the interval. Verify if Bolzano method is satisfied: <br />fxf∙fxo<0<br />Step 2: An approximation of the xr root, is determined by:<br />xr=xo+xo2<br />Step 3: Realize the following evaluations to determine in what subinterval the root<br />is:<br />If fxf∙fxr<0 then the root is within the lower or left subinterval. So, to do xf=xr and return to step 2.<br />If fxf∙fxr>0 then the root is within the top or right subinterval. So, to do x0=xr and return to step 2.<br />Step 4: If fxf∙fxr=0 the root is equal to xr; the calculations ends.<br />The maximum number of iterations to obtain the root value is given by the following equation:<br />nmáx=1ln⁡(2)a-bTOLWhere: TOL = Tolerance<br />THE METHOD OF FALSE POSITION<br />Although the bisection method is technically valid to determine roots, its focus is relatively inefficient. Therefore this method is an improved alternative based on an idea for a more efficient approach to the root.<br />This method raises draw a straight line joining the two interval points (x, y) and (x1, y1), the cut generated by the x-axis allows greater approximation to the root.<br />Using similar triangles, the intersection can be calculated as follows:<br />F(X1)Xr-Xi=F(X2)Xr-X2<br />The final equation for False position method is:<br /> <br /> <br />Xr=Xu-FX2(X1-X2)FX1-F(X2)<br />The calculation of the root xr requires replacing one of the other two values so that they always have opposite signs, what leads these two points always enclose the root.<br />Note: Sometimes, depending on the function, this method works poorly, while the bisection method leads better approximations.<br />OPEN METHODS<br />These methods are based on formulas that require a single initial value x, or a couple of them but do not necessarily that contain the root. Because of this feature, sometimes these methods diverge or move away from the root, according to grows the number of iterations. It is important to know that when the open methods converge, these are more efficient than methods that use intervals.<br />Opened methods are:<br />SINGLE ITERATION OF FIXED POINT<br />Open methods employ a formula that predicts the root, this formula can be developed for a single iteration of a fixed point (also called point iteration or successive substitution) to change the equation f (x) = 0 so that is:<br />x=g(x)<br />Tal formula es empleada para predecir un nuevo valor de x en función del valor anterior de x, a través de:<br />This formula is employ to predict a new x value in function of the previous x valor, through:<br />xi+1=g(xi)<br />Posteriormente, estas iteraciones son usadas para calcular el error aproximado de tal manera que el mínimo error indique la raíz de la función en cuestión. <br />Subsequently, these iterations are used to calculate the approximate error so that the least error indicates the root of the function in matter.<br />εa=xi+1-xixi+1x100<br />Example<br />Use simple iteration of a fixed point to locate the root of f(x) = e-x – x<br />Solution: Like f(x)=0 e-x – x=0<br />Expressing of the form x=g(x) result us: x= e-x<br />Beginning with an initial value of xo=0, we can apply the iterative equation xi+1=g(xi) and calculate:<br />ixiEa(%)Et(%)00100.011.000000100.076.320.367879171.835.130.69220146.922.140.50047338.311.850.60624417.46.8960.54539611.23.8370.5796125.902.2080.5601153.481.2490.5711431.930.705100.5648791.110.399<br />Thus, each iteration bring near increasingly to the estimated value with the true value of the root, that is to say 0.56714329<br />NEWTON-RAPHSON METHOD<br />The most widely used formula to find roots, is the Newton Raphson, argues that if it indicates the initial value of x1 as the value of the root, then it is possible to extend a tangent line from the point (x1,f(x1)). Where this straight line crosses the x-axis will be the point of improve approach.<br />This method could derived in a graphically or using Taylor’s series. <br />Newton Raphson formula<br />f'Xi=fXi-0Xi-Xi+1<br />From its reorder is obtained the value of the desired root.<br />Xi+1=Xi-fXif'Xi+1<br />Note: The Newton Raphson method has a strong issue for its implementation, this is due to the derivative, as in some functions is extremely difficult to evaluate the derivative.<br />SECANT METHOD<br />The secant method allows an approximation of the derivative by means of a divided difference; this method avoids falling into the Newton-Raphson problem, as it applies for all functions regardless of whether they have difficulty in evaluating its derivative. <br />The approximation of the derivative is obtained as follows:<br />f'xi≅fxi+1-fxixi+1-xi<br />Substituting this equation in the Newton Raphson formula we get:<br />Xi+1=Xi-fXixi+1-xifxi+1-fxi<br />The above equation is the secant formula.<br />MULTIPLES ROOTS<br />A multiple root corresponds to a point where a function is tangential to the x axis For instance, double root results of:<br />f(x)=(x – 3)(x – 1)(x – 1) ó f(x)=x3 – 5x2 – 7x – 3<br />Because a value of x makes two terms in the previous equation are zero. Graphically this means that the curve tangentially touches the x axis in the double root. The function touches the axis but not cross in the root. <br />f(x)31440Double Root<br />A triple root corresponds to the case where a value of x makes three terms in an equation equal to zero, as:<br />f(x)=(x – 3)(x – 1)(x – 1)(x – 1) ó f(x)=x4 – 6x3 + 12x2– 10x + 3<br />In this case the function is tangent to the axis at the root and crosses the axis.<br />In general, odd multiplicity of roots crosses the axis, while the pair multiplicity does not cross.<br />1. The fact that the function does not change sign on multiple pairs roots prevents the use of reliable methods that use intervals.<br />2. Not only f(x) but also f'(x) approach to zero. These problems affect the Newton-Raphson and the secant methods, which contain derivatives in the denominator of their respective formulas.<br />Some modifications have been proposed to alleviate these problems, Ralston and Rabinowitz (1978) proposed the following formulas:<br />a) Root Multiplicity<br />Xi+1=Xi-mfXif'(xi)<br />Where m is the root multiplicity (ie, m=2 for a double root, m=3 for a triple root, etc.). This formulation may be unsatisfactory because it presumes the root multiplicity knowledge.<br />b) New Function<br />u(x)=fxf'(x)<br />The new function is replaced in the Newton-Raphson’s method equation, so you get an alternative:<br />Xi+1=Xi-fXif'Xi[f'xi]2- fxif''xi<br />c) Modification of the Secant Method<br />Substituting the new function (explained previously) in the equation of the secant method, we have<br />Xi+1=Xi-uXi(Xi-1- Xi)uXi-1-uXi<br />POLYNOMIALS ROOTS<br />Below are described the methods to find polynomial equations roots of the general form:<br />fnx=a0+a1x+a0x2+…+ anxn<br />Where n is the polynomial order and the a are constant coefficients. The roots of such polynomials have the following rules:<br />For equation of order n, there are n real or complex roots. It should be noted that these roots are not necessarily different.<br />If n is odd, there is at least one real root.<br />If the roots are complex, there is a conjugate pair (esto es, λ + µi y λ - µi) where i=-1<br />Müller’s Method<br />A predecessor of Muller method is the secant method, which obtain root, estimating a projection of a straight line on the x-axis through two function values (Figure1). Muller's method takes a similar view, but projected a parabola through three points (Figure2).<br />The method consist in to obtain the coefficients of the three points, replace them in the quadratic formula and get the point where the parabola intersects the x-axis The approach is easy to write, as appropriate this would be:<br />f2x=a(x-x2)2+bx-x2+c<br /> <br /> Shape 1 Shape 2<br />Thus, this parable is used to intersect the three points [x0, f(x0)], [x1, f(x1)] and [x2, f(x2)]. The coefficients of the previous equation are evaluated by substituting one of these three points to make:<br />The last equation generated that, in this way, we can have a system of two equations with two unknowns:<br />Defining this way:<br />Substituting in the system:<br />The coefficients are:<br />Finding the root, the conventional solution is implemented, but due to rounding error potential, we use an alternative formulation:<br />Solving:<br />The great advantage of this method is that we find real and imaginary roots.Finding the error this will be:<br />To be an approximation method, this is performed  sequentially and iteratively, where x1, x2, x3replace the points x0, x1, x2 carrying the error to a value close to zero.<br />Bairstow’s Method<br />Bairstow's method is an iterative process related approximately with Muller and Newton-Raphson methods. The mathematical process depends of dividing the polynomial between a factor.<br />Given a polynomial fn(x) find two factors, a quadratic polynomial <br />f2(x) = x2 – rx – s y fn-2(x)<br /> The general procedure for the Bairstow method is:<br /> <br />Given fn(x) y r0 y s0<br />Using Newton-Raphson method calculate f2(x) = x2 – r0x – s0 y fn-2(x), such as, the residue of fn(x)/ f2(x) be equal to zero.<br />The roots f2(x) are determined, using the general formula. <br />Calculate fn-2(x)= fn(x)/ f2(x).<br />Do fn(x)= fn-2(x)<br />If the polynomial degree is greater than three, back to step 2<br />If not, we finish<br />The main difference of this method in relation to others, allows calculating all the polynomial roots (real and imaginaries).<br /> <br />To calculate the polynomials division, we use the synthetic division. So given<br />fn(x) = anxn + an-1xn-1 + … + a2x2 + a1x + a0<br /> <br />By dividing between f2(x) = x2 – rx – s, we have as a result the following polynomial<br /> <br />fn-2(x) = bnxn-2 + bn-1xn-3 + … + b3x + b2<br /> <br />With a residue R = b1(x-r) + b0, the residue will be zero only if b1 and b0 are.<br /> <br />The terms b and c, are calculated using the following recurrence relation:<br />bn = an<br />bn-1 = an-1 + rbn<br />bi = ai + rbi+1 + sbi+2<br />cn = bn<br />cn-1 = bn-1 + rcn<br />ci = bi + rci+1 + sci+2<br />Finally, the approximate error in r and s can be estimated as:<br />εa.r=∆rr100%<br />εa.s=∆ss100%<br />When both estimated errors failed, the roots values can be determined as:<br />x=r±r2+4s2<br />BIBLIOGRAPHY<br />CHAPRA, Steven. Numerical Methods for engineers. Editorial McGraw-Hill. Third edition. 2000.<br />http://lc.fie.umich.mx/~calderon/programacion/Mnumericos/Bairstow.html<br />http://illuminatus.bizhat.com/metodos/biseccion.htm<br />http://aprendeenlinea.udea.edu.co/lms/moodle/mod/resource/view.php?inpopup=true&id=24508<br />