/* nag_lapackeig_zgehrd (f08nsc) Example Program.
*
* Copyright 2023 Numerical Algorithms Group.
*
* Mark 29.3, 2023.
*/
#include <nag.h>
#include <stdio.h>
int main(void) {
/* Scalars */
Integer i, j, n, pda, tau_len;
Integer exit_status = 0;
NagError fail;
Nag_OrderType order;
/* Arrays */
Complex *a = 0, *tau = 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_lapackeig_zgehrd (f08nsc) 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
tau_len = n - 1;
/* Allocate memory */
if (!(a = NAG_ALLOC(n * n, Complex)) ||
!(tau = NAG_ALLOC(tau_len, Complex))) {
printf("Allocation failure\n");
exit_status = -1;
goto END;
}
/* Read A from data file */
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j)
scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
}
scanf("%*[^\n] ");
/* Reduce A to upper Hessenberg form */
/* nag_lapackeig_zgehrd (f08nsc).
* Unitary reduction of complex general matrix to upper
* Hessenberg form
*/
nag_lapackeig_zgehrd(order, n, 1, n, a, pda, tau, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_lapackeig_zgehrd (f08nsc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}
/* Set the elements below the first subdiagonal to zero */
for (i = 1; i <= n - 2; ++i) {
for (j = i + 2; j <= n; ++j)
A(j, i).re = 0.0, A(j, i).im = 0.0;
}
/* Print upper Hessenberg form */
/* 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, n, a, pda, Nag_BracketForm,
"%7.4f", "Upper Hessenberg form", 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(tau);
return exit_status;
}