雅克比迭代法C语言代码

#include

#define EPS 1e-5

#define MAX 100

#define N 500

main()

{int i,j,k=1;

double p,epsilon,max;

float a[4][4]={2,10,0,-3,-3,-4,-12,13,1,2,3,-4,4,14,9,-13},b[4]={10,5,-2,7},

xk[N]={0},xk1[N]={0};

printf (\"输入初始值:\");

for (i=0;i<4;i++)

scanf(\"%f\

do {

for (i=0;i<4;i++)

{

p=0;

for (j=0;j<4;j++)

if (i!=j)p+=a[i][j]*xk[j];

xk1[i]=(b[i]-p)/a[i][i];

}

for (i=0;i<4;i++)

printf(\"%10.5f\

printf(\"\\n\");

max=fabs(xk1[0]-xk[0]);

for (i=0;i<4;i++)

{

epsilon=fabs(xk1[i]-xk[i]);

if (maxmax=epsilon;

}

if(max>=EPS)

{for (i=0;i<4;i++)

xk[i]=xk1[i];

k++;}

else break;

}

while(1);

for(i=0;i<4;i++)

printf(\"x%d=%5.4f \

printf(\"\\nThe number of iteration is:%d\\n\

}