/* nag_complex_qr(f01rcc) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 1, 1990.
 */

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

#define MMAX 20
#define NMAX 10
#define TDA NMAX
#define COMPLEX(A) A.re, A.im

int main(void)
{
  Integer i, j, m, n;
  static NagError fail;
  Complex a[MMAX][TDA], theta[NMAX];

  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vprintf("f01rcc Example Program Results\n");
  Vscanf("%ld%ld", &m, &n);
  Vprintf("\n");
  if (m>MMAX || n>NMAX)
    {
      Vfprintf(stderr, "\n m or n is out of range.\n");
      Vfprintf(stderr, "m = %ld    n = %ld\n", m, n);
      return EXIT_FAILURE;
    }
  for (i=0; i<m; ++i)
    for (j=0; j<n; ++j)
      Vscanf(" ( %lf , %lf ) ", COMPLEX(&a[i][j]));
  /* Find the QR factorization of A. */
  fail.print = TRUE;
  f01rcc(m, n, &a[0][0], (Integer)TDA, theta, &fail);
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  Vprintf("QR factorization of A\n");
  Vprintf("Vector THETA\n");
  for (i=0; i<n; ++i)
    Vprintf(" (%7.4f,%8.4f)%s", COMPLEX(theta[i]),
            (i%3==2 || i==n-1) ? "\n" : " ");
  Vprintf("\nMatrix A after factorization (upper triangular part is R)\n");
  for (i=0; i<m; ++i)
    {
      for (j=0; j<n; ++j)
        Vprintf(" (%7.4f,%8.4f)%s", COMPLEX(a[i][j]),
                (j%3==2 || j==n-1) ? "\n" : " ");
    }
  return EXIT_SUCCESS;
}