数值分析_列主元高斯消元法_直接LU分解.docxVIP

实验要求 算法描述 实验代码 //列主元高斯消元法 #includeiostream #includecmath using namespace std; double A[100][100];//系数矩阵 double b[100];//右端项 double x[100];//结果 double e;//用于溢出控制 int n;//矩阵n*n大小 int main() { cout ----列主元高斯消元法----\n; cout 请输入矩阵的大小n及e:; cin n e;//1.输入A,b,e cout 请输入系数矩阵: endl; for (int i = 1; i = n; i++) for (int j = 1; j =n; j++) cin A[i][j]; cout 请输入右端矩阵: endl; for (int i = 1; i = n; i++)cin b[i]; for (int k = 1; k = n - 1; k++)//2.选主元及消元 { double T = A[k][k]; int ik = k; for (int l = k + 1; l = n; l++)if (A[l][k]T){ T = A[l][k]; ik = l; } if (T e){ cout 求解失败. endl; exit(0);} if (ik != k) { double temp; for (int l = 1; l = n; l++)//交换ik行和k行 { temp = A[ik][l]; A[ik][l] = A[k][l]; A[k][l] = temp; } temp = b[ik]; b[ik] = b[k]; b[k] = temp;//交换b_ik和bk } for (int i = k + 1; i = n; i++) { T = A[i][k] / A[k][k]; b[i] = b[i] - T*b[k]; for (int j = k + 1; j = n; j++) { A[i][j] = A[i][j] - T*A[k][j]; } } } //3.回代 if (abs(A[n][n]) = e){ cout 求解失败. endl; exit(0); } x[n] = b[n] / A[n][n]; for (int i = n - 1; i = 1; i--) { double sum = 0; for (int j = i + 1; j = n; j++)sum += A[i][j] * x[j]; x[i] = (b[i] - sum) / A[i][i]; } cout 结果: endl; //打印xi for (int i = 1; i = n; i++)cout x[i] ; cout endl; return 0; } //直接LU分解法 #includeiostream #includecmath using namespace std; double A[100][100];//系数矩阵 double b[100];//右端项 double u[100][100];//u矩阵 double l[100][100];//l矩阵 double y[100];//中间变量 double x[100];//结果 double e;//用于溢出控制 int n;//矩阵n*n大小 int main() { cout ----直接LU分解法----\n; cout 请输入矩阵的大小n及e:; cin n e;//1.输入A,b,e cout 请输入系数矩阵: endl; for (int i = 1; i = n; i++) for (int j = 1; j = n; j++) cin A[i][j]; cout 请输入右端矩阵: endl; for (int i = 1; i = n; i++)cin b[i]; //2.计算u_kj，l_ik for (int k = 1; k = n; k++) { for (int j = k; j = n; j++) { double sum = 0; for (int m = 1; m = k - 1; m++)sum += l[k][m] * u[m][j]; u[k][j] = A[k][j] - sum; if (abs(u[k][k])