int k=1;
while((k
{
dif=0.0;
int i=0;
while(i
int j=0;
while(j
if(j {
sum+=A[i][j]*x[j];
}
if(j>i)
{
sum+=A[i][j]*xx[j];//上一次的x[j]
}
j++;
}
x[i] = (b[i]-sum)/A[i][i];
sum=0.0;
i++;
}
r=0.0;
int m=0;
while(m
dis=fabs(x[m]-xx[m]);
if(dis>r)
r=dis;
m++;
}
dif=r;
printf("\n第%d次迭代的结果:\n",k);
i=0;
while(i
printf("%12.8f ",x[i]);
xx[i]=x[i];
i++;
}
printf("\n与上次计算结果的距离(无穷范数):%12.8f \n",dif);
k++;
}
printf("\n迭代计算的结果为:\n");