/* nag_regsn_mult_linear_tran_model (g02dkc) Example Program. * * Copyright 1991 Numerical Algorithms Group. * * Mark 2, 1991. * Mark 8 revised, 2004. */ #include #include #include #include #define X(I,J) x[(I)*tdx + J] #define C(I,J) c[(I)*tdc + J] #define Q(I,J) q[(I)*tdq + J] int main(void) { Nag_Boolean svd; Integer exit_status=0, i, iconst, ip, j, m, n, rank, *sx=0, tdc, tdq, tdx; NagError fail; Nag_IncludeMean mean; char meanc, weight; double *b=0, *c=0, *com_ar=0, *cov=0, df, *h=0, *p=0, *q=0, *res=0, rss; double *se=0, tol, *wt=0, *wtptr, *x=0, *y=0; INIT_FAIL(fail); Vprintf("nag_regsn_mult_linear_tran_model (g02dkc) 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 (n>=2 && m>=1) { if ( !( h = NAG_ALLOC(n, double)) || !( res = NAG_ALLOC(n, double)) || !( wt = NAG_ALLOC(n, double)) || !( x = NAG_ALLOC(n*m, double)) || !( y = NAG_ALLOC(n, double)) || !( sx = NAG_ALLOC(m, Integer)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } tdx = m; } else { Vprintf("Invalid n.\n"); exit_status = 1; return exit_status; } if (weight=='w') { wtptr = wt; for (i=0; i