6.14 求解线性最小二乘问题的广义逆法 gmiv.c

许士良常用算法程序集C语言,包括c++一些常用算法代码

#include "4ginv.c"

int gmiv(a,m,n,b,x,aa,eps,u,v,ka)
int m,n,ka;
double a[],b[],x[],aa[],u[],v[],eps;
{ 
	int i,j;
    int ginv(double [],int,int,double [],double,double [],double [],int);
    i=ginv(a,m,n,aa,eps,u,v,ka);
    if (i<0) return(-1);
    for (i=0; i<=n-1; i++)
    { 
		x[i]=0.0;
        for (j=0; j<=m-1; j++)
			x[i]=x[i]+aa[i*m+j]*b[j];
    }
    return(1);
}