#include <stdlib.h>
#include "xmalloc.h"
+#include "gaussjordan.h"
+
#define SMALL 0.00001
int firm_gaussjordansolve(double *A, double *vec, int nsize)
x[i] = i;
/* triangularize A */
- /* ie A has zeros below it's diagonal */
+ /* ie A has zeros below its diagonal */
for (col = 0; col < nsize - 1; ++col) {
big = 0;
/* find the largest left in LRH box */