Está en la página 1de 5

1.

-ESCRIBIR UNA FUNCION QUE PERMITA RESOLVER UN SISTEMA DE ECUACIONES DE


CUATRO VARIABLES(METODO DE GAUSS)
function G=gauss4v(a,b)
A=[a,b]
A(2,:)=A(2,:)+ (-A(2,1)/A(1,1))*A(1,:);
A(3,:)=A(3,:)+ (-A(3,1)/A(1,1))*A(1,:);
A(4,:)=A(4,:)+ (-A(4,1)/A(1,1))*A(1,:);
A(3,:)=A(3,:)+ (-A(3,2)/A(2,2))*A(2,:);
A(4,:)=A(4,:)+ (-A(4,2)/A(2,2))*A(2,:);
A(4,:)=A(4,:)+ (-A(4,3)/A(3,3))*A(3,:);
w=A(4,5)/A(4,4);
z=(A(3,5)-w*A(3,4))/A(3,3);
y=(A(2,5)-z*A(2,3)-w*A(2,4))/A(2,2);
x=(A(1,5)-y*A(1,2)-z*A(1,3)-w*A(1,4))/A(1,1);
G=[x,y,z,w];

INGRESANDO VALORES:
a=

[ 4 7 3 11
17 8 6 14
1 12 15 23
9 13 23 27 ]

b = [ 12
14
27
41 ]

INVOCANDO A LA FUNCIN: gauss4v(a,b)

2.- EN EL PROGRAMA DE METODO DE GAUSS DE 3 VARIABLES AGREGARLE LA TECNICA


DEL PIVOTEO PARCIAL
a=[2 17 5
497
6 7 11];
b=[13;27;32];
disp('MATRIZ A:')
A=[a,b]
mayor=abs(A(1,1));
for k=1:2
if(abs(A(k+1,1))>mayor)
mayor=abs(A(k+1,1));
M=k+1;
else
M=k;
end
end
z=A(1,:);
A(1,:)=A(M,:);
A(M,:)=z;
A(2,:)=A(1,:)*(-A(2,1)/A(1,1))+A(2,:);
A(3,:)=A(1,:)*(-A(3,1)/A(1,1))+A(3,:);
if(abs(A(3,2))>abs(A(2,2)))
w=A(2,:);
A(2,:)=A(3,:);
A(3,:)=w;
else
end
A(3,:)=A(2,:)*(-A(3,2)/A(2,2))+A(3,:);
z=A(3,4)/A(3,3);
y=(A(2,4)-z*A(2,3))/A(2,2);
x=(A(1,4)-y*A(1,2)-z*A(1,3))/A(1,1);
fprintf('RESPUESTA:\n')
disp(x);
disp(y);
disp(z);

3.-ESCRIBIR UN SISTEMA DE ECUACIONES DE 2 VARIABLES MAL CONDICIONADOS Y


EXPLIQUE POR QU EST MAL CONDICIONADO
x+2y=11
1.1x+2y=11.3
GRAFICANDO:
x=0:0.01:6;
y=(11-x)/2;
plot (x,y)
grid on
hold on
x=0:0.01:6;
y=(11.3-1.1*x)/2;
plot (x,y,'r')
grid on
hold off

También podría gustarte