Professional Documents
Culture Documents
Gauss Jordan Method Algorithm and Flowchart - Code With C PDF
Gauss Jordan Method Algorithm and Flowchart - Code With C PDF
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?
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.