we can see that using Gauss-Seidel iterative methods need only 13 timed to make
But using Jacobi method after 25 times the is bigger than that using Gauss-Seidel iterative methods
Using Gaussian elimination to solve linear equations.
// In this version, we allow matrix of any size. This is done by treating
// the name of a 2-dimensional array as pointer to the beginning of the
// array. This makes use of the fact that arrays in C are stored in
// row-major order.
we shall examine nonparametric procedures that can be used with arbitrary distributions and without the assumption that the forms of theunderlying densities are known.
