高斯消元法..docVIP

#include?Stdio.h?#include?Conio.h?/*L是矩阵的行减1,从程序上看是最外层循环的次数??N?对应矩阵的行数，M对应矩阵的列数??可以通过改变L、N、M来控制矩的阶数?*/?#define?L?3?#define?N?4?#define?M?5?void?gauss(double?a[N][M],double?x[N])?{int?i,j,l,n,m,k=0;??double?temp[N];??/*第一个do-while是将增广矩阵消成上三角形式*/??do{n=0;??for(l=k;lL;l++)temp[n++]=a[l+1][k]/a[k][k];??for(m=0,i=k;iN;i++,m++)??for(j=k;jM;j++)a[i+1][j]-=temp[m]*a[k][j];??k++;??}while(kN)?;??/*第二个do-while是将矩阵消成对角形式，并且重新给k赋值*/??k=L-1;??do{n=0;??for(l=k;l=0;l--)temp[n++]=a[k-l][k+1]/a[k+1][k+1];??for(m=0,i=k;i=0;i--,m++)??for(j=k;jM;j++)a[k-i][j]-=temp[m]*a[k+1][j];??k--;??}while(k=0)?;??/*下一个for是解方程组*/??for(i=0;iN;i++)x[i]=a[i][N]/a[i][i];?}?void?menu()?{printf(\n?_?_?_?_?_\n);??printf(?1.operation\n);??printf(?2.exit);??printf(\n?_?_?_?_?_\n);?}?main()?{int?i,j,choose;??double?a[N][M]={0},answer[N];??clrscr();??while(1){??leep:menu();??scanf(%d,choose);??switch(choose){??case?1:??printf(!!The?size?of?Maxrix?is?%d?*?%d,each?line?enter?%d?element:\n?,N,M,M);??for(i=0;iN;i++)??{printf(Enter?the?Matrixs?%d?line:\n,i);??for(j=0;jN+1;j++)??scanf(%lf,a[i][j]);??}??printf(\nthe?corss?matrix?is:\n_?_?_?_?_\n);??gauss(a,answer);??for(i=0;iN;i++)??{for(j=0;jM;j++)??printf(%-2lf?,a[i][j]);??putchar(\n);??}??printf(_?_?_?_?_\nthe?solve?is:\n);??for(i=0;iN;i++)printf(x%d=%lf\n,i+1,answer[i]);??case?2:??exit(0);??default:printf(input?error:\n);goto?leep;??}??}??getch();?}?/*试验：??西安交通大学出版社出版的《计算方法》书上28页的例2.1:??1?2?3?-4?-2??_?-3?-4?-12?13?5??A=?2?10?0?-3?10??4?14?9?-13?7??试验结果：x1=1,x2=2,x3=3,x4=4?*/ #include?Stdio.h?#include?Conio.h?/*L是矩阵的行减1,从程序上看是最外层循环的次数??N?对应矩阵的行数，M对应矩阵的列数??可以通过改变L、N、M来控制矩的阶数?*/?#define?L?3?#define?N?4?#define?M?5?void?gauss(double?a[N][M],double?x[N])?{int?i,j,l,n,m,k=0;??double?temp[N];??/*第一个do-while是将增广矩阵消成上三角形式*/??do{n=0;??for(l=k;lL;l++)temp[n++]=a[l+1][k]/a[k][k];??for(m=0,i=k;iN;i++,m++)??for(j=k;jM;j++)a[i+1][j]-=temp[m]*a[k][j];??k++;??}while(kN)?;??/*