/* nag_zptsvx (f07jpc) Example Program. * * Copyright 2004 Numerical Algorithms Group. * * Mark 23, 2011. */ #include #include #include #include #include int main(void) { /* Scalars */ double rcond; Integer exit_status = 0, i, j, n, nrhs, pdb, pdx; /* Arrays */ Complex *b = 0, *e = 0, *ef = 0, *x = 0; double *berr = 0, *d = 0, *df = 0, *ferr = 0; /* Nag Types */ NagError fail; Nag_OrderType order; #ifdef NAG_COLUMN_MAJOR #define B(I, J) b[(J-1)*pdb + I - 1] order = Nag_ColMajor; #else #define B(I, J) b[(I-1)*pdb + J - 1] order = Nag_RowMajor; #endif INIT_FAIL(fail); printf("nag_zptsvx (f07jpc) Example Program Results\n\n"); /* Skip heading in data file */ scanf("%*[^\n]"); scanf("%ld%ld%*[^\n]", &n, &nrhs); if (n < 0 || nrhs < 0) { printf("Invalid n or nrhs\n"); exit_status = 1; goto END; } /* Allocate memory */ if (!(b = NAG_ALLOC(n * nrhs, Complex)) || !(x = NAG_ALLOC(n * nrhs, Complex)) || !(e = NAG_ALLOC(n-1, Complex)) || !(ef = NAG_ALLOC(n-1, Complex)) || !(d = NAG_ALLOC(n, double)) || !(df = NAG_ALLOC(n, double)) || !(berr = NAG_ALLOC(nrhs, double)) || !(ferr = NAG_ALLOC(nrhs, double))) { printf("Allocation failure\n"); exit_status = -1; goto END; } #ifdef NAG_COLUMN_MAJOR pdb = n; pdx = n; #else pdb = nrhs; pdx = nrhs; #endif /* Read the lower bidiagonal part of the tridiagonal matrix A and */ /* the right hand side b from data file */ for (i = 0; i < n; ++i) scanf("%lf", &d[i]); scanf("%*[^\n]"); for (i = 0; i < n - 1; ++i) scanf(" ( %lf , %lf )", &e[i].re, &e[i].im); scanf("%*[^\n]"); for (i = 1; i <= n; ++i) for (j = 1; j <= nrhs; ++j) scanf(" ( %lf , %lf )", &B(i, j).re, &B(i, j).im); scanf("%*[^\n]"); /* Solve the equations AX = B for X using nag_zptsvx (f07jpc). */ nag_zptsvx(order, Nag_NotFactored, n, nrhs, d, e, df, ef, b, pdb, x, pdx, &rcond, ferr, berr, &fail); if (fail.code != NE_NOERROR && fail.code != NE_SINGULAR) { printf("Error from nag_zptsvx (f07jpc).\n%s\n", fail.message); exit_status = 1; goto END; } /* Print solution, error bounds and condition number using * nag_gen_complx_mat_print_comp (x04dbc). */ fflush(stdout); nag_gen_complx_mat_print_comp(order, Nag_GeneralMatrix, Nag_NonUnitDiag, n, nrhs, x, pdx, Nag_BracketForm, "%7.4f", "Solution(s)", Nag_IntegerLabels, 0, Nag_IntegerLabels, 0, 80, 0, 0, &fail); if (fail.code != NE_NOERROR) { printf("Error from nag_gen_complx_mat_print_comp (x04dbc).\n%s\n", fail.message); exit_status = 1; goto END; } printf("\nBackward errors (machine-dependent)\n"); for (j = 0; j < nrhs; ++j) printf("%11.1e%s", berr[j], j%7 == 6?"\n":" "); printf("\n\nEstimated forward error bounds (machine-dependent)\n"); for (j = 0; j < nrhs; ++j) printf("%11.1e%s", ferr[j], j%7 == 6?"\n":" "); printf("\nEstimate of reciprocal condition number\n%11.1e\n", rcond); if (fail.code == NE_SINGULAR) { printf("Error from nag_zptsvx (f07jpc).\n%s\n", fail.message); exit_status = 1; } END: if (b) NAG_FREE(b); if (x) NAG_FREE(x); if (e) NAG_FREE(e); if (ef) NAG_FREE(ef); if (d) NAG_FREE(d); if (df) NAG_FREE(df); if (berr) NAG_FREE(berr); if (ferr) NAG_FREE(ferr); return exit_status; } #undef B