/* nag_real_cholesky_solve_mult_rhs(f04agc) Example Program
 *
 * Copyright 1996 Numerical Algorithms Group.
 *
 * Mark 4, 1996.
 */

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

#define NMAX 8
#define NRHS 1
#define TDA NMAX
#define TDB NRHS
#define TDX NRHS

int main(void)
{
  double d1;
  Integer i, id, j, n;
  double a[NMAX][TDA], b[NMAX][TDB], p[NMAX], x[NMAX][TDX];
  static NagError fail;

  Vprintf("f04agc Example Program Results\n");
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vscanf("%ld", &n);
  if (n<1 || n>NMAX)
    {
      Vfprintf(stderr,"\nn is out of range: n = %ld\n", n);
      return EXIT_FAILURE;
    }
  for (i=0; i<n; ++i)
    for (j=0; j<n; ++j)
      Vscanf("%lf", &a[i][j]);
  for (i=0; i<n; ++i)
    for (j=0; j<NRHS; ++j)
      Vscanf("%lf", &b[i][j]);
  fail.print = TRUE;

  /* Cholesky decomposition */
  f03aec(n, &a[0][0], (Integer)TDA, p, &d1, &id, &fail);
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;

  /* Approximate solution of linear equations */
  f04agc(n, (Integer)NRHS, &a[0][0], (Integer)TDA, p, &b[0][0],
         (Integer)TDB, &x[0][0], (Integer)TDX, &fail);
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  Vprintf("\n Solution\n");
  for (i=0; i<n; ++i)
    {
      for (j=0; j<NRHS; ++j)
        Vprintf("%9.4f", x[i][j]);
      Vprintf("\n");
    }
  return EXIT_SUCCESS;
}