metoda Jacobiego

clc
clear all
A(:,:,1)=[1 1 1;1 5 7;1 7 8];
s=3; %rozmiar
n=10; %liczba iteracji
T(:,:,1)=[1 0 0;0 1 0;0 0 1];
V(:,:,1)=[1 0 0;0 1 0;0 0 1];

for i=1:n,
    p=1;
    q=2;
    for j=1:s,
        for k=1:s,
            if(j~=k)
                if(abs(A(j,k,i))>abs(A(p,q,i)))
                    p=j;
                    q=k;
                end
            end
        end
    end
    u=(1/2)*(A(p,p,i)-A(q,q,i));
    E=(-1)*A(p,q,i);
    v=sqrt(E^2+u^2);
    cost=sqrt((abs(u)+v)/(2*v));
    sint=(E*sign(u))/(2*v*cost);
    T(:,:,i+1)=T(:,:,1);
    T(p,p,i+1)=cost;
    T(q,q,i+1)=cost;
    T(p,q,i+1)=sint;
    T(q,p,i+1)=(-1)*sint;
    disp(i)
    disp('T=')
    disp(T(:,:,i+1))
    A(:,:,i+1)=inv(T(:,:,i+1))*A(:,:,i)*T(:,:,i+1);
    disp('A=')
    disp(A(:,:,i+1))
    V(:,:,i+1)=V(:,:,i)*T(:,:,i+1);
    disp('V=')
    disp(V(:,:,i+1))
end