雅克比迭代法求解线性方程组的程序(共2页).doc

精选优质文档-倾情为你奉上雅克比迭代法求解线性方程组的程序：#include stdio.h#include math.h#include conio.h#define N 50#define eps 1e-8void main()double x3=0,0,0,y3,a33=5,2,1,2,8,-3,1,-3,-6,b3=8,21,1,s1,s2;int i,k=0,j; do s2=0; k=k+1; for(i=0;i3;i+) s1=0; for(j=0;j3;j+) if(i=j)continue; s1+=aij*xj; yi=(bi-s1)/aii; s2+=fabs(xi-yi); if(s2eps)printf(迭代次数K=%dn,k); if(