NAG Library Manual, Mark 28.6
```/* nag_matop_complex_gen_matrix_cond_sqrt (f01kdc) Example Program.
*
* Copyright 2022 Numerical Algorithms Group.
*
* Mark 28.6, 2022.
*/
#include <nag.h>

#define A(I, J) a[J * pda + I]

int main(void) {

/* Scalars */
Integer exit_status = 0;
Integer i, j, n, pda;
double alpha, condsa;
/* Arrays */
Complex *a = 0;
/* Nag Types */
Nag_OrderType order = Nag_ColMajor;
NagError fail;

INIT_FAIL(fail);

/* Output preamble */
printf("nag_matop_complex_gen_matrix_cond_sqrt (f01kdc) ");
printf("Example Program Results\n\n");
fflush(stdout);

/* Skip heading in data file */
scanf("%*[^\n] ");

/* Read in the problem size */
scanf("%" NAG_IFMT "%*[^\n]", &n);

pda = n;
if (!(a = NAG_ALLOC(pda * n, Complex))) {
printf("Allocation failure\n");
exit_status = -1;
goto END;
}

/* Read in the matrix A from data file */
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
scanf(" ( %lf , %lf ) ", &A(i, j).re, &A(i, j).im);
scanf("%*[^\n] ");

/* Find matrix square root, condition number and residual bound using
* nag_matop_complex_gen_matrix_cond_sqrt (f01kdc)
* Condition number for the square root of a complex matrix
*/
nag_matop_complex_gen_matrix_cond_sqrt(n, a, pda, &alpha, &condsa, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_matop_complex_gen_matrix_cond_sqrt (f01kdc)\n%s\n",
fail.message);
exit_status = 1;
goto END;
}

/* Print matrix sqrt(A) using nag_file_print_matrix_complex_gen (x04dac)
* Print complex general matrix (easy-to-use)
*/
nag_file_print_matrix_complex_gen(order, Nag_GeneralMatrix, Nag_NonUnitDiag,
n, n, a, pda, "sqrt(A)", NULL, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_file_print_matrix_complex_gen (x04dac)\n%s\n",
fail.message);
exit_status = 2;
goto END;
}

/* Print condition number estimates */
printf("Estimated relative condition number is: %7.2f\n", condsa);
printf("Condition number for the relative residual is: %7.2f\n", alpha);

END:
NAG_FREE(a);
return exit_status;
}
```