|
n-1)
disp(x)
j=find(abs(x)==max(abs(x)));
c=x(j);
z=x/c;
P=R-c;
fprintf(\'\\n(원래 최대 lambda=24) lambda = %f=\',c);
disp(c);
fprintf(\' x(%.0f)\\n\',n);
disp(z(1));
disp(z(2));
disp(z(3));
fprintf(\'\\n\\n\');
n=n+1;
end 1.Gauss-Seidel법
2.Jacobi법
3.특성방정식
4.멱수법
5.소스코드
|
|
메뉴펼치기
