数值分析迭代法C++程序.docVIP

课题三 解线性方程组的迭代法 实验目标： 分别采用Jacobi迭代法，Gauss-Seidel迭代法和SOR迭代法求解线性方程组。 Jocabi迭代法： #includeiostream #includemath.h using namespace std; int i,j,k; //计数器 int M = 2000; int Array(double ***Arr, int n){ double **p; int i; p=(double **)malloc(n*sizeof(double *)); if(!p)return 0; for(i=0;in;i++) { p[i]=(double *)malloc(n*sizeof(double)); if(!p[i])return 0; } *Arr=p; return 1; } void main() { double eps ; cout默认最多迭代次数为2000次endl迭代精度为：; cineps; double **matrix; int n; cout矩阵大小为：; cinn; double *X; X= new double[n]; double *Y; Y= new double[n]; double *G; G= new double[n]; for(i=0;in;i++){ Y[i]=0; } if(!Array(matrix,n)) cout内存分配失败！; else cout请输入矩阵:endl; for( i=0;in;i++){ for( j=0;jn;j++){ cinmatrix[i][j]; } } cout请输入右端项：endl; double *B; B = new double[n]; for(i=0;in;i++){ cinB[i]; } for (i = 0 ;i n;i++) { if (fabs(matrix[i][i]) eps) { cout 打印失败endl; return; } double T = matrix[i][i]; for ( j = 0 ; j n;j++) { matrix[i][j] = -matrix[i][j]/T; } matrix[i][i] = 0; G[i] = B[i]/T; } int counter = 0; while (counter M) { for (i = 0;i n; i++) { double temp = 0; for (j = 0;jn; j++) { temp = temp + matrix[i][j]*Y[j]; } X[i] = G[i] + temp; } double temp = 0; for (i = 0 ;i n ; i++) { temp = temp + fabs(X[i] - Y[i]); } if (temp = eps) break; else { for( i = 0; i n ;i++) { Y[i] = X[i]; } } counter++; } cout 迭代次数为：counter次。该线性方程组的解（X1，X2，X3......Xn）为：endl; for( i = 0; i n ;i++) { cout X[i] ; } }  Gauss-Seidel迭代法： #includeiostream #includemath.h using namespace std; int i,j,k; //计数器 int M = 2000; int Array(double ***Arr, int n){ double **p; int i; p=(double **)malloc(n*sizeof(double *)); if(!p)return 0; for(i=0;in;i++) { p[i]=(double *)malloc(n*sizeof(double)); if(!p[i])return 0; } *Arr=p; return 1; } void main() { double eps ; cout默认最多迭代次数为2000次endl迭代精度为：; cineps; double **matrix; int n; cout矩阵大小为：