NAG Library Manual, Mark 30.1
Interfaces:  FL   CL   CPP   AD 

NAG CL Interface Introduction
Example description
/* nag_lapacklin_zhetri (f07mwc) Example Program.
 *
 * Copyright 2024 Numerical Algorithms Group.
 *
 * Mark 30.1, 2024.
 */

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

int main(void) {
  /* Scalars */
  Integer i, j, n, pda;
  Integer exit_status = 0;
  NagError fail;
  Nag_UploType uplo;
  Nag_MatrixType matrix;
  Nag_OrderType order;
  /* Arrays */
  Integer *ipiv = 0;
  char nag_enum_arg[40];
  Complex *a = 0;

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

  INIT_FAIL(fail);

  printf("nag_lapacklin_zhetri (f07mwc) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");
  scanf("%" NAG_IFMT "%*[^\n] ", &n);
#ifdef NAG_COLUMN_MAJOR
  pda = n;
#else
  pda = n;
#endif

  /* Allocate memory */
  if (!(ipiv = NAG_ALLOC(n, Integer)) || !(a = NAG_ALLOC(n * n, Complex))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }

  /* Read A from data file */
  scanf(" %39s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value (x04nac).
   * Converts NAG enum member name to value
   */
  uplo = (Nag_UploType)nag_enum_name_to_value(nag_enum_arg);

  if (uplo == Nag_Upper) {
    matrix = Nag_UpperMatrix;
    for (i = 1; i <= n; ++i) {
      for (j = i; j <= n; ++j)
        scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
    }
    scanf("%*[^\n] ");
  } else {
    matrix = Nag_LowerMatrix;
    for (i = 1; i <= n; ++i) {
      for (j = 1; j <= i; ++j)
        scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
    }
    scanf("%*[^\n] ");
  }

  /* Factorize A */
  /* nag_lapacklin_zhetrf (f07mrc).
   * Bunch-Kaufman factorization of complex Hermitian
   * indefinite matrix
   */
  nag_lapacklin_zhetrf(order, uplo, n, a, pda, ipiv, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapacklin_zhetrf (f07mrc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }
  /* Compute inverse of A */
  /* nag_lapacklin_zhetri (f07mwc).
   * Inverse of complex Hermitian indefinite matrix, matrix
   * already factorized by nag_lapacklin_zhetrf (f07mrc)
   */
  nag_lapacklin_zhetri(order, uplo, n, a, pda, ipiv, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapacklin_zhetri (f07mwc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }
  /* Print inverse */
  /* nag_file_print_matrix_complex_gen_comp (x04dbc).
   * Print complex general matrix (comprehensive)
   */
  fflush(stdout);
  nag_file_print_matrix_complex_gen_comp(
      order, matrix, Nag_NonUnitDiag, n, n, a, pda, Nag_BracketForm, "%7.4f",
      "Inverse", 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(ipiv);
  NAG_FREE(a);
  return exit_status;
}