CRITERIO DE CONVERGENCIA │g´(x)│<1

x0=1;

for i=1:9

x=20/(x0^2+2*x0+10);

dist=abs(x-x0);

dg=abs(-20*(2*x+2)/( x^2+2*x+10)^2);

disp([x,dist,dg])

x0=x;

end

MÉTODO DE NEWTON-RAPHSON
x0=1;

for i=1:4

f=x0^3+2*x0^2+10*x0-20;

df=3*x0^2+4*x0+10;

x=x0-f/df;

dist=abs(x-x0);

dg=abs(1-((3*x^2+4*x+10)^2-(x^3+2*x^2+10*x-20)*(6*x+4))/(3*x^2+4*x+10)^2);

disp([x,dist,dg])

x0=x;

end

MÉTODO DE LA SECANTE
x0=0; x1=1;

for i=1:4
f0=x0^3+2*x0^2+10*x0-20;

f1=x1^3+2*x1^2+10*x1-20;

x2=x1-(x1-x0)*f1/(f1-f0);

dist=abs(x2-x1);

disp([x2,dist])

x0=x1; x1=x2;

end

MÉTODO DE LA POSICIÓN FALSA

xi=1; xd=2; Eps=0.001;

fi=xi^3+2*xi^2+10*xi-20;

fd=xd^3+2*xd^2+10*xd-20;

fm=1;

i=1;

while (abs(fm)>Eps)

if (i==1)

printf("Xi\t\tXd\t\tXm\t\tFm\n");

endif

xm=xd-fd*(xd-xi)/(fd-fi);

fm= xm^3+2*xm^2+10*xm-20;

printf("%f\t%f\t%f\t%f\n", xi, xd, xm, abs(fm));

if (fd*fm>0)

xd=xm; fd=fm;

else

xi=xm; fi=fm;

endif

i=2;

endwhile
MÉTODO DE BISECCIÓN

xi=1; xd=2; Eps=0.001;

fi=xi^3+2*xi^2+10*xi-20;

fd=xd^3+2*xd^2+10*xd-20;

fm=1;

while (abs(fm)>Eps)

xm=(xd+xi)/2;

fm= xm^3+2*xm^2+10*xm-20;

disp([xi,xd,xm,abs(fm)])

if (fd*fm>0)

xd=xm; fd=fm;

else

xi=xm; fi=fm;

endif

endwhile

MÉTODO DE MÜLLER

Eps=0.001; Eps1=0.0001;

x0=0; x1=1; x2=2;

for i=1:5

f0=x0^3+2*x0^2+10*x0-20;

f1=x1^3+2*x1^2+10*x1-20;

f2=x2^3+2*x2^2+10*x2-20;

f10=(f1-f0)/(x1-x0);

f21=(f2-f1)/(x2-x1);
f210=(f21-f10)/(x2-x0);

a2= f210;

a1= f21-(x2+x1)*a2;

a0=f2-x2*(f21-x1*a2);

d1=-a1+(a1^2-4*a0*a2)^0.5;

d2=-a1-(a1^2-4*a0*a2)^0.5;

if abs(d1)>abs(d2)

x3=2*a0/d1;

else

x3=2*a0/d2;

endif

f3=x3^3+2*x3^2+10*x3-20;

dist=abs(x3-x2);

disp([x3,dist])

if or ((dist<Eps),(abs(f3)<Eps1))

break

else

x0=x1; x1=x2; x2=x3;

endif

end

MINIMOS CUADRADOS
clc

clear

format long

x=[5 6 10 14 16 20 22 28 36 38];

y=[30 22 28 14 22 16 8 14 0 4];

a=polyfit (x,y,1)

fprintf('a0=%8.5f a1=%9.6f\n',a(2),a(1))
METODO DE SIMPSON 1/3
disp('Integral por el metodo de simpson de 1/3');

f='400*x^5-900*x^4+675*x^3-200*x^2+25*x+0.2';% f funcion

a=0; % limite inferior

b=0.8; % limite superior

n=4;% n numero intervalos

h=(b-a)/n;

z=0

x=a

for i=1:n;

if(-1)^i==1

k=eval(f);

z=z+k

end

x=h*i

end

zz=0;

x=a;

for i=2:n;

if(-1)^i==-1

k=eval(f);

zz=zz+k

end

x=h*i

end

POLINOMIO DE NEWTON
clc

clear
x=[1 5 20 40];

fx=[56.5 113 181 214.5];

M=4;N=M-1;

for i=1 : N

T(i,1)=(fx(i+1)-fx(i))/(x(i+1)-x(i));

end

for j=2:N

for i=j:N

T(i,j)=(T(i,j-1)-T(i-1,j-1))/(x(i+1)-x(i-j+1));

endfor

endfor

Xint=2;

fprintf('N Fxint\n')

px1=fx(1)+T(1,1)*(Xint-x(1));

fprintf(' %d %6.1f n',1,px1)

px2=fx(1)+T(1,1)*(Xint-x(1))+T(2,2)*(Xint-x(1))*(Xint-x(2));

fprintf('%d %6.1f \n',2,px2)

px3=fx(1)+T(1,1)*(Xint-x(1))+T(2,2)*(Xint-x(1))*(Xint-x(2))+T(3,3)*(Xint-x(1))*(Xint-x(2))*(Xint-x(3));

fprintf('%d %6.1f \n',3,px3)

POLINOMIO DE LAGRANGE
clc

clear

x=[0 1 3 6];

y=[-3 0 5 7 ];

xi=1.8;

yi=interp1(x,y,xi)

yi=interp1(x,y,xi,'cubic')

yi=interp1(x,y,xi, 'spline')
METODO DE ROMBERG

clc

clear

a=0;b=1;

for k=0:4

n=2^k;h=(b-a)/n;x=a;s=0;

if n>1

for j=1:n-1

x=x+h;

f=sin(pi*x)

s=f+s;

end

end

fa=sin(pi*a);

fb=sin(pi*b);

s=h/2*(fa+2*s+fb);

I(k+1,1)=s;

fprintf( ' %4d %10.7f\n',n,s)

end

for m=2:5

for k=1:5-m+1

I(k,m)=(4^(m-1)*I(k+1,m-1)-I(k,m-1))/(4^(m-1)-1);

end

end

METODO DEL TRAPECIO

clc

clear

disp('Programa Trapecio multiple')

f='x*e^(x^2)';% f funcion
a=0; % limite inferior

b=3; % limite superior

n=3;% n numero intervalos

disp('Funcion: ');

disp('limite inferior: ');

disp('limite superior: ');

disp('intervalos: ');

f=inline(f);

h=(b-a)/n;

aprox=f(a)+f(b);

for i=1:n-1

x=a+i*h;

aprox=aprox+2*f(x);

end

aprox=(h/2)*aprox;a=0;

disp('integral= ');

disp(aprox);