資源簡介
2. 用LDLT分解求解方程組:
x1+2x2+3x3 = -3
2x1+x2-2x3 = 10
3x1-2x2+x3 = 7
x1+2x2+3x3 = -3
2x1+x2-2x3 = 10
3x1-2x2+x3 = 7
代碼片段和文件信息
#include?“iostream.h“
void?main()?
{
int?ijkmn?;
cout<<“請輸入未知數的個數:“< ????cin>>n;
cout<<“請輸入方程的個數:“< ????cin>>m;
double**?a=new?double*[m+1];?//a存放系數
double?*b?=new?double[n+1];//方程的值
double**?l=new?double*[m+1];//L
double?*d?=new?double[n+1];//D
????double?*x?=new?double[n+1];//結果
double?*y?=new?double[n+1];
for(i?=?1;?i {
l[i]=new?double[n+1];?
a[i]=new?double[n+1];?
}??????????????????????????????????????????????????????//初始化
cout<<“請依次輸入“< for(i=1;i {
cout<<“第“< for(j=1;j {
l[i][j]=0;
cin>>a[i][j];
}
cin>>b[i];
}
double?temp;
for(i=1;i {
temp=0;
for(k=1;k temp=temp+l[i][k]*l[i][k]*d[k];
d[i]=a[i][i]-temp;
for(j=i+1;j {
temp=0;
for(k=1;k temp=temp+l[j][k]*d[k]*l[i][k];
l[j][i]=(a[j][i]-temp)/d[i];
}
}
//前代解方程組
y[1]=b[1];
for(i=2;i {
temp=0;
for(k=1;k temp=temp+l[i][k]*y[k];
y[i]=b[i]-temp;
}
//回代
x[n]=y[n]/d[n];
for(i=n-1;i>0;i--)
{
temp=0;
for(k=i+1;k temp=temp+l[k][i]*x[k];
x[i]=y[i]/d[i]-temp;
}
cout<<“方程組的解為:“;
for?(i?=?1;?i? {
cout< }
cout< }
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????1282??2009-04-21?12:34??實驗1_2最終版.plg
?????文件???????4359??2009-04-21?12:34??實驗1_2最終版.dsp
?????文件????????551??2009-04-21?12:33??實驗1_2最終版.dsw
?????文件??????53760??2009-04-21?12:35??實驗1_2最終版.opt
?????文件???????8393??2009-04-21?12:34??Debug\main.obj
?????文件??????41984??2009-04-21?12:34??Debug\vc60.idb
?????文件??????61440??2009-04-21?12:34??Debug\vc60.pdb
?????文件?????208953??2009-04-21?12:34??Debug\實驗1_2最終版.exe
?????文件?????255204??2009-04-21?12:34??Debug\實驗1_2最終版.ilk
?????文件?????244516??2009-04-21?12:34??Debug\實驗1_2最終版.pch
?????文件?????427008??2009-04-21?12:34??Debug\實驗1_2最終版.pdb
?????文件???????1428??2009-04-21?12:34??main.cpp
?????文件??????33792??2009-04-21?12:35??實驗1_2最終版.ncb
?????目錄??????????0??2009-04-21?12:34??Debug
-----------?---------??----------?-----??----
??????????????1342670????????????????????14
- 上一篇:ATM自動取款機系統的分析與設計
- 下一篇:基于8051單片機的紅外接收程序
評論
共有 條評論