clc;
clear;
A(:,:)=input('请输入系数矩阵:\n');
A
n = length(A);
n
B(1,:)=input('请输入B向量:\n');
B
for i = 1:n-1
tmp = A(i,i);
pos = i;
for j = i+1:n %寻找最大列;
if A(j,i) > tmp
tmp = A(j,i)
pos = j
end
end
for j = 1:n %交换第i行与第pos行;
m = A(i,j);
A(i,j) = A(pos,j);
A(pos,j) = m;
end
m = B(i);
B(i) = B(pos);
B(pos) = m;
for j = i+1:n
tmp = A(j,i)/A(i,i);
for k = i:n
A(j,k) = A(j,k)-tmp * A(i,k);
end
B(j) = B(j) - B(i)*tmp;
end
end
A
B
for i = n:-1:1
tmp = n;
while tmp > i
B(i) = B(i)-A(i,tmp)*X(tmp);
tmp = tmp - 1;
end
X(i) = B(i)/A(i,i);
end
X