/* nag_complex_apply_q(f01rdc) 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 NCBMAX 5
#define TDA NMAX
#define TDB NCBMAX
#define COMPLEX(A) A.re, A.im

int main(void)
{

  Integer i, j, m, n, ncolb;
  Complex a[MMAX][TDA], b[MMAX][TDB], theta[NMAX];
  static NagError fail;

  Vprintf("f01rdc Example Program Results\n");
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vscanf("%ld%ld", &m, &n);
  if (m>MMAX || n>NMAX)
    {
      Vfprintf(stderr,"\n m or n is out of range.\n");
      Vfprintf(stderr,"m = %ld    n = %ld", m, n);
      return EXIT_FAILURE;
    }
  for (i=0; i<m; ++i)
    for (j=0; j<n; ++j)
      Vscanf(" ( %lf , %lf ) ", COMPLEX(&a[i][j]));
  Vscanf("%ld", &ncolb);
  if (ncolb>NCBMAX)
    {
      Vprintf("\n ncolb is out of range.\n ncolb = %ld\n", ncolb);
      return EXIT_FAILURE;
    }
  for (i=0; i<m; ++i)
    for (j=0; j<ncolb; ++j)
      Vscanf(" ( %lf , %lf ) ", COMPLEX(&b[i][j]));
  /* Find the QR factorization of A. */
  fail.print = TRUE;
  f01rcc(m, n, &a[0][0], (Integer)TDA, theta, &fail);

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

  f01rdc(ConjugateTranspose, Nag_ElementsSeparate, m, n,
         &a[0][0], (Integer)TDA, theta, ncolb, &b[0][0],
         (Integer)TDB, &fail);

  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  Vprintf("\nMatrix  conjg( Q' )*B\n");
  for (i=0; i<m; ++i)
    {
      for (j=0; j<ncolb; ++j)
        Vprintf("  (%7.4f, %8.4f)%s", COMPLEX(b[i][j]),
                (j%2==1 || j==n-1) ? "\n" : " ");
    }
  return EXIT_SUCCESS;
}