Jacobi Method Code

clc;
clear all
breaK=0;
x=0;
y=0;
z=0;
i=0;
X=1:100;
Y=1:100;
Z=1:100;
k=1;
X(k,k)=0;
Y(k,k)=0;
Z(k,k)=0;

while(1)
X(1,k+1)=(1/8*(20+3*(Y(1,k))-2*(Z(1,k))));
Y(1,k+1)=(1/11*(33-(4*(X(1,k)))+(Z(1,k))));
Z(1,k+1)=(1/12*(35-6*(X(1,k))-(3*(Y(1,k)))));

disp(sprintf('%d iteration',k));
x=X(1,k+1)
y=Y(1,k+1)
z=Z(1,k+1)
i=k+1;
while(i>1)
i=i-1;
    if(( (x==X(1,i)) && (y==Y(1,i)) && (z==Z(1,i)) ))
     
        k+1
        i
        breaK=1;
        break
    end
end
k=k+1
if(breaK==1)
    break
end
end
x
y
z