ss-seidel:\n"; int t=0;//迭代次数 while(t<20)//次数限制
ss-seidel:\n"; int t=0;// die dai ci shu while(t<20)// ci shu xian zhi
d gaussseidel()//高斯--塞得尔迭带法 { cout<<"gau
d gaussseidel()// gao si -- sai de er die dai fa { cout<<"gau
k++) { cin>>b[k]; x[k] = 0.0;//初始化x }}voi
k++) { cin>>b[k]; x[k] = 0.0;// chu shi hua x }}voi
out<<"输入线形方程组的常数项距阵:\n"; for(int k=0;k<n;
out<<" shu ru xian xing fang cheng zu de chang shu xiang ju zhen :\n"; for(int k=0;k<n;
=0;j<n;j++) cin >> a[i][j]; c
=0;j<n;j++) cin >> a[i][j]; c
阵:\n"; for(int i=0;i<n;i++) for(int j
zhen :\n"; for(int i=0;i<n;i++) for(int j
nt[n]; x = new double[n]; cout<<"输入线形方程的系数距
nt[n]; x = new double[n]; cout<<" shu ru xian xing fang cheng de xi shu ju
=0;i<n;i++) a[i] = new int[n]; 北京青年政治学院b = new i
=0;i<n;i++) a[i] = new int[n]; bei jing qing nian zheng zhi xue yuan b = new i
[n]; n = new double[n]; a = new int*[n]; for(int i
[n]; n = new double[n]; a = new int*[n]; for(int i
;<"输入线性方程北京青年政治学院的维数: "; cin>>n; m=new double
;<" shu ru xian xing fang cheng bei jing qing nian zheng zhi xue yuan de wei shu : "; cin>>n; m=new double
*x;//解距阵void initializtion() //初始化线形方程{ cout<
*x;// jie ju zhen void initializtion() // chu shi hua xian xing fang cheng { cout<
e *n;//辅助距阵int **a;//线形方程的系数距阵int *b;//常数项距阵double
e *n;// fu zhu ju zhen int **a;// xian xing fang cheng de xi shu ju zhen int *b;// chang shu xiang ju zhen double
amespace std;int北京青年政治学院 n; //线性方程的维数double *m;//辅助距阵doubl
amespace std;int bei jing qing nian zheng zhi xue yuan n; // xian xing fang cheng de wei shu double *m;// fu zhu ju zhen doubl
lude<iostream>#include<iomanip>using n
lude<iostream>#include<iomanip>using n
truecn date: 15-12-06 17:45 de北京青年政治学院scription: */ #inc
truecn date: 15-12-06 17:45 de bei jing qing nian zheng zhi xue yuan scription: */ #inc
较如下:/* name: 解线形方程组的基本迭代法 copyright: author:
jiao ru xia :/* name: jie xian xing fang cheng zu de ji ben die dai fa copyright: author:
当x[j]已经求出) 可以看出高斯法的效率要高于雅可北京青年政治学院比迭代; 用雅可比迭代和高斯迭代的程序代码比
dang x[j] yi jing qiu chu ) ke yi kan chu gao si fa de xiao lv yao gao yu ya ke bei jing qing nian zheng zhi xue yuan bi die dai ; yong ya ke bi die dai he gao si die dai de cheng xu dai ma bi
不同在于将上式中的x[i]边更新边代入计算,也即在求x[i](k+1)时会用到x[j](k+1),(
bu tong zai yu jiang shang shi zhong de x[i] bian geng xin bian dai ru ji suan , ye ji zai qiu x[i](k+1) shi hui yong dao x[j](k+1),(
]-σ(a[i][j]*x[j](k) ) )注:x[i](k)北京青年政治学院表示第k次迭代后x[i]的值高斯法的
]- (a[i][j]*x[j](k) ) ) zhu :x[i](k) bei jing qing nian zheng zhi xue yuan biao shi di k ci die dai hou x[i] de zhi gao si fa de
本文主要比较雅可比迭代和高斯迭代,细节请查书中介绍.雅可比迭代公式:x[i](k+1)=( b[i
ben wen zhu yao bi jiao ya ke bi die dai he gao si die dai , xi jie qing cha shu zhong jie shao . ya ke bi die dai gong shi :x[i](k+1)=( b[i