/* nag_complex_cholesky(f01bnc) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 1, 1990.
 */

#include <nag.h>
#include <math.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nagf01.h>

#define NMAX 8
#define TDA NMAX
#define COMPLEX(A) A.re, A.im

int main(void)
{

  Integer i, j, n;
  Complex a[NMAX][TDA];
  double p[NMAX];
  static NagError fail;

  Vprintf("f01bnc Example Program Results\n");
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vscanf("%ld", &n);
  if (n<1 || n>NMAX)
    {
      Vprintf("\n n is out of range: n = %ld", n);
      return EXIT_FAILURE;
    }
  for (i=0; i<n; ++i)
    for (j=0; j<=i; ++j)
      Vscanf(" ( %lf , %lf ) ", COMPLEX(&a[i][j]));
  fail.print = TRUE;
  f01bnc(n, &a[0][0], (Integer)TDA, p, &fail);
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  Vprintf("\n Upper triangle of Complex matrix U by rows\n");
  for (i=0; i<n; ++i)
    {
      Vprintf("\n");
      Vprintf("   (%7.4f,%9.4f)\n", 1.0/p[i], 0.0);
      for (j=i+1; j<n; ++j)
        Vprintf("   (%7.4f,%9.4f)\n", COMPLEX(a[i][j]));
    }
  return EXIT_SUCCESS;
}