/* nag_fft_hermitian(c06ebc) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 1, 1990.
 */

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

#define NMAX 20

int main(void)
{
  Integer j, n, n2, nj;
  double u[NMAX], v[NMAX], x[NMAX], xx[NMAX];

  Vprintf("c06ebc Example Program Results\n");
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  while (scanf("%ld", &n)!=EOF)
    if (n>1 && n<=NMAX)
      {
        for (j = 0; j<n; j++)
          {
            Vscanf("%lf", &x[j]);
            xx[j] = x[j];
          }
        /* Calculate full complex form of Hermitian sequence */
        u[0] = x[0];
        v[0] = 0.0;
        n2 = (n-1)/2;
        for (j = 1; j<=n2; j++)
          {
            nj = n - j;
            u[j] = x[j];
            u[nj] = x[j];
            v[j] = x[nj];
            v[nj] = -x[nj];
          }
        if (n % 2==0)
          {
            u[n2+1] = x[n2+1];
            v[n2+1] = 0.0;
          }
        Vprintf("\nOriginal and corresponding complex sequence\n");
        Vprintf("\n         Data       Real       Imag \n\n");
        for (j = 0; j<n; j++)
          Vprintf("%3ld %10.5f %10.5f %10.5f\n", j, x[j], u[j], v[j]);
        /* Calculate transform */
        c06ebc(n, x, NAGERR_DEFAULT);
        Vprintf("\nComponents of discrete Fourier transform\n\n");
        for (j = 0; j<n; j++)
          Vprintf("%3ld %10.5f\n", j, x[j]);
        /* Calculate inverse transform */
        c06eac(n, x, NAGERR_DEFAULT);
        c06gbc(n, x, NAGERR_DEFAULT);
        Vprintf("\nOriginal sequence as restored by inverse transform\n");
        Vprintf("\n       Original   Restored\n\n");
        for (j = 0; j<n; j++)
          Vprintf("%3ld %10.5f %10.5f\n", j, xx[j], x[j]);
      }
    else
      {
        Vfprintf(stderr,"Invalid value of n\n");
        return EXIT_FAILURE;
      }
  return EXIT_SUCCESS;
}