ROOTS OF EQUATIONS

GRAPHICAL METHODS

In these methods, what is sought is to plot the



graph of y = f (x). The point where cutting the

abscissa (x) is the root. These methods
although very general, have their drawbacks.
  
  

INTERVAL METHODS
BISECTION METHODS
4. Then:


a) If F (Xi) * F (Xr) <0, the root is in the



lower subinterval then:

Xr = Xs
b) If F (Xi) * F (Xr)> 0, the root is in the


upper subinterval, then:

 Xr = Xi
5. Then, repeat the point two y when


Error <0.001, the calculation ends.


 THE FALSE POSITION
METHOD
The method of false position is intended to
combine the security of the bisection method with
the speed of the secant method . This method , as
with the bisection method stems from two points
surrounding the root f ( x ) = 0 . However ,
the method of false position has a very slow
convergence towards the solution .
Using the two-point form of the line:


with
 , using , and
solving for therefore gives the
iteration.



OPEN METHODS
 RHAPSON-NEWTON
METHOD
It involves taking an initial value and from the
same draw tangents to approach the value of the
root .
 SECANT METHOD

It is similar to Newton's method , but the

derivative is replaced by a divided difference .
The method requires two points to start iterate .
 FIXED POINT
METHOD
Consist in find an x = g (x), analyzing


the form of convergence depending on

the clearing has taken place.

To fin d a so lu tio n f a n ite ra tiv e p ro ce ss
is p e rfo rm e d u n til th e p ro ce ss
co n v e rg e s w ith th e d e sire d a ccu ra cy o r
e x ce e d a m a x im u m num ber of
ite ra tio n s ( d iv e rg e n t p ro ce ss ) .
 BIBLIOGRAPHY

 http://html.rincondelvago.com/0003
061310.png
 http://www.uv.mx/anmarin/images/p
untofijo.gif
