le_symmetryregulareuationconjugategradient.cpp
来自「计算机常用数值算法与程序(C++版) Chap07 线性方程组求解」· C++ 代码 · 共 36 行
CPP
36 行
//LE_SymmetryRegularEuationConjugateGradient.cpp
//求解对称正定方程组的共轭梯度法
#include <iostream> //输入输出流头文件
#include "LinearEquation.h" //线性方程(组)求解头文件
void main()
{
int i;
double eps = FLOATERROR;
double a[4][4] =
{
{5.0, 7.0, 6.0, 5.0},
{7.0, 10.0, 8.0, 7.0},
{6.0, 8.0, 10.0, 9.0},
{5.0, 7.0, 9.0, 10.0}
};
double b[4] = {23.0, 32.0, 33.0, 31.0};
valarray<double> xx(4);
valarray<double> bb(b, 4);
matrix<double> aa(&a[0][0], 4, 4);
if(LE_SymmetryRegularEuationConjugateGradient(aa, bb, eps, xx) > 0)
{
for (i=0; i<4; i++)
{
cout << endl << " x(" << i << ") = " << xx[i];
}
}
cout << endl;
}
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?