/* nag_regsn_mult_linear_addrem_obs (g02dcc) Example Program. * * Copyright 1991 Numerical Algorithms Group. * * Mark 2, 1991. * Mark 8 revised, 2004. */ #include #include #include #include #define XM(I,J) xm[(I)*tdxm + J] #define Q(I,J) q[(I)*tdq + J] int main(void) { Nag_Boolean svd; Integer exit_status=0, i, ip, j, m, n, rank, *sx=0, tdq, tdxm; NagError fail; Nag_IncludeMean mean; Nag_UpdateObserv update; char meanc, weight; double *b=0, *com_ar=0, *cov=0, df, *h=0, *p=0, *q=0, *res=0, rss, *se=0; double tol, *wt=0, *wtptr, *xm=0, *y=0; INIT_FAIL(fail); Vprintf("nag_regsn_mult_linear_addrem_obs (g02dcc) Example Program " "Results\n"); /* Skip heading in data file */ Vscanf("%*[^\n]"); Vscanf("%ld %ld %c %c", &n, &m, &weight, &meanc); if (meanc=='m') mean = Nag_MeanInclude; else mean = Nag_MeanZero; if (weight=='w') wtptr = wt; else wtptr = (double *)0; if (n>=2 && m>=1) { if ( !( b = NAG_ALLOC(m, double)) || !( h = NAG_ALLOC(n, double)) || !( res = NAG_ALLOC(n, double)) || !( wt = NAG_ALLOC(n, double)) || !( xm = NAG_ALLOC(n*m, double)) || !( y = NAG_ALLOC(n, double)) || !( sx = NAG_ALLOC(m, Integer)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } tdxm = m; } else { Vprintf("Invalid n or m.\n"); exit_status = 1; return exit_status; } if (wtptr) { for (i=0; i