function x=sor(A,b,omega,x0,e,N)

n=length(b);

if nargin<6,N=500;end

x=x0;x0=x+2*e;

k=0;L=tril(A,-1);U=triu(A,1);

while norm(x0-x,inf)>e&k<N,

    k=k+1

    x0=x;

    for i=1:n

    x1(i)=(b(i)-L(i,1:i-1)*x(1:i-1,1)-U(i,i+1:n)*x0(i+1:n,1))/A(i,i);

    x(i)=(1-omega)*x0(i)+omega*x1(i);

    end

    disp(x')

end

if k==N,warning('已達到迭代次數(shù)上限');

end

% sor(A,b,1.4,x0,1e-5)