/* nag_superlu_diagnostic_lu (f11mmc) Example Program.
 *
 * Copyright 2014 Numerical Algorithms Group.
 *
 * Mark 8, 2005.
 */

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

int main(void)
{
  double                    flop, rpg, thresh;
  Integer                   exit_status = 0, i, n, nnz, nnzl, nnzu, nzlmx,
                            nzlumx, nzumx;
  double                    *a = 0, *lval = 0, *uval = 0;
  Integer                   *icolzp = 0, *il = 0, *iprm = 0, *irowix = 0;
  Integer                   *iu = 0;
  /* Nag types */
  Nag_ColumnPermutationType ispec;
  NagError                  fail;

  INIT_FAIL(fail);

  printf(
          "nag_superlu_diagnostic_lu (f11mmc) Example Program Results\n\n");
  /* Skip heading in data file */
  scanf("%*[^\n] ");
  /* Read order of matrix */
  scanf("%ld%*[^\n] ", &n);
  /* Read the matrix A */
  if (!(icolzp = NAG_ALLOC(n+1, Integer)))
    {
      printf("Allocation failure\n");
      exit_status = -1;
      goto END;
    }
  for (i = 1; i <= n + 1; ++i)
    scanf("%ld%*[^\n] ", &icolzp[i - 1]);
  nnz = icolzp[n] - 1;
  /* Allocate memory */
  if (!(irowix = NAG_ALLOC(nnz, Integer)) ||
      !(a = NAG_ALLOC(nnz, double)) ||
      !(il = NAG_ALLOC(7*n+8*nnz+4, Integer)) ||
      !(iu = NAG_ALLOC(2*n+8*nnz+1, Integer)) ||
      !(uval = NAG_ALLOC(8*nnz, double)) ||
      !(lval = NAG_ALLOC(8*nnz, double)) ||
      !(iprm = NAG_ALLOC(7*n, Integer)))
    {
      printf("Allocation failure\n");
      exit_status = -1;
      goto END;
    }
  for (i = 1; i <= nnz; ++i)
    scanf("%lf%ld%*[^\n] ", &a[i - 1], &irowix[i - 1]);
  /* Calculate COLAMD permutation */
  ispec = Nag_Sparse_Colamd;
  /* nag_superlu_column_permutation (f11mdc).
   * Real sparse nonsymmetric linear systems, setup for
   * nag_superlu_lu_factorize (f11mec)
   */
  nag_superlu_column_permutation(ispec, n, icolzp, irowix, iprm, &fail);
  if (fail.code != NE_NOERROR)
    {
      printf(
              "Error from nag_superlu_column_permutation (f11mdc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }

  /* Factorise */
  thresh = 1.;
  nzlmx = 8*nnz;
  nzlumx = 8*nnz;
  nzumx = 8*nnz;
  /* nag_superlu_lu_factorize (f11mec).
   * LU factorization of real sparse matrix
   */
  nag_superlu_lu_factorize(n, irowix, a, iprm, thresh, nzlmx, &nzlumx, nzumx,
                           il, lval, iu, uval, &nnzl, &nnzu, &flop, &fail);
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_superlu_lu_factorize (f11mec).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }

  /* Calculate reciprocal pivot growth */
  /* nag_superlu_diagnostic_lu (f11mmc).
   * Real sparse nonsymmetric linear systems, diagnostic for
   * nag_superlu_lu_factorize (f11mec)
   */
  nag_superlu_diagnostic_lu(n, icolzp, a, iprm, il, lval, iu, uval, &rpg,
                            &fail);
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_superlu_diagnostic_lu (f11mmc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }

  /* Output result */
  printf("\n");
  printf("%s\n%7.3f\n", "Reciprocal pivot growth", rpg);

 END:
  NAG_FREE(a);
  NAG_FREE(lval);
  NAG_FREE(uval);
  NAG_FREE(icolzp);
  NAG_FREE(il);
  NAG_FREE(iprm);
  NAG_FREE(irowix);
  NAG_FREE(iu);

  return exit_status;
}