/* nag_zeros_complex_poly (c02afc) Example Program.
 *
 * Copyright 1991 Numerical Algorithms Group.
 *
 * Mark 2, 1991.
 *
 * Mark 8 revised, 2004.
 */

#include <nag.h>
#include <nagx04.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nagc02.h>

int main(int argc, char *argv[])
{
  FILE        *fpin, *fpout;

  Nag_Boolean scale;
  Complex     *a = 0, *z = 0;
  Integer     exit_status = 0, i, n;
  NagError    fail;

  INIT_FAIL(fail);

  /* Check for command-line IO options */
  fpin = nag_example_file_io(argc, argv, "-data", NULL);
  fpout = nag_example_file_io(argc, argv, "-results", NULL);
  fprintf(fpout, "nag_zeros_complex_poly (c02afc) Example Program Results\n");
  /* Skip heading in data file */
  fscanf(fpin, "%*[^\n]");
  fscanf(fpin, "%ld", &n);
  if (n > 0)
    {
      if (!(a = NAG_ALLOC(n+1, Complex)) ||
          !(z = NAG_ALLOC(n, Complex)))
        {
          fprintf(fpout, "Allocation failure\n");
          exit_status = -1;
          goto END;
        }
    }
  else
    {
      fprintf(fpout, "Invalid n.\n");
      exit_status = 1;
      return exit_status;
    }
  scale = Nag_TRUE;
  for (i = 0; i <= n; i++)
    fscanf(fpin, "%lf%lf", &a[i].re, &a[i].im);

  /* nag_zeros_complex_poly (c02afc).
   * Zeros of a polynomial with complex coefficients
   */
  nag_zeros_complex_poly(n, a, scale, z, &fail);
  if (fail.code != NE_NOERROR)
    {
      fprintf(fpout, "Error from nag_zeros_complex_poly (c02afc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }
  fprintf(fpout, "\nDegree of polynomial = %4ld\n\n", n);
  fprintf(fpout, "Roots of polynomial\n\n");
  for (i = 0; i < n; ++i)
    fprintf(fpout, "z = %13.4e   %+14.4e\n", z[i].re, z[i].im);
 END:
  if (fpin != stdin) fclose(fpin);
  if (fpout != stdout) fclose(fpout);
  if (a) NAG_FREE(a);
  if (z) NAG_FREE(z);
  return exit_status;
}