1.题目
2.SOR 迭代
3.代码实现
clc;clear;
a=[4 -1 0;-1 4 -1;0 -1 4];
b=-eye(3);
A=[a b;b a];
B=[2 1 2 2 1 2]';
x1=A^(-1)*B;
x=zeros(6,1);
w=1;
k1=1;
p=zeros(6,10);
while(max(abs(B-A*x))>=1e-5)
for i=1:6
x(i)=x(i)+w/4*(B(i)-sum(A(i,:)'.*x));
end
p(:,k1)=x;
k1=k1+1;
end
disp(k1);
disp(x);
x2=zeros(6,1);
w=1.1;
k2=1;
while(sum(abs(B-A*x2))>=1e-5)
for i=1:6
x2(i)=x2(i)+w/4*(B(i)-sum(A(i,:)'.*x2));
end
k2=k2+1;
end
disp(k2);
disp(x);