/* nag_real_cholesky_solve_mult_rhs (f04agc) Example Program. * * Copyright 1996 Numerical Algorithms Group. * * Mark 4, 1996. * Mark 8 revised, 2004. */ #include #include #include #include #include #define A(I,J) a[(I)*tda + J] #define B(I,J) b[(I)*tdb + J] #define X(I,J) x[(I)*tdx + J] int main(void) { Integer exit_status=0, i, id, j, n, nrhs, tda, tdb, tdx; NagError fail; double *a=0, *b=0, d1, *p=0, *x=0; INIT_FAIL(fail); Vprintf("nag_real_cholesky_solve_mult_rhs (f04agc) Example Program" " Results\n"); /* Skip heading in data file */ Vscanf("%*[^\n]"); Vscanf("%ld", &n); nrhs = 1; if (n>=1) { if ( !( a = NAG_ALLOC(n*n, double)) || !( b = NAG_ALLOC(n*nrhs, double)) || !( p = NAG_ALLOC(n, double)) || !( x = NAG_ALLOC(n*nrhs, double)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } tda = n; tdb = nrhs; tdx = nrhs; } else { Vprintf("Invalid n.\n"); exit_status = 1; return exit_status; } for (i=0; i