Multiplicar matrices

for i=0:255

[x , y] = find(C4(:,:,1)==i);Pr(i+1)= length(x)/380/640;

[x , y] = find(C4(:,:,2)==i);Pg(i+1)= length(x)/380/640;

[x , y] = find(C4(:,:,3)==i);Pb(i+1)= length(x)/380/640;

end

for k = 1:255

for i=1:k

w1r = sum(Pr(1:i)); w1g=sum(Pg(1:i)); w1b=sum(Pb(1:i));

u1r = sum([1:i].*Pr(1:i)/w1r);

u1g = sum([1:i].*Pg(1:i)/w1g);

u1b = sum([1:i].*Pb(1:i)/w1b);

end

for i=k+1:255

w2r = sum(Pr(i+1:255));w2g = sum(Pg(i+1:255)); w2b = sum(Pb(i+1:255));

u2r = sum([i+1:255].*Pr(i+1:255)/w2r);

u2g = sum([i+1:255].*Pg(i+1:255)/w2g);

u2b = sum([i+1:255].*Pb(i+1:255)/w2b);

end

uTr = w1r*u1r + w2r*u2r;

uTg = w1g*u1g + w2g*u2g;

uTb = w1b*u1b + w2b*u2b;

maxVARr(k) = w1r*(u1r-uTr)^2 + w2r*(u2r-uTr)^2;

maxVARg(k) = w1g*(u1g-uTg)^2 + w2g*(u2g-uTg)^2;

maxVARb(k) = w1b*(u1b-uTb)^2 + w2b*(u2b-uTb)^2;

end
Matriz Transpuesta>> A=[2 .5;1 3]

A =

2.0000 0.5000
1.0000 3.0000

>> A'

ans =

2.0000 1.0000
0.5000 3.0000

Eliminación de Gauss y métodos de Gauss Jordan utilizando el código

MATLAB
Crudo

gauss.m

% Código de "Eliminación de Gauss y métodos de Gauss Jordan utilizando MATLAB"

% https://www.youtube.com/watch?v=kMApKEKisKE

a = [ 3 4 - 2 2 2
4 9 - 3 5 8
- 2 - 3 7 6 10
1 4 6 7 2 ];

% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%
Método de eliminación de % Gauss [m, n) = tamaño (a);
[m, n] = tamaño (a);
para j = 1 : m- 1
para z = 2 : m
si a (j, j) == 0
t = a (j, :); a (j,:) = a (z, :);
a (z,:) = t;
final
 final
para i = j + 1 : m
a (i,:) = a (i,:) - a (j,:) * (a (i, j) / a (j, j));
final
final
x = ceros ( 1 , m);
para s = m: - 1 : 1
c = 0 ;
para k = 2 : m
c = c + a (s, k) * x (k);
final
x (s) = (a (s, n) -c) / a (s, s);
final
disp ( ' Método de eliminación de Gauss: ' );
una
X'
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%
Método % Gauss-Jordan
[m, n] = tamaño (a);
para j = 1 : m- 1
para z = 2 : m
si a (j, j) == 0
t = a ( 1 , :); un ( 1 ,:) = a (z, :);
a (z,:) = t;
final
final
para i = j + 1 : m
a (i,:) = a (i,:) - a (j,:) * (a (i, j) / a (j, j));
final
final

para j = m: - 1 : 2
para i = j- 1 : - 1 : 1
a (i,:) = a (i,:) - a (j,:) * (a (i, j) / a (j, j));
final
final

para s = 1 : m
a (s,:) = a (s,:) / a (s, s);
x (s) = a (s, n);
final
 disp ( ' Método Gauss-Jordan: ' );
una
X'

Ecuaciones simultaneas 2 incognitos

A=[3 -1 0; -2 1 1; 2 -1 4];

b=[5;0;15];

n=length(b);

d=det(A);

x=zeros(n,1);

for i=1:n

Ab=[A(:,1:i-1),b,A(:,i+1:n)];

x(i)=det(Ab)/d;

end

disp('Solución')

disp(x);