Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

Gauss Jordan Method Algorithm and Flowchart

May 17, 2014

GaussJordanmethodiscommonlyusedtofindthesolutionoflinearsimultaneousequations.
Inscienceandengineering,itisusedtofindtheoutputofachemicalplant,examineanetwork
undersinusoidalsteadyrate,etc.

Heres a simple algorithm for Gauss Jordan Method along with flowchart, which show how a
system of linear equations is reduced to diagonal matrix form by elementary row operations.
The solution is directly and conveniently obtained by this method but requires a little more
calculation.

Gauss Jordan method is a modified version of the Gauss elimination method. The Gauss
Jordanalgorithmandflowchartisalsosimilarinmanyaspectstotheeliminationmethod.
Compared to the elimination method, this method reduces effort and time taken to perform
backsubstitutionsforfindingtheunknowns.

InGaussElimination,theunknownvariablesareeliminatedfromthepivotalequationonly,but
inGaussJordanmethod,theyareeliminatedfromalltheequations.Beforegoingthroughthe
algorithmandflowchart,learnhowmatrixisdiagonalizedinGaussJordanmethod?

Gauss Jordan Method Algorithm:


1.Start
2.Readtheorderofthematrixnandreadthecoefficientsofthelinearequations.
3.Dofork=1ton
Doforl=k+1ton+1
a[k][l]=a[k][l]/a[k][k]
Endforl
Seta[k][k]=1
Dofori=1ton
if(inotequaltok)then,
Doforj=k+1ton+1
a[i][j]=a[i][j](a[k][j]*a[i][k])
Endforj
Endfori
Endfork
4.Doform=1ton
x[m]=a[m][n+1]
Displayx[m]
Endform
5.Stop

Gauss Jordan Method Flowchart:


TheflowchartiscontinuedafterENDfork.

HereisanotherflowchartforGaussJordanmethod.
Alsosee,
GaussJordanCProgram
GaussJordanMatlabProgram

The aforementioned algorithm and flowchart seem simple, but Gauss Jordan method is
generally considered to be a bit tedious in terms of additional calculation. Additionally, this
methodprovestobeaeffectiveoneforasmallersystemoflinearsimultaneousequations.

Ifyouconsiderasystemof10or20suchequations,500multiplicationswouldberequiredto
solvethesystemusingGaussJordanmethod.But,ifyouadoptGaussEliminationmethod the
number of multiplications required is only 333. So, Gauss Jordan is the simpler method, but
requires50%morecalculationcomparedtotheeliminationmethod.

You might also like