|
(A[j][n+1]-sum)/A[j][j];
}
fprintf(out, \\"\n *****Solution *****\n\\");
for(i=1;i<=n;i++)
fprintf(out, \\" X[%d]=%lf\n\\",i,X[i]); 2-1 Gauss
2-2 Gauss-jordan
2-3 Gauss-seidal
2-4 Inverse-Matrix
2-5 LU-decomposition Method
|
|
|
2]= %f ,x[3]= %f\n",x[0],x[1],x[2]);
for(i=0;i<3;i++){
t=absol(x[i]-xp[i]);
if(t>norminf)norminf=t;
}
for(i=0;i<3;i++)xp[i]=x[i];
}
}
float absol(float x){
if(x>=0)return x;
else return (-1) * x;
} 없음
|
|
|
0.000095646
0.809308
-2.96388
-0.3196
0.000034588
0.809279
-2.96394
-0.3196
0.000037162
0.809267
-2.96393
-0.31958
0.000013272
0.809279
-2.96391
-0.31958
0.000013995
0.809283
-2.96391
-0.31959
|
|
메뉴펼치기
