METODOS ABIERTOS

SILVIA XIMENA LIZCANO GUTIÉRREZ

INGENIERIA DE PETROLEOS
 Fixed Point Iteration

If the equation, f (x) = 0 is rearranged in the form

x = g(x)

then an iterative method may be written as

xn+1 = g(xn) n = 0; 1; 2; : : : (1)

where n is the number of iterative steps and x0 is the initial guess.

This method is called the Fixed Point Iteration or Successive
Substitution Method.

If c = g(c), the we say c is a fixed point for the function g(x).

 Fixed Point Iteration

f1 ( x )  x AND f2 ( x)  g ( x)
f (x)

x
Raíz
 Inicio
1

G(x), Miter, ess, Xii Si No

G(Xi+1
i+1
)=Xii

i=1 Xrr=Xi+1
i+1
El método no
converge

Xrr
i ≤ Miter

Si 1
Xii=Xi+1 Xi+1 = G(Xii )
i+1
i+1 Fin

i = i +1 ABS(Xi+1
i+1
– Xii / Xi+1
i+1
)*100 = eaa

No Si
eaa≤ ess Xrr=Xi+1 eaa Xrr Fin
i+1