rootleastsquaregeneralizedinverse2.cpp

何光渝所著《计算机常用数值算法与程序(C++版)》的随书源代码。 是想学习C++科学计算的人士的必看代码。

//RootLeastSquareGeneralizedInverse2.cpp	
//非线性方程组最小二乘解的广义逆法示例2

#include <iostream>				//输入输出流头文件
#include "LinearEquation.h"		//线性方程组求解头文件
#include "NonLinearEquation.h"	//非线性方程(组)求解头文件
using namespace std;			//名字空间

void main(void)
{	
	int m(3), i, ka(4);
    double eps1(FLOATERROR), eps2(FLOATERROR);
    valarray<double> x(2);
	
	x[0] =  1.0;
	x[1] = -1.0;
        
	cout << "RootLeastSquareGeneralizedInverse2()" << endl;

	i = RootLeastSquareGeneralizedInverse(m, eps1, eps2, x, ka);

    cout << endl;
	cout << "i= " << i << endl << endl;
	
    for (i=0; i < 2; i++)
		cout << "x(" << i << ") = " << x[i] << endl;

	cout<<endl;
}

//计算非线性方程组左边函数值
template <class _Ty>
void FunctionValueRLSGI(valarray<_Ty>& x,valarray<_Ty>& d)
{ 
    d[0] = x[0] * x[0] + 7.0 * x[0] * x[1] + 3.0 * x[1] * x[1] + 0.5;
    d[1] = x[0] * x[0] - 2.0 * x[0] * x[1] + x[1] * x[1] - 1.0;
    d[2] = x[0] + x[1] + 1.0;
}

//计算雅可比矩阵
template <class _Ty>
void JacobiMatrix(valarray<_Ty>& x, matrix<_Ty>& p)
{
    p(0,0) = 2.0 * x[0] + 7.0*x[1];
    p(0,1) = 7.0 * x[0] + 6.0*x[1];
    p(1,0) = 2.0 * x[0] - 2.0*x[1];
    p(1,1) = -2.0 * x[0] + 2.0*x[1];
    p(2,0) = 1.0;
    p(2,1) = 1.0;
}