数值分析 各个算法的C语言程序
double A[3][3]={5,2,1,-1,4,2,2,-3,10},x[30][3],b[3]={-12,20,3},f1=0,f2=0,L=1,w=0.9; int i,j,k=1,n=3;
for(i=0;i<3;i++) x[0][i]=0; while(L>0.0001||L<-0.0001)
{
for(i=0;i<n;i++)
{ for(j=0;j<n;j++)
{if(j<i) f1+=A[i][j]*x[k][j];
else if(j>i) f2+=A[i][j]*x[k-1][j];} x[k][i]=w*(b[i]-f1-f2)/A[i][i];} L=x[k][0]-x[k-1][0]; for(i=1;i<n;i++)
if((x[k][i]-x[k-1][i])/(x[k][i-1]-x[k-1][i-1])>1||(x[k][i]-x[k-1][i])/(x[k][i-1]-x[k-1][i-1])<-1) L=x[k][i]-x[k-1][i]; k++;
}
printf("输出迭代X矩阵：\n"); for(i=1;i<k;i++)
{for(j=0;j<n;j++) printf("%f ",x[i][j]); printf("\n");}
printf("\n输出迭代次数：%d\n",k-1);
}