/* nag_real_lu_solve_mult_rhs(f04ajc) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 1, 1990.
 */

#include <nag.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nagf03.h>
#include <nagf04.h>


#define TDB 3
#define NMAX 8
#define TDA NMAX

int main(void)
{
  double detf;
  Integer i, dete, j, n, nrhs = 1;
  double a[NMAX][TDA], b[NMAX][TDB];
  Integer pivot[NMAX];
  static NagError fail;

  Vprintf("f04ajc Example Program Results\n");
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vscanf("%ld",&n);
  if (n>0 && n<=NMAX)
    {
      for (i=0; i<n; i++)
        for (j=0; j<n; j++)
          Vscanf("%lf",&a[i][j]);
      /* Crout decomposition  */
      fail.print = TRUE;
      f03afc(n,&a[0][0],(Integer)TDA,pivot,&detf,&dete,&fail);
      if (fail.code!=NE_NOERROR)
        return EXIT_FAILURE;
      else
        {
          for (i=0; i<n; i++)
            for (j=0; j<nrhs; j++)
              Vscanf("%lf",&b[i][j]);
          /*
           * Approximate solution of linear equations
           */
          f04ajc(n,nrhs,&a[0][0],(Integer)TDA,pivot,&b[0][0],
                 (Integer)TDB,&fail);
          if (fail.code!=NE_NOERROR)
            return EXIT_FAILURE;
          Vprintf("Solution\n");
          for (i=0; i<n; i++)
            for (j=0; j<nrhs; j++)
              Vprintf("%9.4f\n",b[i][j]);
        }
    }
  else
    {
      Vfprintf(stderr, "N is out of range: N = %5ld\n", n);
      return EXIT_FAILURE;
    }
  return EXIT_SUCCESS;
}