metodo de jacobi para 2 incognitas

clc
clear all
syms x y
A=[5 2;1 -4]
b=[1;0]
D=[A(1,1) 0;0 A(2,2)]
L=[0 0;A(2,1) 0]
U=[0 A(1,2);0 0]
sol=inv(D)*(b-(L+U)*[x;y])
x=1;
y=2;
error=20;
tolerancia =0.001;
fprintf('%10.2f %10.2f %10.2f\n',x,y,tolerancia)


while error >tolerancia
x1=eval(sol(1));
y1=eval(sol(2));
error=((x1-x)^2+(y1-y)^2)^0.5;
fprintf('%10.5f %10.5f %10.5f\n',x,y,error)
x=x1;
y=y1;


end