/* nag_complex_apply_q (f01rdc) Example Program.
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 1, 1990.
 * Mark 8 revised, 2004.
 */

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

#define COMPLEX(A) A.re, A.im
#define A(I, J)    a[(I) *tda + J]
#define B(I, J)    b[(I) *tdb + J]

int main(int argc, char *argv[])
{
  FILE     *fpin, *fpout;

  Complex  *a = 0, *b = 0, *theta = 0;
  Integer  exit_status = 0, i, j, m, n, ncolb, tda, tdb;
  NagError fail;

  INIT_FAIL(fail);

  /* Check for command-line IO options */
  fpin = nag_example_file_io(argc, argv, "-data", NULL);
  fpout = nag_example_file_io(argc, argv, "-results", NULL);


  fprintf(fpout, "nag_complex_apply_q (f01rdc) Example Program Results\n");
  /* Skip heading in data file */
  fscanf(fpin, "%*[^\n]");
  fscanf(fpin, "%ld%ld", &m, &n);
  if (n >= 0 && m >= n)
    {
      if (!(a = NAG_ALLOC(m*n, Complex)))
        {
          fprintf(fpout, "Allocation failure\n");
          exit_status = -1;
          goto END;
        }
      tda = n;
    }
  else
    {
      fprintf(fpout, "Invalid n or m.\n");
      exit_status = 1;
      return exit_status;
    }
  for (i = 0; i < m; ++i)
    for (j = 0; j < n; ++j)
      fscanf(fpin, " ( %lf,  %lf ) ", COMPLEX(&A(i, j)));
  fscanf(fpin, "%ld", &ncolb);
  if (ncolb >= 0)
    {
      if (!(b = NAG_ALLOC(m*ncolb, Complex)) ||
          !(theta = NAG_ALLOC(n, Complex)))
        {
          fprintf(fpout, "Allocation failure\n");
          exit_status = -1;
          goto END;
        }
      tdb = ncolb;
    }
  else
    {
      fprintf(fpout, "Invalid ncolb.\n");
      exit_status = 1;
      return exit_status;
    }
  for (i = 0; i < m; ++i)
    for (j = 0; j < ncolb; ++j)
      fscanf(fpin, " ( %lf,  %lf ) ", COMPLEX(&B(i, j)));
  /* Find the QR factorization of A. */
  /* nag_complex_qr (f01rcc).
   * QR factorization of complex m by n matrix (m~>=~n)
   */
  nag_complex_qr(m, n, a, tda, theta, &fail);
  if (fail.code != NE_NOERROR)
    {
      fprintf(fpout, "Error from nag_complex_qr (f01rcc).\n%s\n", fail.message);
      exit_status = 1;
      goto END;
    }

  /* Form  conjg( Q' )*B. */

  /* nag_complex_apply_q (f01rdc).
   * Compute QB or Q^HB after factorization by nag_complex_qr
   * (f01rcc)
   */
  nag_complex_apply_q(ConjugateTranspose, Nag_ElementsSeparate, m, n,
                      a, tda, theta, ncolb, b,
                      tdb, &fail);

  if (fail.code != NE_NOERROR)
    {
      fprintf(fpout, "Error from nag_complex_apply_q (f01rdc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }
  fprintf(fpout, "\nMatrix  conjg( Q' )*B\n");
  for (i = 0; i < m; ++i)
    {
      for (j = 0; j < ncolb; ++j)
        fprintf(fpout, "  (%7.4f, %8.4f)%s", COMPLEX(B(i, j)),
                (j%2 == 1 || j == n-1)?"\n":" ");
    }
 END:
  if (fpin != stdin) fclose(fpin);
  if (fpout != stdout) fclose(fpout);
  if (a) NAG_FREE(a);
  if (b) NAG_FREE(b);
  if (theta) NAG_FREE(theta);
  return exit_status;
}