Gauss-Jordan Partial Pivoting

Gaussian elimination, is an algorithm for solving systems of linear equations... Wikipedia: Gaussian elimination

In this algorithm, Gauss-Jordan Partial Pivoting, the pivot chosen is the largest absolute value found in a column. For this we perform column exchanges.

This system works with partial pivoting and total pivoting:

• Choose your values

This system does not works with total pivoting: (Second pivot shifted to the right)

• Choose your values

The function: gj_PP_mR(double **Ab, above);

• c00a.c

The function: gj3_T_mR(double **Ab, above);

• c00b.c
• The function selects the best pivot and puts zero under the pivot.
• c0c.c
• The function puts zero above the pivot.
• c00d.c

Singular matrix, but compatible system:

• Two equal rows with the same values ​​of b.
• Random values
• Choose your values

Singular matrix, but incompatible system:

• Two equal rows with different values ​​of b.
• Random values
• Choose your values