/* nag_dgetri (f07ajc) Example Program. * * Copyright 2001 Numerical Algorithms Group. * * Mark 7, 2001. */ #include #include #include #include #include int main(void) { /* Scalars */ Integer i, ipiv_len, j, n, pda; Integer exit_status=0; NagError fail; Nag_OrderType order; /* Arrays */ double *a=0; Integer *ipiv=0; #ifdef NAG_COLUMN_MAJOR #define A(I,J) a[(J-1)*pda + I - 1] order = Nag_ColMajor; #else #define A(I,J) a[(I-1)*pda + J - 1] order = Nag_RowMajor; #endif INIT_FAIL(fail); Vprintf("f07ajc Example Program Results\n\n"); /* Skip heading in data file */ Vscanf("%*[^\n] "); Vscanf("%ld%*[^\n] ", &n); #ifdef NAG_COLUMN_MAJOR pda = n; #else pda = n; #endif ipiv_len = n; /* Allocate memory */ if ( !(a = NAG_ALLOC(n * n, double)) || !(ipiv = NAG_ALLOC(n, Integer)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } /* Read A from data file */ for (i = 1; i <= n; ++i) { for (j = 1; j <= n; ++j) Vscanf("%lf", &A(i,j)); } Vscanf("%*[^\n] "); /* Factorize A */ f07adc(order, n, n, a, pda, ipiv, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from f07adc.\n%s\n", fail.message); exit_status = 1; goto END; } /* Compute inverse of A */ f07ajc(order, n, a, pda, ipiv, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from f07ajc.\n%s\n", fail.message); exit_status = 1; goto END; } /* Print inverse */ x04cac(order, Nag_GeneralMatrix, Nag_NonUnitDiag, n, n, a, pda, "Inverse", 0, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from x04cac.\n%s\n", fail.message); exit_status = 1; goto END; } END: if (a) NAG_FREE(a); if (ipiv) NAG_FREE(ipiv); return exit_status; }