/* nag_dorglq (f08ajc) Example Program. * * Copyright 2001 Numerical Algorithms Group. * * Mark 7, 2001. */ #include #include #include #include #include int main(void) { /* Scalars */ Integer i, j, m, n, pda, tau_len; Integer exit_status=0; NagError fail; Nag_OrderType order; /* Arrays */ char *title=0; double *a=0, *tau=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("f08ajc Example Program Results\n\n"); /* Skip heading in data file */ Vscanf("%*[^\n] "); Vscanf("%ld%ld%*[^\n] ", &m, &n); #ifdef NAG_COLUMN_MAJOR pda = m; #else pda = n; #endif tau_len = m; /* Allocate memory */ if ( !(title = NAG_ALLOC(31, char)) || !(a = NAG_ALLOC(m * n, double)) || !(tau = NAG_ALLOC(m, double)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } /* Read A from data file */ for (i = 1; i <= m; ++i) { for (j = 1; j <= n; ++j) Vscanf("%lf", &A(i,j)); } Vscanf("%*[^\n] "); /* Compute the LQ factorization of A */ f08ahc(order, m, n, a, pda, tau, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from f08ahc.\n%s\n", fail.message); exit_status = 1; goto END; } /* Form the leading M rows of Q explicitly */ f08ajc(order, m, n, m, a, pda, tau, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from f08ajc.\n%s\n", fail.message); exit_status = 1; goto END; } /* Print the leading M rows of Q only */ Vsprintf(title, "The leading %2ld rows of Q\n", m); x04cac(order, Nag_GeneralMatrix, Nag_NonUnitDiag, m, n, a, pda, title, 0, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from x04cac.\n%s\n", fail.message); exit_status = 1; goto END; } END: if (title) NAG_FREE(title); if (a) NAG_FREE(a); if (tau) NAG_FREE(tau); return exit_status; }