/* nag_lapacklin_zpttrf (f07jrc) Example Program.
 *
 * Copyright 2023 Numerical Algorithms Group.
 *
 * Mark 29.3, 2023.
 */

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

int main(void) {

  /* Scalars */
  Integer exit_status = 0, i, n;

  /* Arrays */
  Complex *e = 0;
  double *d = 0;

  /* Nag Types */
  NagError fail;

  INIT_FAIL(fail);

  printf("nag_lapacklin_zpttrf (f07jrc) Example Program Results\n\n");
  /* Skip heading in data file */
  scanf("%*[^\n]");
  scanf("%" NAG_IFMT "%*[^\n]", &n);
  if (n < 0) {
    printf("Invalid n\n");
    exit_status = 1;
    goto END;
  }
  /* Allocate memory */
  if (!(e = NAG_ALLOC(n - 1, Complex)) || !(d = NAG_ALLOC(n, double))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }

  /* Read the lower bidiagonal part of the tridiagonal matrix A from */
  /* data file */
  for (i = 0; i < n; ++i)
    scanf("%lf", &d[i]);
  scanf("%*[^\n]");
  for (i = 0; i < n - 1; ++i)
    scanf(" ( %lf , %lf )", &e[i].re, &e[i].im);
  scanf("%*[^\n]");

  /* Factorize the tridiagonal matrix A using nag_lapacklin_zpttrf (f07jrc). */
  nag_lapacklin_zpttrf(n, d, e, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapacklin_zpttrf (f07jrc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Print details of the factorization */
  printf("Details of factorization\n\n");
  printf(" The diagonal elements of D\n");
  for (i = 0; i < n; ++i)
    printf("%9.4f%s", d[i], i % 8 == 7 ? "\n" : " ");

  printf("\n\n Subdiagonal elements of the Cholesky factor L\n");
  for (i = 0; i < n - 1; ++i)
    printf("(%8.4f, %8.4f)%s", e[i].re, e[i].im, i % 8 == 7 ? "\n" : " ");
  printf("\n");

END:
  NAG_FREE(e);
  NAG_FREE(d);

  return exit_status;
}