/* nag_ztpmv (f16shc) Example Program. * * Copyright 2005 Numerical Algorithms Group. * * Mark 8, 2005. */ #include #include #include #include #include int main(void) { /* Scalars */ Complex alpha; Integer aplen, exit_status, i, incx, j, n, xlen; /* Arrays */ Complex *ap=0, *x=0; char nag_enum_arg[40]; /* Nag Types */ NagError fail; Nag_DiagType diag; Nag_OrderType order; Nag_TransType trans; Nag_UploType uplo; #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 exit_status = 0; INIT_FAIL(fail); Vprintf( "nag_ztpmv (f16shc) Example Program Results\n\n"); /* Skip heading in data file */ Vscanf("%*[^\n] "); /* Read the problem dimension */ Vscanf("%ld%*[^\n] ", &n); /* Read uplo */ Vscanf("%s%*[^\n] ", nag_enum_arg); /* nag_enum_name_to_value(x04nac). * Converts NAG enum member name to value */ uplo = nag_enum_name_to_value(nag_enum_arg); /* Read trans */ Vscanf("%s%*[^\n] ", nag_enum_arg); /* nag_enum_name_to_value(x04nac). * Converts NAG enum member name to value */ trans = nag_enum_name_to_value(nag_enum_arg); /* Read diag */ Vscanf("%s%*[^\n] ", nag_enum_arg); /* nag_enum_name_to_value(x04nac). * Converts NAG enum member name to value */ diag = nag_enum_name_to_value(nag_enum_arg); /* Read scalar parameters */ Vscanf(" ( %lf , %lf )%*[^\n] ", &alpha.re, &alpha.im); /* Read increment parameters */ Vscanf("%ld%*[^\n] ", &incx); aplen = n*(n+1)/2; xlen = MAX(1, 1 + (n - 1)*ABS(incx)); if (n > 0) { /* Allocate memory */ if ( !(ap = NAG_ALLOC(aplen, Complex)) || !(x = NAG_ALLOC(xlen, Complex)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } } else { Vprintf("Invalid n\n"); exit_status = 1; return exit_status; } /* Read A from data file */ if (uplo == Nag_Upper) { for (i = 1; i <= n; ++i) { for (j = i; j <= n; ++j) Vscanf(" ( %lf , %lf )", &A_UPPER(i,j).re, &A_UPPER(i,j).im); } Vscanf("%*[^\n] "); } else { for (i = 1; i <= n; ++i) { for (j = 1; j <= i; ++j) Vscanf(" ( %lf , %lf ) ", &A_LOWER(i,j).re, &A_LOWER(i,j).im); } Vscanf("%*[^\n] "); } /* Input vector x */ for (i = 1; i <= xlen; ++i) Vscanf(" ( %lf , %lf )%*[^\n] ", &x[i - 1].re, &x[i - 1].im); /* nag_ztpmv(f16shc). * Complex triangular packed storage matrix-vector multiply. * */ nag_ztpmv(order, uplo, trans, diag, n, alpha, ap, x, incx, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from ztpmv.\n%s\n", fail.message); exit_status = 1; goto END; } /* Print output vector x */ Vprintf("%s\n", " x"); for (i = 1; i <= xlen; ++i) Vprintf("(%11f,%11f)\n", x[i-1].re, x[i - 1].im); END: if (ap) NAG_FREE(ap); if (x) NAG_FREE(x); return exit_status; }