clc
clear
A = [4 1 2 -1; 3 6 -1 2; 2 -1 5 -3; 4 1 -3 -8];
B = [2 -1 5 -3];
N = size(A,1);
X = zeros(N,1);
tol = 1e-6;
tic;
count = 0;
while true
x_new = zeros(N, 1);
for i = 1:N
sum = 0;
for j = 1:N
if i ~= j
sum = sum + A(i, j) * X(j);
end
end
x_new(i) = 1/A(i, i) * (B(i) - sum);
end
count = count + 1; %Итерации
if (abs(x_new - X)) < tol
break;
else
X = x_new;
end
end
toc;
disp('Итерации'); disp(count);
disp('Корни'); disp(x_new);
clear
A = [4 1 2 -1; 3 6 -1 2; 2 -1 5 -3; 4 1 -3 -8];
B = [2 -1 5 -3];
N = size(A,1);
X = zeros(N,1);
tol = 1e-6;
tic;
count = 0;
while true
x_new = zeros(N, 1);
for i = 1:N
sum = 0;
for j = 1:N
if i ~= j
sum = sum + A(i, j) * X(j);
end
end
x_new(i) = 1/A(i, i) * (B(i) - sum);
end
count = count + 1; %Итерации
if (abs(x_new - X)) < tol
break;
else
X = x_new;
end
end
toc;
disp('Итерации'); disp(count);
disp('Корни'); disp(x_new);
Соседние файлы в папке 2sem