#include
#include
#define?PI?3.1415926
#define?max?100
#define?N?100
#define?min?1e-6
double?C[N]={0}C0[N]={0};
///高斯賽德爾迭代法
double*?JGS（double?*Adouble?*bint?n）{
????int?ijk;
????double?sepsilon;
????for（k=0;k????????epsilon=0;
????????for（i=0;i????????????s=0;
????????????for（j=0;j????????????????if（j????????????????else?if（j>i）?s+=A[i*n+j]*C0[j];
????????????????}
????????????C[i]=（b[i]-s）/A[i*n+i];
????????????}
????for（i=0;i????????epsilon=epsilon+fabs（C[i]-C0[i]）;
????for（i=0;i????????C0[i]=C[i];
????if（epsilon????}
????printf（“運(yùn)用高斯賽德爾迭代法迭代次數(shù)k=%d\n“k）;
????return?C;
????}
????/////vcc畢奧-薩瓦爾公式得出影響系數(shù)
double?vcc（double?x1double?z1double?x2double?z2dou