Gauss-Jordan Elimination

Gauss-Jordan Elimination


Gauss-Jordan Elimination is an extension of the method of Gaussian Elimination. At the stage when the i-th row has been divided by a suitable value to obtain a 1, suitable mulitples of this row are subtracted not only from subsequent rows but also from preceding rows to produce zeros both below and above the 1. The result of this systematic method is that the augmented matrix is transformed into reduced echelon form. As a method for solving simultaneous linear equations. Gauss-Jordan Elimination in fact requires more work than Gaussian eliminations followed by back substitution and so is not generally recommended.


HEY!

Need to do the Gauss-Jordan Elimination? Try this version. REQUIRES JAVASCRIPT.

Back Substitution


Suppose that a set of linear equations is in echelon form. Then the last equation can be solved for the first unknowns equal to paramenters taking arbitrary values. This can be substituted into the previous equation, which can then likewise be solved for the 1st unknown appearing in it. The process that continues in this way is back substitution.

Back to Formulae 1

Hosted by www.Geocities.ws