Linear Algebra and the C Language/a01l

The pivot chosen in this algorithm is the largest absolute value found in matrix A. We swap rows and columns to achieve this.

The GJ_TP_mR(Ab); function was introduced to handle the two types of systems that the gj_TP_mR(Ab); function is not capable of solving.

The algorithm consists of checking whether the matrix A is not singular. If it is not singular, we call the function gj_TP_mR(Ab); If the 'matrix is ​​not square, we take a submatrix of A which has r rows and r columns where r is the number of rows of A to calculate the determinant. (see the function c_Ab_subArxr_mR(Ab,A);

Copy the library to your working directory:

• v_g.h ........................... Gauss Jordan (UpDate)
  • vgj1tp.h .................. Gauss Jordan 1
  • vgc_free.h .............. Free variables
  • vgp_free.h .............. Print free variables

C example to test the library:

• test.c