/* nag_lapackeig_zgeqrf (f08asc) Example Program.
 *
 * Copyright 2023 Numerical Algorithms Group.
 *
 * Mark 29.2, 2023.
 */

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

int main(void) {
  /* Scalars */
  Integer i, j, m, n, nrhs, pda, pdb, tau_len;
  Integer exit_status = 0;
  NagError fail;
  Nag_OrderType order;
  /* Arrays */
  Complex *a = 0, *b = 0, *tau = 0;

#ifdef NAG_COLUMN_MAJOR
#define A(I, J) a[(J - 1) * pda + I - 1]
#define B(I, J) b[(J - 1) * pdb + I - 1]
  order = Nag_ColMajor;
#else
#define A(I, J) a[(I - 1) * pda + J - 1]
#define B(I, J) b[(I - 1) * pdb + J - 1]
  order = Nag_RowMajor;
#endif

  INIT_FAIL(fail);

  printf("nag_lapackeig_zgeqrf (f08asc) Example Program Results\n");
  /* Skip heading in data file */
  scanf("%*[^\n] ");
  scanf("%" NAG_IFMT "%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &m, &n, &nrhs);
#ifdef NAG_COLUMN_MAJOR
  pda = m;
  pdb = m;
#else
  pda = n;
  pdb = nrhs;
#endif
  tau_len = MIN(m, n);

  /* Allocate memory */
  if (!(a = NAG_ALLOC(m * n, Complex)) || !(b = NAG_ALLOC(m * nrhs, Complex)) ||
      !(tau = NAG_ALLOC(tau_len, Complex))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }
  /* Read A and B from data file */
  for (i = 1; i <= m; ++i) {
    for (j = 1; j <= n; ++j)
      scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
  }
  scanf("%*[^\n] ");
  for (i = 1; i <= m; ++i) {
    for (j = 1; j <= nrhs; ++j)
      scanf(" ( %lf , %lf )", &B(i, j).re, &B(i, j).im);
  }
  scanf("%*[^\n] ");

  /* Compute the QR factorization of A */
  /* nag_lapackeig_zgeqrf (f08asc).
   * QR factorization of complex general rectangular matrix
   */
  nag_lapackeig_zgeqrf(order, m, n, a, pda, tau, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapackeig_zgeqrf (f08asc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Compute C = (Q^H)*B, storing the result in B */
  /* nag_lapackeig_zunmqr (f08auc).
   * Apply unitary transformation determined by nag_lapackeig_zgeqrf (f08asc)
   * or nag_lapackeig_zgeqpf (f08bsc)
   */
  nag_lapackeig_zunmqr(order, Nag_LeftSide, Nag_ConjTrans, m, nrhs, n, a, pda,
                       tau, b, pdb, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapackeig_zunmqr (f08auc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Compute least squares solution by back-substitution in R*X = C */
  /* nag_lapacklin_ztrtrs (f07tsc).
   * Solution of complex triangular system of linear
   * equations, multiple right-hand sides
   */
  nag_lapacklin_ztrtrs(order, Nag_Upper, Nag_NoTrans, Nag_NonUnitDiag, n, nrhs,
                       a, pda, b, pdb, &fail);

  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapacklin_ztrtrs (f07tsc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }
  /* Print least squares solution(s) */
  printf("\n");
  /* nag_file_print_matrix_complex_gen_comp (x04dbc).
   * Print complex general matrix (comprehensive)
   */
  fflush(stdout);
  nag_file_print_matrix_complex_gen_comp(
      order, Nag_GeneralMatrix, Nag_NonUnitDiag, n, nrhs, b, pdb,
      Nag_BracketForm, "%7.4f", "Least squares solution(s)", Nag_IntegerLabels,
      0, Nag_IntegerLabels, 0, 80, 0, 0, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_file_print_matrix_complex_gen_comp (x04dbc).\n%s\n",
           fail.message);
    exit_status = 1;
    goto END;
  }
END:
  NAG_FREE(a);
  NAG_FREE(b);
  NAG_FREE(tau);
  return exit_status;
}