/* nag_lapacklin_zpptrf (f07grc) Example Program.
 *
 * Copyright 2019 Numerical Algorithms Group.
 *
 * Mark 27.0, 2019.
 */

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

int main(void)
{
  /* Scalars */
  Integer ap_len, i, j, n;
  Integer exit_status = 0;
  NagError fail;
  Nag_UploType uplo;
  Nag_OrderType order;
  /* Arrays */
  char nag_enum_arg[40];
  Complex *ap = 0;

#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

  INIT_FAIL(fail);

  printf("nag_lapacklin_zpptrf (f07grc) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");
  scanf("%" NAG_IFMT "%*[^\n] ", &n);
  ap_len = n * (n + 1) / 2;

  /* Allocate memory */
  if (!(ap = NAG_ALLOC(ap_len, Complex)))
  {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }

  /* Read A from data file */
  scanf(" %39s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value (x04nac).
   * Converts NAG enum member name to value
   */
  uplo = (Nag_UploType) nag_enum_name_to_value(nag_enum_arg);

  if (uplo == Nag_Upper) {
    for (i = 1; i <= n; ++i) {
      for (j = i; j <= n; ++j)
        scanf(" ( %lf , %lf )", &A_UPPER(i, j).re, &A_UPPER(i, j).im);
    }
    scanf("%*[^\n] ");
  }
  else {
    for (i = 1; i <= n; ++i) {
      for (j = 1; j <= i; ++j)
        scanf(" ( %lf , %lf )", &A_LOWER(i, j).re, &A_LOWER(i, j).im);
    }
    scanf("%*[^\n] ");
  }
  /* Factorize A */
  /* nag_lapacklin_zpptrf (f07grc).
   * Cholesky factorization of complex Hermitian
   * positive-definite matrix, packed storage
   */
  nag_lapacklin_zpptrf(order, uplo, n, ap, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapacklin_zpptrf (f07grc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }
  /* Print details of factorization */
  /* nag_file_print_matrix_complex_packed_comp (x04ddc).
   * Print complex packed triangular matrix (comprehensive)
   */
  fflush(stdout);
  nag_file_print_matrix_complex_packed_comp(order, uplo, Nag_NonUnitDiag, n, ap,
                                 Nag_BracketForm, "%7.4f", "Factor",
                                 Nag_IntegerLabels, 0, Nag_IntegerLabels, 0,
                                 80, 0, 0, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_file_print_matrix_complex_packed_comp (x04ddc).\n%s\n",
           fail.message);
    exit_status = 1;
    goto END;
  }

END:
  NAG_FREE(ap);
  return exit_status;
}