W.rar_GS_gs线性方程组_超松弛_超松弛迭代法

#include<stdio.h> #include<math.h> #define e 0.01 #define N 100 main() { double a[4][4]={ {0,0,0,0}, {0,10,-1,-2}, {0,-1,10,-2}, {0,-1,-1,5} }; double b[4]; int k,i,j;double x[4],y[4],t; b[1]=7.2;b[2]=8.3;b[3]=4.2; x[1]=x[2]=x[3]=0;k=1; do { for(i=1;i<=3;i++) { t=0.0; for(j=1;j<=3;j++) { if(j!=i) t=t+a[i][j]*x[j]; } y[i]=(b[i]-t)/a[i][i]; } if(fabs(x[3]-y[3])>e||fabs(x[1]-y[1])>e||fabs(x[2]-y[2])>e) { printf("y[1]=%lf,y2=%lf,y3=%lf\n",y[1],y[2],y[3]); if(k==N) {printf("Fail!\n");break;} } else { printf("y1=%lf,y2=%lf,y3=%lf\n",y[1],y[2],y[3]);break; } k++; for(i=1;i<=3;i++) {x[i]=y[i];} }while(1); } ------------------------------------ #include<stdio.h> #include<math.h> #define e 0.01 #define N 100 main() { double a[4][4]={ {0,0,0,0}, {0,10,-1,-2}, {0,-1,10,-2}, {0,-1,-1,5} }; double b[4]; int k,i,j;double x[4],y[4],t; b[1]=7.2;b[2]=8.3;b[3]=4.2; x[1]=x[2]=x[3]=0;k=1; do { for(i=1;i<=3;i++) { t=0.0; for(j=1;j<=3;j++) { if(j<i) t=t+a[i][j]*y[j]; if(j>i) t=t+a[i][j]*x[j]; } y[i]=(b[i]-t)/a[i][i]; } if(fabs(x[3]-y[3])>e||fabs(x[1]-y[1])>e||fabs(x[2]-y[2])>e) { printf("y[1]=%lf,y2=%lf,y3=%lf\n",y[1],y[2],y[3]); if(k==N) {printf("Fail!\n");break;} } else { printf("y1=%lf,y2=%lf,y3=%lf\n",y[1],y[2],y[3]);break; } k++; for(i=1;i<=3;i++) {x[i]=y[i];} }while(1); } ------------------------------------------ #include<stdio.h> #include<math.h> #define e 0.01 #define N 100 main() { double a[4][4]={ {0,0,0,0}, {0,10,-1,-2}, {0,-1,10,-2}, {0,-1,-1,5} }; double b[4]; int k,i,j;double x[4],y[4],t;float w; printf("Input w:"); scanf("%f",&w); b[1]=7.2;b[2]=8.3;b[3]=4.2; x[1]=x[2]=x[3]=0;k=1; do { for(i=1;i<=3;i++) { t=0.0; for(j=1;j<=3;j++) { if(j<i) t=t+a[i][j]*y[j]; if(j>i) t=t+a[i][j]*x[j]; } y[i]=(1-w)*x[i]+w*(b[i]-t)/a[i][i]; } if(fabs(x[3]-y[3])>e||fabs(x[1]-y[1])>e||fabs(x[2]-y[2])>e) { printf("y[1]=%lf,y2=%lf,y3=%lf\n",y[1],y[2],y[3]); if(k==N) {printf("Fail!\n");break;} } else { printf("y1=%lf,y2=%lf,y3=%lf\n",y[1],y[2],y[3]);break; } k++; for(i=1;i<=3;i++) {x[i]=y[i];} }while(1); }