NAG Library Manual, Mark 30.2
Interfaces:  FL   CL   CPP   AD 

NAG CL Interface Introduction
Example description
/* nag_blast_zger (f16smc) Example Program.
 *
 * Copyright 2024 Numerical Algorithms Group.
 *
 * Mark 30.2, 2024.
 */

#include <nag.h>
#include <stdio.h>

int main(void) {

  /* Scalars */
  Complex alpha, beta;
  Integer exit_status, i, incx, incy, j, m, n, pda, xlen, ylen;

  /* Arrays */
  Complex *a = 0, *x = 0, *y = 0;

  /* Nag Types */
  NagError fail;
  Nag_OrderType order;
  Nag_ConjType conj;

#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

  exit_status = 0;
  conj = Nag_NoConj;
  INIT_FAIL(fail);

  printf("nag_blast_zger (f16smc) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");

  /* Read the problem dimensions */
  scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &m, &n);

  /* Read scalar parameters */
  scanf(" ( %lf , %lf )%*[^\n] ", &alpha.re, &alpha.im);
  scanf(" ( %lf , %lf )%*[^\n] ", &beta.re, &beta.im);
  /* Read increment parameters */
  scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &incx, &incy);

#ifdef NAG_COLUMN_MAJOR
  pda = m;
#else
  pda = n;
#endif

  xlen = MAX(1, 1 + (m - 1) * ABS(incx));
  ylen = MAX(1, 1 + (n - 1) * ABS(incy));

  if (m > 0 && n > 0) {
    /* Allocate memory */
    if (!(a = NAG_ALLOC(m * n, Complex)) || !(x = NAG_ALLOC(xlen, Complex)) ||
        !(y = NAG_ALLOC(ylen, Complex))) {
      printf("Allocation failure\n");
      exit_status = -1;
      goto END;
    }
  } else {
    printf("Invalid m or n\n");
    exit_status = 1;
    return exit_status;
  }

  /* Input matrix A and vectors x and y */

  for (i = 1; i <= m; ++i) {
    for (j = 1; j <= n; ++j)
      scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
    scanf("%*[^\n] ");
  }
  for (i = 0; i < xlen; ++i)
    scanf(" ( %lf , %lf )%*[^\n] ", &x[i].re, &x[i].im);
  for (i = 0; i < ylen; ++i)
    scanf(" ( %lf , %lf )%*[^\n] ", &y[i].re, &y[i].im);

  /* nag_blast_zger (f16smc).
   * Rank one update of complex matrix.
   *
   */
  nag_blast_zger(order, conj, m, n, alpha, x, incx, y, incy, beta, a, pda,
                 &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_blast_zger.\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Print updated matrix A */
  /* nag_file_print_matrix_complex_gen_comp (x04dbc).
   * Print complex general matrix (comprehensive)
   */
  fflush(stdout);
  nag_file_print_matrix_complex_gen_comp(
      order, Nag_GeneralMatrix, Nag_NonUnitDiag, m, n, a, pda, Nag_BracketForm,
      "%7.4f", "Updated Matrix A", Nag_IntegerLabels, 0, Nag_IntegerLabels, 0,
      80, 0, 0, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_file_print_matrix_complex_gen_comp (x04dbc).\n%s"
           "\n",
           fail.message);
    exit_status = 1;
    goto END;
  }

END:
  NAG_FREE(a);
  NAG_FREE(x);
  NAG_FREE(y);

  return exit_status;
}