数值分析 迭代法 C 程序

cin>>n;
{
double *X;
matrix[i][j] = -matrix[i][j]/T;
X= new double[n];
double *Y;
}
Y= new double[n];
matrix[i][i] = 0;
double *G;
G[i] = B[i]/T;
G= new double[n];
#include<iostream>
#include<math.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 *));
Y[i] = X[i]; } } counter++; } cout << "迭代次数为："<<counter<<"次。该线性 方程组的解（X1，X2，X3......Xn）为："<<endl; for( i = 0; i < n ;i++) {
cout << X[i] <<" ";
}
}
SOR 迭代法:
cout<<"默认最多迭代次数为2000次"<<endl<<"迭
{
代精度为：";
cout <<"打印失败"<<endl;
cin>>eps;
return;
double **matrix;
}
int n;
double T = matrix[i][i];
cout<<"矩阵大小为：";
for ( j = 0 ; j< n;j++)
代精度为：";
cin>>eps;
double **matrix;
int n; cout<<"矩阵大小为："; cin>>n; double *X; X= new double[n]; double *Y; Y= new double[n]; double *G; G= new double[n];
for(i=0;i<n;i++){ Y[i]=0; } if(!Array(&matrix,n)) cout<<"内存分配失败！"; else cout<<"请输入矩阵:"<<endl; for( i=0;i<n;i++){
if(!p)return 0;
for(i=0;i<n;i++)
{
p[i]=(double *)malloc(n*sizeof(double));
if(!p[i])return 0;
}
*Arr=p;
return 1;
}
void main()
{
double eps ;
cout<<"默认最多迭代次数为2000次"<<endl<<"迭
temp = temp + matrix[i][j]*X[j]; } X[i] = G[i] + temp; } double temp = 0; for (i = 0 ;i< n ; i++) { temp = temp + fabs(X[i] - Y[i]); } //cout<<temp<<" "; if (temp <= eps) break; else { for( i = 0; i < n ;i++) {
p=(double **)malloc(n*sizeof(doublex[i][j];
if(!p)return 0;
}
for(i=0;i<n;i++)
}
{
p[i]=(double *)malloc(n*sizeof(double)); cout<<"请输入右端项："<<endl;
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] <<" "; }
}
int counter = 0;
for(i=0;i<n;i++){
while (counter < M)
{ for (i = 0;i < n; i++) { double temp = 0; for (j = 0;j<n; j++) { temp = temp + matrix[i][j]*Y[j]; } X[i] = G[i] + temp; }
double temp = 0; for (j = 0;j<n; j++) {
temp = temp + matrix[i][j]*X[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 { //交?换?X，ê?Y向¨°量¢?；ê? for( i = 0; i < n ;i++) {
for(i=0;i<n;i++){ Y[i]=0;
} if(!Array(&matrix,n))
cout<<"内存分配失败！"; else cout<<"请输入矩阵:"<<endl;
for( i=0;i<n;i++){ for( j=0;j<n;j++){ cin>>matrix[i][j]; }
}
}
Gauss-Seidel 迭代法：
#include<iostream>
#include<math.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;i<n;i++) {
if(!p[i])return 0;
double *B;
}
B = new double[n];
*Arr=p;
for(i=0;i<n;i++){
return 1;
cin>>B[i];
}
}
void main()
for (i = 0 ;i< n;i++)
{
{
double eps ;
if (fabs(matrix[i][i]) < eps)
p[i]=(double *)malloc(n*sizeof(double)); if(!p[i])return 0; } *Arr=p;
return 1; } void main() {
double eps ; cout<<"默认最多迭代次数为2000次"<<endl<<"迭 代精度为："; cin>>eps; double **matrix; int n; cout<<"矩阵大小为："; cin>>n; double *X; X= new double[n]; double *Y; Y= new double[n]; double *G; G= new double[n];
int i,j,k;
//计数器
cout<<"内存分配失败！";
int M = 2000;
else
int Array(double ***Arr, int n){
cout<<"请输入矩阵:"<<endl;
double **p;
for( i=0;i<n;i++){