ROOTS OF EQUATIONS

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

The values obtained

are not very
precises.

The graph can be

difficult to make

For these reasons

are not suitable, rather
than to find approximate
values.
INTERVAL METHODS
 þISECTION METHODS

Xi Xs

Xr
h. 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:

f xn ÿ
r ÿ f x
r
y ÿ y
xn ÿ x
r
xn ÿ
ÿ x

with u , using y
 f x
r , and solving for à

therefore gives the iteration.

xn ÿ ÿ x
xn x ÿ f xr
f xn ÿ r ÿ f x r
OPEN METHODS
 RHAPSON-NEWTON
.METHOD

It involves taking an initial value and from the same

draw tangents to approach the value of the root.
Jumping at the time
to find the root.
The division y Oscillations
zero around a
local
minimum.
f xi r
xi  xi ÿ

f xr Root
neigh orhoods of
a point of
inflection
 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.

ár áÿ á ÿ
r
á

á

árÿ
á ÿ
r Part of two initial
values that do not
Quick need to enclose
Converge. the root
With respect to the Newton
Raphson method does not
need to calculate the
derivative analytically.
 FIXED POINT
METHOD
Consist in find an x = g (x), analyzing the form of
convergence depending on the clearing has taken place.

Converge
quickly.
No need to
lock the root
To find a solution f an iterative process is performed
until the process converges with the desired accuracy
or exceed a maximum number of iterations (divergent
process).
 þIþLIOYRAPHY

m http://html.rincondelvago.com/0003061310.png

m http://www.uv.mx/anmarin/images/puntofijo.gif