/* nag_herm_packed_lin_solve (f04cjc) Example Program.
 *
 * Copyright 2004 Numerical Algorithms Group.
 *
 * Mark 8, 2004.
 */

#include <stdio.h>
#include <nag.h>
#include <nag_stdlib.h>
#include <nagf04.h>
#include <nagx04.h>

int main(void)
{

  /* Scalars */
  double errbnd, rcond;
  Integer exit_status, i,  j, n, nrhs, pdb;

  /* Arrays */
  char    uplo[2];
  char *clabs=0, *rlabs=0;
  Complex *ap=0, *b=0;
  Integer *ipiv=0;

  /* Nag types */
  NagError fail;
  Nag_OrderType order;
  Nag_UploType uplo_enum;

#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]
#define B(I,J) b[(J-1)*pdb + 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]
#define B(I,J) b[(I-1)*pdb + J - 1]
  order = Nag_RowMajor;
#endif

  exit_status = 0;
  INIT_FAIL(fail);

  Vprintf("nag_herm_packed_lin_solve (f04cjc) Example Program Results\n\n");

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

  Vscanf("%ld%ld%*[^\n] ",   &n,  &nrhs);
  if (n>0 && nrhs>0)
    {
      /* Allocate memory */
      if ( !(clabs = NAG_ALLOC(2, char)) ||
           !(rlabs = NAG_ALLOC(2, char)) ||
           !(ap = NAG_ALLOC(n*(n+1)/2, Complex)) ||
           !(b = NAG_ALLOC(n*nrhs, Complex)) ||
           !(ipiv = NAG_ALLOC(n, Integer)) )
        {
          Vprintf("Allocation failure\n");
          exit_status = -1;
          goto END;
        }
#ifdef NAG_COLUMN_MAJOR
      pdb = n;
#else
      pdb = nrhs;
#endif
      /* Read A and B from data file */
    }
  else
    {
      Vprintf("%s\n",   "n and/or nrhs too small");
      exit_status = 1;
      return exit_status;
    }

  Vscanf(" ' %1s '%*[^\n] ", uplo);
  if (*(unsigned char *)uplo == 'L')
    uplo_enum = Nag_Lower;
  else if (*(unsigned char *)uplo == 'U')
    uplo_enum = Nag_Upper;
  else
    {
      Vprintf("Unrecognised character for Nag_UploType type\n");
      exit_status = -1;
      goto END;
    }

  /* Read the upper or lower triangular part of the matrix A from */
  /* data file */

  if (uplo_enum == 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] ");
    }

  /* Read B from data file */
  for (i = 1; i <= n; ++i)
    {
      for (j = 1; j <= nrhs; ++j)
        {
          Vscanf(" ( %lf , %lf )", &B(i,j).re, &B(i,j).im);
        }
    }
  Vscanf("%*[^\n] ");

  /* Solve the equations AX = B for X */
  /* nag_herm_packed_lin_solve (f04cjc).
   * Computes the solution and error-bound to a complex
   * Hermitian system of linear equations, packed storage
   */
  nag_herm_packed_lin_solve(order, uplo_enum, n, nrhs, ap, ipiv, b, pdb, &rcond,
                            &errbnd, &fail);
  if (fail.code == NE_NOERROR)
    {
      /* Print solution, estimate of condition number and approximate */
      /* error bound */
      /* nag_gen_complx_mat_print_comp (x04dbc).
       * Print complex general matrix (comprehensive)
       */
      nag_gen_complx_mat_print_comp(order, Nag_GeneralMatrix, Nag_NonUnitDiag,
                                    n, nrhs, b, pdb, Nag_BracketForm, 0,
                                    "Solution", Nag_IntegerLabels, 0,
                                    Nag_IntegerLabels, 0, 80, 0, 0, &fail);
      if (fail.code != NE_NOERROR)
        {
          Vprintf("Error from nag_gen_complx_mat_print_comp (x04dbc).\n%s\n",
                  fail.message);
          exit_status = 1;
          goto END;
        }
      Vprintf("\n");
      Vprintf("%s\n%8s%9.1e\n", "Estimate of condition number", "", 1.0/rcond);
      Vprintf("\n\n");
      Vprintf("%s\n%8s%9.1e\n\n",
              "Estimate of error bound for computed solutions", "", errbnd);
    }
  if (fail.code == NE_RCOND)
    {
      /* Matrix A is numerically singular.  Print estimate of */
      /* reciprocal of condition number and solution */
      Vprintf("\n");
      Vprintf("%s\n%8s%9.1e\n\n\n",
              "Estimate of reciprocal of condition number", "", rcond);
      /* nag_gen_complx_mat_print_comp (x04dbc), see above. */
      nag_gen_complx_mat_print_comp(order, Nag_GeneralMatrix, Nag_NonUnitDiag,
                                    n, nrhs, b, pdb, Nag_BracketForm, 0,
                                    "Solution", Nag_IntegerLabels, 0,
                                    Nag_IntegerLabels, 0, 80, 0, 0, &fail);
      if (fail.code != NE_NOERROR)
        {
          Vprintf("Error from nag_gen_complx_mat_print_comp (x04dbc).\n%s\n",
                  fail.message);
          exit_status = 1;
          goto END;
        }
    }
  if (fail.code == NE_SINGULAR)
    {
      /* The upper triangular matrix U is exactly singular.  Print */
      /* details of factorization */
      Vprintf("\n");
      /* nag_pack_complx_mat_print_comp (x04ddc).
       * Print complex packed triangular matrix (comprehensive)
       */
      nag_pack_complx_mat_print_comp(order, Nag_Upper, Nag_NonUnitDiag, n, ap,
                                     Nag_BracketForm, 0,
                                     "Details of factorization",
                                     Nag_IntegerLabels, 0, Nag_IntegerLabels, 0,
                                     80, 0, 0, &fail);
      if (fail.code != NE_NOERROR)
        {
          Vprintf("Error from nag_pack_complx_mat_print_comp (x04ddc).\n%s\n",
                  fail.message);
          exit_status = 1;
          goto END;
        }

      /* Print pivot indices */
      Vprintf("\n");
      Vprintf("%s\n",   "Pivot indices");
      for (i = 1; i <= n; ++i)
        {
          Vprintf("%11ld%s", ipiv[i - 1], i%7 == 0 || i == n ?"\n":" ");
        }
      Vprintf("\n");
    }
 END:
  if (clabs) NAG_FREE(clabs);
  if (rlabs) NAG_FREE(rlabs);
  if (ap) NAG_FREE(ap);
  if (b) NAG_FREE(b);
  if (ipiv) NAG_FREE(ipiv);

  return exit_status;
}

#undef B