📄 d1r8.cpp
字号:
#include "iostream.h"
#include "math.h"
void main()
{
//program d1r8
//driver program for routine svbksb,svdcmp
int i,j,k,l,n = 5;
double a[6][6], b[6], u[26], v[26], w[6], x[6];
//输入已知的方程组的系数矩阵
a[1][1]=1.4; a[1][2]=2.1; a[1][3]=2.1; a[1][4]=7.4; a[1][5]=9.6;
a[2][1]=1.6; a[2][2]=1.5; a[2][3]=1.1; a[2][4]=0.7; a[2][5]=5.0;
a[3][1]=3.8; a[3][2]=8.0; a[3][3]=9.6; a[3][4]=5.4; a[3][5]=8.8;
a[4][1]=4.6; a[4][2]=8.2; a[4][3]=8.4; a[4][4]=0.4; a[4][5]=8.0;
a[5][1]=2.6; a[5][2]=2.9; a[5][3]=0.1; a[5][4]=9.9; a[5][5]=7.7;
//输入已知的方程组的右端向量b
b[1] = 1.1;
b[2] = 1.6;
b[3] = 4.7;
b[4] = 9.1;
b[5] = 0.1;
cout.setf(ios::fixed|ios::right);
cout.precision(5);
cout<<endl;
cout<<"已知的方程组的右端向量"<<endl;
cout.width(12); cout<<b[1]<<endl;
cout.width(12); cout<<b[2]<<endl;
cout.width(12); cout<<b[3]<<endl;
cout.width(12); cout<<b[4]<<endl;
cout.width(12); cout<<b[5]<<endl;
for (i = 1; i<=n; i++)
{
for (j = 1; j<=n; j++)
{
u[(i-1)*n+j] = a[i][j];
//a1[(i-1)*n+j]=a[i][j];
}
}
svdcmp(u, n, n, w, v);
//find maximum singular vaulue
double wmax, wmin;
wmax = 0.0;
for (k = 1; k<=n; k++)
{
if (w[k] > wmax)
{
wmax = w[k];
}
}
//define"small"
wmin = wmax * 0.0000001;
//zero the "small" singular values
for (k = 1; k<=n; k++)
{
if (w[k] < wmin)
{
w[k] = 0.0;
}
}
svbksb(u, w, v, n, n, b, x);
cout<<endl;
cout<<"计算出的方程组的解"<<endl;
cout.width(12); cout<<x[1]<<endl;
cout.width(12); cout<<x[2]<<endl;
cout.width(12); cout<<x[3]<<endl;
cout.width(12); cout<<x[4]<<endl;
cout.width(12); cout<<x[5]<<endl;
//将计算出的解乘以系数矩阵,以验证计算结果正确
for (l = 1; l<=n;l++)
{
b[l] = 0.0;
for (j = 1; j<=n; j++)
{
b[l] = b[l] + a[l][j] * x[j];
}
}
cout<<endl;
cout<<"计算出的解乘以系数矩阵的结果"<<endl;
cout.width(12); cout<<b[1]<<endl;
cout.width(12); cout<<b[2]<<endl;
cout.width(12); cout<<b[3]<<endl;
cout.width(12); cout<<b[4]<<endl;
cout.width(12); cout<<b[5]<<endl;
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -