搜索
c编的sor迭代法解线性方程组的程序2010-12-1520:33#includemath.h#includestdio.hdoublenorm(double*x,double*y,intn){inti=0;doubles=0;for(i=0;in;i++)s=s+fabs(x[i]-y[i])*fabs(x[i]-y[i]);returnsqrt(s);}voidJacobi(doubleA[],doubleb[],doublex0[],doublex[],doublew,intn1){intn=100;//最大迭代次数doubleee=0.0001,s=0;//精度inti,j,k;for(i=1;i=n;i++){for(j=0;jn1;j++)x[j]=x0[j];for(j=0;jn1;j++){s=0;for(k=0;kn1;k++){s=s+A[j*n1+k]*x0[k];}x0[j]=x[j]+w*(b[j]-s)/A[j*n1+j];}if(norm(x,x0,n1)ee)break;}}intmain(){doublea[3][3]={{8,-1,1},{2,10,-1},{1,1,-5}};doubleb[3]={1,4,3};doublex0[3]={0,0,0.0};doublex[3]={0,0,0},w=1.005;intn1=3,i;Jacobi(a,b,x0,x,w,n1);for(i=0;in1;i++)printf(x(%d)=%6.4f\n,i+1,x[i]);system(pause);return(0);}