Documentos de Académico
Documentos de Profesional
Documentos de Cultura
MÉTODO DE BISECCIÓN
function y=f(h)
y=-12.4 + 10*(0.5*%pi*(1**2) -(1**2)*asin(h/1)-h*((1**2)-h**2)**0.5);
endfunction
function y=f(x)
y=2*(x**3) + x- 1;
endfunction
function y=df(x)
y=6*x**2 + 1;
endfunction
function y=f(t)
y=300-80.425*t+201.0625*(1-2.718281828**(-(0.1)*t/0.25));
endfunction
function pn = puntofijo(f, p0,aprox)
i=1;
er(1)=1;
pn(1)=p0;
while abs(er(i))>=aprox;
pn(i+1) = f(pn(i));
er(i+1) = abs((pn(i+1)-pn(i))/pn(i+1));
i=i+1;
end
printf(' i \t pn(i) Error aprox (i) \n');
for j=1:i;
printf('%2d \t %11.7f \t %7.7f \n',j-1,pn(j),er(j));
end
endfunction
4.
a- EL MÉTODO DE NEWTON P0 = 1
function y=f(x)
y=4*cos(x)-2.718281828**(x);
endfunction
function y=df(x)
y=-4*sin(x)-2.718281828**(x);
endfunction
function pn=newtonraphson(p0,aprox);
i=1;
er(1)=1;
pn(1)=p0;
while abs(er(i))>=aprox;
pn(i+1)=pn(i)-f(pn(i))/df(pn(i));
er(i+1)=abs((pn(i+1)-pn(i))/pn(i+1));
i=i+1;
end
printf(' i \t Pn(i) Error aprox (i) \n');
for j=1:i;
printf('%2d \t %11.7f \t %7.15f \n',j-1,pn(j),er(j));
end
endfunction
b) EL MÉTODO DE LA SECANTE
function y=g(x)
y=4*cos(x)-2.718281828**(x);
endfunction
function pn = secante(x0,x1,aprox)
j=2;
i=1;
pn(1)=x0;
pn(2)=x1;
er(i)=1;
while abs(er(i))>=aprox
pn(j+1)=(pn(j-1)*f(pn(j))-pn(j)*f(pn(j-1)))/(f(pn(j))-f(pn(j-1)));
er(i+1)=abs((pn(j+1)-pn(j))/pn(j+1));
j=j+1;
i=i+1;
end
for k=2:j;
printf('%2d \t %11.7f \t %7.8f \n',k,pn(k),er(k-1));
end
endfunction
5.
a- Aplique el método de la secante
function y=f(x)
y=x**2-6;
endfunction
endfunction
function y=f(x)
y= (x^2) - 6;
endfunction
function xn=falsaposicion(f, a1,b1,max1)
i=1;
ea(1)=100;
if f(a1)*f(b1) < 0
x0(1)=a1;
x1(1)=b1;
xn(1)=x0(1)-f(x0(1))*(x1(1)-x0(1))/(f(x1(1))-f(x0(1)));
printf('It.\t\t X0\t\t xn\t\t X1\t Error \n');
printf('%2d \t %11.7f \t %11.7f \t %11.7f \n',i,x0(i),xn(i),x1(i));
while abs(ea(i))>=max1,
if f(x0(i))*f(xn(i))< 0
x0(i+1)=x0(i);
x1(i+1)=xn(i);
end
if f(x0(i))*f(xn(i))> 0
x0(1)=xn(i);
x1(1)=x1(i);
end
xn(i+1)=x0(i+1)-f(x0(i+1))*(x1(i+1)-x0(i+1))/(f(x1(i+1))-f(x0(i+1)));
ea(i+1)=abs((xn(i+1)-xn(i))/(xn(i+1)));
printf('%2d \t %11.7f \t %11.7f \t %11.7f \t %7.7f \n',
i+1,x0(i+1),xn(i+1),x1(i+1),ea(i+1));
i=i+1;
end
else
printf('No existe una raiz en ese intervalo');
end
endfunction
c- √ 6 = 2.449489742
El método que más se aproxima a la √ 6 es el método de la secante