test_gauss_elimination.c

/* ************************************************* *
 * Author        : Jean Michel Sellier               *
 * Created       : 08 Feb 2022, Montreal, QC, Canada *
 * Last modified : 31 May 2022, Montreal, QC, Canada *
 * ************************************************* */

#include "../src/1chipml.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>

int main(void) {
  /* Variables and pointers declarations */
  int i;
  int N;
  gauss_real** A;  //[2][2];
  gauss_real* B;   //[2];
  gauss_real* sol; /* pointer towards the solution */

  /* dynamical memory allocation */
  A = (gauss_real**)malloc(4 * sizeof(gauss_real*));
  for (i = 0; i < 2; i++) {
    A[i] = (gauss_real*)malloc(2 * sizeof(gauss_real));
  }
  B = (gauss_real*)malloc(2 * sizeof(gauss_real));

  /* The following parameters define a system of 2 linear equations A*X=B */
  N = 2;
  A[0][0] = +1.;
  A[0][1] = +1.;
  A[1][0] = +1.;
  A[1][1] = -1.;
  B[0] = 0.;
  B[1] = 1.;

  /* Apply gauss elimination method to solve the system */
  sol = gauss_elimination(N, A, B);

  /* free memory */
  for (i = 0; i < 2; i++)
    free(A[i]);
  free(A);
  free(B);

  const gauss_real expectedResults[] = {0.5, -0.5};

  /* Print solution on screen */
  for (i = 0; i < N; i++) {

    if (sol[i] != expectedResults[i]) {
      printf("Error! , %0.3f expected to be equal to %0.3f \n", sol[i],
             expectedResults[i]);
      return 1;
    }
  }
  printf("Success : gauss elimination test \n");
  return 0;
}

/* -- End of file -- */