/* nag_dpptrf (f07gdc) Example Program. * * Copyright 2001 Numerical Algorithms Group. * * Mark 7, 2001. */ #include #include #include #include #include int main(void) { /* Scalars */ Integer ap_len, i, j, n; Integer exit_status=0; Nag_UploType uplo_enum; NagError fail; Nag_OrderType order; /* Arrays */ char uplo[2]; double *ap=0; #ifdef NAG_COLUMN_MAJOR #define A_UPPER(I,J) ap[J*(J-1)/2 + I - 1] #define A_LOWER(I,J) ap[(2*n-J)*(J-1)/2 + I - 1] order = Nag_ColMajor; #else #define A_LOWER(I,J) ap[I*(I-1)/2 + J - 1] #define A_UPPER(I,J) ap[(2*n-I)*(I-1)/2 + J - 1] order = Nag_RowMajor; #endif INIT_FAIL(fail); Vprintf("f07gdc Example Program Results\n\n"); /* Skip heading in data file */ Vscanf("%*[^\n] "); Vscanf("%ld%*[^\n] ", &n); ap_len = n*(n+1)/2; /* Allocate memory */ if ( !(ap = NAG_ALLOC(ap_len, double)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } /* Read A from data file */ Vscanf(" ' %1s '%*[^\n] ", uplo); if (*(unsigned char *)uplo == 'L') uplo_enum = Nag_Lower; else if (*(unsigned char *)uplo == 'U') uplo_enum = Nag_Upper; else { Vprintf("Unrecognised character for Nag_UploType type\n"); exit_status = -1; goto END; } if (uplo_enum == Nag_Upper) { for (i = 1; i <= n; ++i) { for (j = i; j <= n; ++j) Vscanf("%lf", &A_UPPER(i,j)); } Vscanf("%*[^\n] "); } else { for (i = 1; i <= n; ++i) { for (j = 1; j <= i; ++j) Vscanf("%lf", &A_LOWER(i,j)); } Vscanf("%*[^\n] "); } /* Factorize A */ f07gdc(order, uplo_enum, n, ap, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from f07gdc.\n%s\n", fail.message); exit_status = 1; goto END; } /* Print factor */ x04ccc(order, uplo_enum, Nag_NonUnitDiag, n, ap, "Factor", 0, NAGERR_DEFAULT); if (fail.code != NE_NOERROR) { Vprintf("Error from x04ccc.\n%s\n",fail.message); exit_status = 1; goto END; } END: if (ap) NAG_FREE(ap); return exit_status; }