Metoda lui Aitken

Notam k =xk+ 1-x_/xk-x=> k*xk-x* k=xk+1-x=> x(1- k)=xk+1- k*xk=>x=xk+1- xk/1- k,

k->f(x_)(*)
Prop: fie (xk) o iter Pic nestationara(nu are pct fix), at k=f(f(xk))-f(xk)/f(xk)-xk conv la f(x_)
Dem: Mk=xk+2-xk+1/xk+1-xk=(xk+2-x_/xk+1-x_)-1/1-xk-x/xk+1-x->f(x), inlocuim k cu Mk
in (*). Yk=Xk+1-MkXk/1-Mk=Xk+1-Xk+Xk(1-Mk)/1-Mk=---=Xk(f(Xk)-Xk)2 /f(f(xk))2f(xk)+Xk(forma1)= Xk*f(f(Xk))-f(Xk)2 /f(f(xk))-2f(xk)+Xk(forma2)
Prop: Fie (Xk) o it Picard nestationara. Atunci (Yk) conv la x_ si in plus lim|Yk-x_|/|Xk-x_|=0
Dem: Yk=Xk-(Xk+1-Xk)2/(Xk+2-2Xk+1+Xk)=(se sep 2 si se - + un x_ se imp la Xk+1-x_><)--->x_, apoi inloc pe Yk obtinut in lim din prop. Si apoi am limita 0.
Se poate arata ca limYk+1-x_/Yk-x_=f(x_)!=0. Se modif rec Xk+1=Yk(de mai sus).

Metoda Newton
f(x)=0 Pp x_ sol simpla a lui f(x)=0{f90(x_)=0, f(x_)!=0}. Pp f:R->R de C2. X0 e R