/* nag_complex_form_q(f01rec) 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 TDQ MMAX
#define COMPLEX(A) A.re, A.im

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

  Vprintf("f01rec Example Program Results\n");
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vscanf("%ld%ld", &m, &n);
  if (m>MMAX || n>NMAX)
    {
      Vfprintf(stderr,"\nm or n is out of range.\nm = %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]));
  fail.print = TRUE;
  /* Find the QR factorization of A. */
  f01rcc(m, n, &a[0][0], (Integer)TDA, theta, &fail);
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  /* Copy the array A into Q and form the m by m matrix Q. */
  for (j=0; j<n; ++j)
    for (i=0; i<m; ++i)
      q[i][j].re = a[i][j].re, q[i][j].im = a[i][j].im;
  ncolq = m;
  f01rec(Nag_ElementsSeparate, m, n, ncolq, &q[0][0], (Integer)TDQ,
         theta, &fail);
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  Vprintf("\nMatrix  Q\n");
  for (i=0; i<m; ++i)
    {
      for (j=0; j<ncolq; ++j)
        Vprintf(" (%5.2f,%5.2f)%s", COMPLEX(q[i][j]),
                (j%5==4 || j==ncolq-1) ? "\n" : " ");
    }
  return EXIT_SUCCESS;
}