NAG Library Manual, Mark 29.3
```/* nag_lapacklin_zpptrs (f07gsc) Example Program.
*
* Copyright 2023 Numerical Algorithms Group.
*
* Mark 29.3, 2023.
*/

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

int main(void) {
/* Scalars */
Integer ap_len, i, j, n, nrhs, pdb;
Integer exit_status = 0;
NagError fail;
Nag_UploType uplo;
Nag_OrderType order;
/* Arrays */
char nag_enum_arg[40];
Complex *ap = 0, *b = 0;

#ifdef NAG_COLUMN_MAJOR
#define A_UPPER(I, J) ap[J * (J - 1) / 2 + I - 1]
#define A_LOWER(I, J) ap[(2 * n - J) * (J - 1) / 2 + I - 1]
#define B(I, J) b[(J - 1) * pdb + I - 1]
order = Nag_ColMajor;
#else
#define A_LOWER(I, J) ap[I * (I - 1) / 2 + J - 1]
#define A_UPPER(I, J) ap[(2 * n - I) * (I - 1) / 2 + J - 1]
#define B(I, J) b[(I - 1) * pdb + J - 1]
order = Nag_RowMajor;
#endif

INIT_FAIL(fail);

printf("nag_lapacklin_zpptrs (f07gsc) Example Program Results\n\n");

/* Skip heading in data file */
scanf("%*[^\n] ");
scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &n, &nrhs);
ap_len = n * (n + 1) / 2;
#ifdef NAG_COLUMN_MAJOR
pdb = n;
#else
pdb = nrhs;
#endif

/* Allocate memory */
if (!(ap = NAG_ALLOC(ap_len, Complex)) ||
!(b = NAG_ALLOC(n * nrhs, Complex))) {
printf("Allocation failure\n");
exit_status = -1;
goto END;
}

/* Read A and B 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) {
for (i = 1; i <= n; ++i) {
for (j = i; j <= n; ++j)
scanf(" ( %lf , %lf )", &A_UPPER(i, j).re, &A_UPPER(i, j).im);
}
scanf("%*[^\n] ");
} else {
for (i = 1; i <= n; ++i) {
for (j = 1; j <= i; ++j)
scanf(" ( %lf , %lf )", &A_LOWER(i, j).re, &A_LOWER(i, j).im);
}
scanf("%*[^\n] ");
}
for (i = 1; i <= n; ++i) {
for (j = 1; j <= nrhs; ++j)
scanf(" ( %lf , %lf )", &B(i, j).re, &B(i, j).im);
}
scanf("%*[^\n] ");

/* Factorize A */
/* nag_lapacklin_zpptrf (f07grc).
* Cholesky factorization of complex Hermitian
* positive-definite matrix, packed storage
*/
nag_lapacklin_zpptrf(order, uplo, n, ap, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_lapacklin_zpptrf (f07grc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}
/* Compute solution */
/* nag_lapacklin_zpptrs (f07gsc).
* Solution of complex Hermitian positive-definite system of
* linear equations, multiple right-hand sides, matrix
* already factorized by nag_lapacklin_zpptrf (f07grc), packed storage
*/
nag_lapacklin_zpptrs(order, uplo, n, nrhs, ap, b, pdb, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_lapacklin_zpptrs (f07gsc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}
/* Print solution */
/* 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", "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(ap);
NAG_FREE(b);
return exit_status;
}
```