c 解线性方程组的几种方法（Several methods of solving linear equations by C）.docVIP

c 解线性方程组的几种方法（Several methods of solving linear equations by C） #包括 iostream。” #包括 iomanip。” #包括程序。” / / ----------------------------------------------全局变量定义区 const int数= 15；//方程最大个数 双[数] [数]，B [数]，copy_a [数] [数]，copy_b [数]；//系数行列式 国际a_y [数]；// [ ] [ ]中随着横坐标增加列坐标的排列顺序，如一[ 0 ] [ 0 ]，一个[ 1 ] [ 2 ]，一个[ 2 ] [ 1 ]…则a_y [ ] = { 0,2,1…}； int的长度，copy_lenth；/ /方程的个数 双a_sum；/ /计算行列式的值 char * x；//未知量A，B，C的载体 / / ----------------------------------------------函数声明区 无效（）；//输入方程组 print_menu() /打印主菜单无效； int（）；//输入选择选择 cramer() /克莱默算法解方程组无效； gauss_row() /高斯列主元解方程组无效； guass_all() /高斯全主元解方程组无效； 无效doolittle()；/ /用杜利特算法解方程组 国际doolittle_check（双[ ] [数]，双B [数]）；//判断是否行列式 0，若是，调整为顺序主子式全 0 无效xiaoqu_u_l()；/ /将行列式杜利特分解 无效calculate_u_l()；/ /计算杜利特结果 两calculate_a（int，int m）；/ /计算行列式 双quanpailie_a()； According to the calculation of the coordinates of the arrangement of column / value, such as A_y[]={0,2,1}, sum=a[0][A_y[0] a[1][A_y[1]]] * * a[2][A_y[2]]=a[0][0]*a[1][2]*a[2][1]; Void exchange (int m, int i); / / A_y[m] exchange, A_y[i] Void exchange_lie (int j); / / exchange a[][j] and b[]; Void exchange_hang (int m, int n); / / a[][] and N respectively to exchange M and b[] in the two row Void gauss_row_xiaoqu (); //Gauss column principal elimination Void, gauss_all_xiaoqu (); //Gauss total principal elimination Void (gauss_calculate); / / Gauss elimination method to calculate the unknown amount according to the value of the Void exchange_a_lie (int m, int n and n m); / / exchange columns in a[][] Void exchange_x (int m, int n); / / x[] exchange in x[m] and x[n] Void (recovery); / / data recovery The main function. Void, main () { Int flag=1; (input); / / input equation While (flag) { (print_menu); / / menu (flag=choose); / / select solutions } } / / function defined area Void, print_menu () { System (CLS); The cout - equation coefficients and constant matrix expressed as follows: \n; For (int j=0; jlenth; j++) Cout coefficient j+1; Cout \t constant; Coutendl; For (int i=0; ilenth; i++) { For (j=