/* nag_zcgesv (f07aqc) Example Program.
 *
 * Copyright 2009, Numerical Algorithms Group.
 *
 * Mark 23, 2011.
 */

#include <stdio.h>
#include <math.h>
#include <nag.h>
#include <nag_stdlib.h>
#include <nagf07.h>
#include <nagx04.h>

int main(void)
{
  /* Scalars */
  Integer       exit_status = 0;
  Integer       i, iter, j, n, nrhs, pda, pdb, pdx;

  /* Arrays */
  Integer       *ipiv = 0;
  Complex       *a = 0, *b = 0, *x = 0;

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

  INIT_FAIL(fail);

  printf("nag_zcgesv (f07aqc) Example Program Results\n\n");
  /* Skip heading in data file*/
  scanf("%*[^\n]");
  scanf("%ld%ld%*[^\n]", &n, &nrhs);

  if (n < 0 || nrhs < 0)
    {
      printf("Invalid n or nrhs\n");
      exit_status = 1;
      return exit_status;
    }

  pda = n;
#ifdef NAG_COLUMN_MAJOR
  pdb = n;
  pdx = n;
  order = Nag_ColMajor;
#define A(I, J) a[(J-1)*pda + I-1]
#define B(I, J) b[(J-1)*pdb + I-1]
#else
  pdb = nrhs;
  pdx = nrhs;
  order = Nag_RowMajor;
#define A(I, J) a[(I-1)*pda + J-1]
#define B(I, J) b[(I-1)*pdb + J-1]
#endif

  if (!(a = NAG_ALLOC(n*n, Complex)) ||
      !(b = NAG_ALLOC(n*nrhs, Complex)) ||
      !(x = NAG_ALLOC(n*nrhs, Complex)) ||
      !(ipiv = NAG_ALLOC(n, Integer)))
    {
      printf("Allocation failure\n");
      exit_status = -1;
      goto END;
    }
  /* Read A and B from data file*/
  for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++)
      scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
  scanf("%*[^\n]");
  for (i = 1; i <= n; i++)
    for (j = 1; j <= nrhs; j++)
      scanf(" ( %lf , %lf )", &B(i, j).re, &B(i, j).im);
  scanf("%*[^\n]");

  /* Solve the equations Ax = b for x using
   * nag_zcgesv (f07aqc)
   * Mixed precision complex system solver
   */
  nag_zcgesv(order, n, nrhs, a, pda, ipiv, b, pdb, x, pdx, &iter, &fail);
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_zcgesv (f07aqc).\n%s\n", fail.message);
      exit_status = 1;
      goto END;
    }
  /* Print solution using nag_gen_complx_mat_print_comp (x04dbc). */
  fflush(stdout);
  nag_gen_complx_mat_print_comp(order, Nag_GeneralMatrix, Nag_NonUnitDiag, n,
                                nrhs, x, pdx, Nag_BracketForm, "%7.4f",
                                "Solution(s)", Nag_IntegerLabels, 0,
                                Nag_IntegerLabels, 0, 80, 0, 0, &fail);
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_gen_complx_mat_print_comp (x04dbc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }

  /* Print pivot indices*/
  printf("\n\nPivot indices\n");
  for (i = 0; i < n; i++) printf("%11ld%s", ipiv[i], (i+1)%4?" ":"\n");
  printf("\n");

 END:
  if (a) NAG_FREE(a);
  if (b) NAG_FREE(b);
  if (x) NAG_FREE(x);
  if (ipiv) NAG_FREE(ipiv);

  return exit_status;
}
#undef B
#undef A