列主元的高斯消去法java_【数学科普】列主元高斯消去法~~~~C语言程序

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

#include

#include

#include

#define max_dimension 20

int n;

static float a[max_dimension][max_dimension];

static float b[max_dimension];

static float x[max_dimension];

void main() {

int i;

int j;

int d;

int row;

float temp;

float known_items;

float l[max_dimension][max_dimension];

clrscr();

printf("Please Input Matrix jieshu :");

scanf("%d",&n);

printf("\n");

printf("Please Input Matrix Factors : ");

printf("\n");

for (i=0; i

{

printf("input di %d hang de zhi:",i+1);

for (j=0; j

{

scanf("%f",&a[i][j]);

}

printf("\n");

}

printf("Please Input Changshu xiang: ");

for (i=0; i

scanf("%f",&b[i]);

printf("The Augmented(zenguang) Matrix is :\n\n");

for (i=0; i

{

for (j=0; j

printf("%f ",a[i][j]);

printf("%f",b[i]);

printf("\n");

} printf("\n"); for (d=0; d

{ row=d;

for (i=d+1; i

{

if (fabs(a[i][d])>fabs(a[row][d]))

row=i;

}

if (row!=d)

{

for (j=d; j

{

temp=a[row][j];

a[row][j]=a[d][j];

a[d][j]=temp;

}

temp=b[row];

b[row]=b[d];

b[d]=temp;

}

for (i=d+1; i

{

l[i][d]=-a[i][d]/a[d][d];

for (j=d; j

{

a[i][j]=a[i][j]+a[d][j]*l[i][d];

}

b[i]=b[i]+b[d]*l[i][d];

}

} printf("The shangsanjiaozenguang Matrix after predigestion is :\n\n");

for (i=0; i

{

for (j=0; j

printf("%f ",a[i][j]);

printf("%f",b[i]);

printf("\n");

}

printf("\n");

for (i=n-1; i>-1; i--)

{

known_items=0;

for (j=1; j

{

known_items=known_items+a[i][i+j]*x[i+j];

}

x[i]=(b[i]-known_items)/a[i][i];

} printf("The Root X is :\n\n");

for (i=0; i

printf("%.5f ",x[i]);

printf("\n\n");

getch();

}

突破牛顿迭代！！！！