n阶行列式计算程序:
#include <stdio.h>
#include <math.h>
float determinant[100][100];
main()
{
unsigned char a,b,c,d,n;
char sign;
float value,k;
sign=1;
value=1;
printf("请输入行列式的阶数 ");
scanf("%d",&n);
for(a=0;a<n;a++)
{
printf("请输入第%d行元素,元素之间用空格隔开。\n",a+1);
for(b=0;b<n;b++)
scanf("%f",&determinant[a][b]);
}
printf("你输入的行列式:\n");
for(a=0;a<n;a++)
{
printf("\n");
for(b=0;b<n;b++)
{
if(fabs(determinant[a][b])<0.001)
determinant[a][b]=0;
printf("%5.2g ",determinant[a][b]);
}
}
printf("\n");
/*如果行列式有两行成比例,那么行列式的值为0*/
for(a=0;a<n;a++)
{
for(b=1;a+b<n;b++)
{
k=determinant[a][0]/determinant[a+b][0];
for(c=1;c<n;c++)
{
if(determinant[a][c]/determinant[a+b][c]!=k)
break;
}
if(c==n&&determinant[a][n-1]/determinant[a+b][n-1]==k)
{
value=0;
break;
}
}
if(value==0)
break;
}
/*如果已经知道行列式的值为0,那么就没必要再计算了*/
if(value!=0)
{
/*如果行列式有两列成比例,那么行列式的值为0*/
for(a=0;a<n;a++)
{
for(b=1;a+b<n;b++)
{
k=determinant[0][a]/determinant[0][a+b];
for(c=1;c<n;c++)
{
if(determinant[c][a]/determinant[c][a+b]!=k)
break;
}
if(c==n&&determinant[n-1][a]/determinant[n-1][a+b]==k)
{
value=0;
break;
}
}
if(value==0)
break;
}
}
/*如果已经知道行列式的值为0,那么就没必要再计算了*/
if(value!=0)
{
/*将行列式化简成上三角形行列式*/
d=0;
for(a=0;a<n;a++)
{
if(determinant[a][d]==0)
{
for(b=a+1;b<n;b++)
if(determinant[b][d]!=0)
break;
for(c=0;c<n;c++)
{
determinant[99][c]=determinant[b][c];
determinant[b][c]=determinant[a][c];
determinant[a][c]=determinant[99][c];
}
sign*=-1; //交换两行,行列式变号
}
for(b=1;a+b<n;b++)
{
k=-determinant[a+b][d]/determinant[a][d];
for(c=d;c<n;c++)
{
determinant[a+b][c]=determinant[a+b][c]+k*determinant[a][c];
}
}
d++;
}
/*计算行列式的值*/
for(a=0;a<n;a++)
{
value=value*determinant[a][a];
}
if(fabs(value)<0.001) //由于计算机会把分数计算成小数,化简后行列式元素会可能会是一个非常小的数。当一个数小到到足够小时,我们将它视为0
value=0;
value=value*sign; //行列式的值乘以行列式外的符号
printf("化简后的行列式:\n");
for(a=0;a<n;a++)
{
printf("\n");
for(b=0;b<n;b++)
{
if(fabs(determinant[a][b])<0.001)
determinant[a][b]=0;
printf("%5.2g ",determinant[a][b]);
}
}
}
printf("\n");
printf("行列式的值为%g ",value);
}
矩阵化简程序:
#include <stdio.h>
#include <math.h>
void Matrix_Simplification(void);
unsigned char Matrix_GetRank(void);
float matrix[100][100];
unsigned char row_pointer=0,column_pointer=0;
unsigned int row,column;
main()
{
unsigned char a,b;
printf("请输入矩阵的大小(行)(列)\n");
scanf("%d %d",&row,&column);
for(a=0;a<row;a++)
{
printf("请输入第%d行元素\n",a+1);
for(b=0;b<column;b++)
{
scanf("%f",&matrix[a][b]);
}
}
/*打印矩阵*/
printf("\n您输入的矩阵:\n\n");
for(a=0;a<row;a++)
{
for(b=0;b<column;b++)
printf("%8.4g",matrix[a][b]);
printf("\n\n");
}
/*行最简型矩阵化简程序*/
for(column_pointer=0;column_pointer<column;)
{
if(matrix[row_pointer][column_pointer]==0)
{
for(a=row_pointer;a<row;a++)
{
if(matrix[a][column_pointer]!=0)
break;
}
if(a==row)
column_pointer++;
else
{
for(b=0;b<column;b++)
{
matrix[99][b]=matrix[a][b];
matrix[a][b]=matrix[row_pointer][b];
matrix[row_pointer][b]=matrix[99][b];
}
Matrix_Simplification();
}
}
else
{
Matrix_Simplification();
}
}
/*打印矩阵*/
printf("它的行最简型矩阵:\n\n");
for(a=0;a<row;a++)
{
for(b=0;b<column;b++)
{
if(fabs(matrix[a][b])<0.0001)
matrix[a][b]=0;
printf("%8.4g",matrix[a][b]);
}
printf("\n\n");
}
printf("\n\n该矩阵的秩:%d",Matrix_GetRank());
}
/*化简程序*/
void Matrix_Simplification(void)
{
int i,j;
float n;
n=1/matrix[row_pointer][column_pointer];
for(j=0;j<column;j++)
{
matrix[row_pointer][j]=n*matrix[row_pointer][j];
}
for(i=0;i<row_pointer;i++)
{
n=-matrix[i][column_pointer]/matrix[row_pointer][column_pointer];
for(j=0;j<column;j++)
{
matrix[i][j]=matrix[i][j]+n*matrix[row_pointer][j];
}
}
for(i=row_pointer+1;i<row;i++)
{
n=-matrix[i][column_pointer]/matrix[row_pointer][column_pointer];
for(j=0;j<column;j++)
{
matrix[i][j]=matrix[i][j]+n*matrix[row_pointer][j];
}
}
row_pointer++;
column_pointer++;
}
/*求矩阵的秩*/
unsigned char Matrix_GetRank(void)
{
unsigned char i,j;
for(i=0;i<row;i++)
{
for(j=0;j<column;j++)
{
if(matrix[i][j]!=0)
break;
}
if(j==column)
break;
}
return i;
}
求解线性方程组程序:
#include <stdio.h>
#include <math.h>
#include <string.h>
#define COEFFIECIENT_MATRIX 1
#define AUGMENTED_COEFFIECIENT_MATRIX 0
void Matrix_Simplification(void);
unsigned char Matrix_GetRank(unsigned char type);
char unknows_name[100];
char string_backup[100];
char *string;
float matrix[100][100];
unsigned char row_pointer=0,column_pointer=0;
unsigned int row,column;
main(void)
{
unsigned char a,b,c,d,rank_cm,rank_acm;
int the_amount_of_unknows=0;
printf("请输入方程组中的未知量(两未知量之间用逗号隔开)\n");
scanf("%[^\n]",unknows_name);
strcpy(string_backup,unknows_name);
for(a=0;a<100;a++)
{
if(unknows_name[a]==',')
the_amount_of_unknows++;
else if(unknows_name[a]=='\0')
break;
}
the_amount_of_unknows++;
column=the_amount_of_unknows+1;
printf("请输入方程的个数\n");
scanf("%d",&row);
printf("\n请输入方程组的增广系数矩阵:\n");
for(a=0;a<row;a++)
{
printf("请输入第%d行元素\n",a+1);
for(b=0;b<column;b++)
{
scanf("%f",&matrix[a][b]);
}
}
printf("\n方程组的增广系数矩阵:\n\n");
for(a=0;a<row;a++)
{
for(b=0;b<column;b++)
printf("%8.4g",matrix[a][b]);
printf("\n\n");
}
for(column_pointer=0;column_pointer<column-1;)
{
if(matrix[row_pointer][column_pointer]==0)
{
for(a=row_pointer;a<row;a++)
{
if(matrix[a][column_pointer]!=0)
break;
}
if(a==row)
column_pointer++;
else
{
for(b=0;b<column;b++)
{
matrix[99][b]=matrix[a][b];
matrix[a][b]=matrix[row_pointer][b];
matrix[row_pointer][b]=matrix[99][b];
}
Matrix_Simplification();
}
}
else
{
Matrix_Simplification();
}
}
printf("增广系数矩阵的行最简型矩阵:\n\n");
for(a=0;a<row;a++)
{
for(b=0;b<column;b++)
{
if(fabs(matrix[a][b])<0.0001)
matrix[a][b]=0;
printf("%8.4g",matrix[a][b]);
}
printf("\n\n");
}
rank_cm=Matrix_GetRank(COEFFIECIENT_MATRIX);
rank_acm=Matrix_GetRank(AUGMENTED_COEFFIECIENT_MATRIX);
if(rank_cm!=rank_acm)
printf("该方程组无解!");
else if(rank_cm==rank_acm)
{
if(the_amount_of_unknows==rank_acm)
{
printf("该方程组有唯一解!\n");
string=strtok(unknows_name,",");
printf("%s=%g\n",string,matrix[0][column-1]);
for(a=1;a<the_amount_of_unknows;a++)
{
string=strtok(NULL,",");
printf("%s=%g\n",string,matrix[a][column-1]);
}
}
else if(the_amount_of_unknows>rank_acm)
{
printf("该方程组有无穷解!\n");
row_pointer=0;
column_pointer=0;
c=1;
d=0;
while(column_pointer<the_amount_of_unknows)
{
if(matrix[row_pointer][column_pointer]==0)
{
strcpy(unknows_name,string_backup);
string=strtok(unknows_name,",");
for(a=1;a<=column_pointer;a++)
string=strtok(NULL,",");
printf("%s=c%d\n",string,c);
column_pointer++;
c++;
}
else
{
strcpy(unknows_name,string_backup);
string=strtok(unknows_name,",");
for(a=1;a<=column_pointer;a++)
string=strtok(NULL,",");
printf("%s=",string);
for(a=column_pointer+1;a<column-1;a++)
{
if(matrix[row_pointer][a]!=0)
{
strcpy(unknows_name,string_backup);
string=strtok(unknows_name,",");
for(b=1;b<=a;b++)
string=strtok(NULL,",");
if(!d)
{
if(matrix[row_pointer][a]==1)
{
printf("-%s",string);
d=1;
}
else if(matrix[row_pointer][a]==-1)
{
printf("%s",string);
d=1;
}
else
{
printf("%g%s",-matrix[row_pointer][a],string);
d=1;
}
}
else
{
if(matrix[row_pointer][a]==1)
printf("-%s",string);
else if(matrix[row_pointer][a]==-1)
printf("+%s",string);
else
printf("%+g%s",-matrix[row_pointer][a],string);
}
}
}
if(matrix[row_pointer][column-1])
printf("%+g\n",matrix[row_pointer][column-1]);
else
printf("\n");
row_pointer++;
column_pointer++;
d=0;
}
}
}
}
}
void Matrix_Simplification(void)
{
int i,j;
float n;
n=1/matrix[row_pointer][column_pointer];
for(j=0;j<column;j++)
{
matrix[row_pointer][j]=n*matrix[row_pointer][j];
}
for(i=0;i<row_pointer;i++)
{
n=-matrix[i][column_pointer]/matrix[row_pointer][column_pointer];
for(j=0;j<column;j++)
{
matrix[i][j]=matrix[i][j]+n*matrix[row_pointer][j];
}
}
for(i=row_pointer+1;i<row;i++)
{
n=-matrix[i][column_pointer]/matrix[row_pointer][column_pointer];
for(j=0;j<column;j++)
{
matrix[i][j]=matrix[i][j]+n*matrix[row_pointer][j];
}
}
row_pointer++;
column_pointer++;
}
unsigned char Matrix_GetRank(unsigned char type)
{
unsigned char i,j;
for(i=0;i<row;i++)
{
for(j=0;j<column-type;j++)
{
if(matrix[i][j]!=0)
break;
}
if(j==column-type)
break;
}
return i;
}