最小二乘广义逆法.DOCVIP

浅述逆向广义最小二乘法1.算法原理 设非线性方程组为 其雅可比矩阵为 计算非线性方程分组最小二乘解的迭代公式为： 其中为线性代数方程组的线性最小二乘解，即 式中为k次迭代值的雅可比矩阵；为k次迭代值的左端函数值，即 为使的一元函数达到极小值的点。在本函数中利用有理极值法计算。 int m,n,ka; double eps1,eps2; InitCord(); static double x[5]; for (int i = 0; i 5; i++) { x[i] = init; } m = 30+15+10+4; n = 5; ka = 60; eps1 = 0.000001; eps2 = 0.000001; int k = dngin(m, n, eps1, eps2, x, ka); //求解非线性方程组 for (i = 0; i 5; i++) { xc[i] = x[i]*xu[i]; yc[i] = x[i]*yu[i]; zc[i] = x[i]*f; } //得出最终求解结果 Return; ////////////////////////////////////////////////////////////// //计算方程式函数 dnginf(int m,int n,double x[],double d[])//输入方程式 { int i, j, l, k, c; //任取三个点组成三角形，一个三角形三个夹角。共30个约束 for(i = 0; i n; i++) for (j = i + 1; j n; j++) for (k = j + 1; k n; k++) { d[nExpression] = ExpressionSolve(x, i, j, k); nExpression++; d[nExpression] = ExpressionSolve(x, j, k, i); nExpression++; d[nExpression] = ExpressionSolve(x, k, i, j); nExpression++; } //任取四个点组成两个向量，三种组合方式三个夹角。共15个约束 for (c = 0; c n; c++) { i = (c + 1)%5; j = (c + 2)%5; l = (c + 3)%5; k = (c + 4)%5; d[nExpression] = ExpressionSolve(x, i, j, l, k); nExpression++; d[nExpression] = ExpressionSolve(x, i, l, j, k); nExpression++; d[nExpression] = ExpressionSolve(x, i, k, j, l); nExpression++; } //任取两个点组成一个向量，向量长度。共10个约束 for (i = 0; i n; i++) for (j = i + 1; j n; j++) { d[nExpression] = ExpressionSolve(x, i, j); nExpression++; } //四点共面约束，共4个 for (i = 1; i n; i++) { d[nExpression] = ExpressionSolve(x, i); nExpression++; } nExpression = 0; //nExpression清零 return; } //计算雅可比矩阵函数 dngins(int m,int n,double x[],double p[])//雅可比矩阵 { int i, j, l, k, c; //任取三个点组成三角形，一个三角形三个夹角。共30个约束 for(i = 0; i n; i++) for (j = i + 1; j n; j++) for (k = j + 1; k n; k++) { CoefficientSolve(x, p, i, j, k); nCoefficient++; CoefficientSolve(x, p, j, k, i); nCoefficient++; Coefficient