Materials Today: Proceedings xxx (xxxx) xxx

Contents lists available at ScienceDirect

Materials Today: Proceedings

journal homepage: www.elsevier.com/locate/matpr

Gauss Jordan method for balancing chemical equation for different

materials
Bharat Udawat, Jatin Begani, Mudit Mansinghka, Nipun Bhatia, Hardik Sharma, Arti Hadap ⇑
Department of Basic Sciences and Humanities, NMIMS Deemed-to-be University, Mumbai, Maharashtra, India

a r t i c l e i n f o a b s t r a c t

Article history: The Gauss Jordan method is used in this study to equalize chemical reactions using a system of linear
Received 3 May 2021 equations. One of the most common topics in Chemistry is balancing chemical reaction equations.
Received in revised form 15 May 2021 Students typically struggle with balancing the chemical equation and find it difficult to understand;
Accepted 26 May 2021
sometimes teachers struggle as well to balance chemical equations. The results of the equation balancing
Available online xxxx
comply with the law on the conservation of matter and confirm that the existing methods for balance of
chemical equations do not contradict each other. To solve the mathematical problem, the Gauss-Jordan
Keywords:
method was used. Any chemical reaction can be handled using this method by certain reactants and
Balancing chemical equation
Chemical reaction
products. we can add several other features to the python application which can check whether the
Linear equation chemical equation is already balanced or not, we can also categorise the type of the chemical reaction.
Gauss Jordan method Ó 2021 Elsevier Ltd. All rights reserved.
Selection and peer-review under responsibility of the scientific committee of the 1st International Con-
ference on Computations in Materials and Applied Engineering – 2021.

1. Introduction is unlikely, just a insignificant aalternative occurs, where all of

A chemical equation [1] defines an expression of elements,
atoms, molecules, or ions as a symptomatic definition of a chemical
reaction. For the production of such expressions, the reactant or
product coefficients, as well as the product or molar mass, are
balanced [2]. Equilibrating the equations that describe a reacting
system’s stoichiometry is a mathematical process that can be
reduced to solving homogeneous linear systems [3]. Generalized
inverses are commonly used to balance chemical equations. Addi-
tionally, machine algebra applications can easily solve the problem
of balancing chemical equations.
For chemists, finding the smallest positive integer amount of
reactant and substance that must be equal during a chemical reac-
tion is sufficient. This thesis teaches chemistry students how to use
the Gauss-Jordan method to create a homogeneous system of lin-
ear equations whose solution provides a fitting meaning to com-
plement a chemical reaction equation. When a reaction between
chemicals is possible, it is a normal phenomenon, and the equation
that results is still consistent. As a result, we’ll need a nontrivial
solution. And, if it exists, we should be able to obtain it. This is a
true statement that does not introduce any errors. If the reaction
⇑ Corresponding author.
E-mail address: arti.hadap@nmims.edu (A. Hadap).
the coefficients are zero. There are many statistical techniques to
balance a chemical equation in mathematics and chemistry.
They’re all built on general matrix inverses and contain systematic
science features that necessitate a higher degree of mathematical
understanding to comprehend. The Gauss Jordon method is intro-
duced here, and it can be used to manage any chemical reaction in
which the product and reactants are known. This approach works
well with both basic and complicated reactions, as shown in the
solved problem in further sections. The Gauss-Jordan method is
one of several widely used techniques to analyze linear equations
mechanisms. This procedure has undergone investigation. Based
on the description and research, this paper focuses on balancing
chemical reactions using a system of linear equations with the
Gauss-Jordan exclusion to show that a system of linear equations
may be employed for determining the coefficient of each com-
pound in chemical reaction equations.
There are two parts to the Gaussian Jordon method process. The
initial part (forward elimination) reduces the formula to a echelon
or triangular form [4] or produces a degenerated equation that
does not provide a solution, which means the system is an irresol-
uble molar mass. Simple row operations are used to achieve this.
The solution to the scheme of linear equations is found in the sec-
ond phase by using back substitution. Gaussian elimination [5]
computes matrix decomposition, which is another viewpoint that

https://doi.org/10.1016/j.matpr.2021.05.576
2214-7853/Ó 2021 Elsevier Ltd. All rights reserved.
Selection and peer-review under responsibility of the scientific committee of the 1st International Conference on Computations in Materials and Applied Engineering – 2021.

Please cite this article as: B. Udawat, J. Begani, M. Mansinghka et al., Gauss Jordan method for balancing chemical equation for different materials, Materials
Today: Proceedings, https://doi.org/10.1016/j.matpr.2021.05.576
B. Udawat, J. Begani, M. Mansinghka et al.
is very useful in analysing the algorithm. The initial matrix on the
left is multiplied by an invertible matrix using Gaussian Elimina-
tion’s three simple row operations (multiply rows, swap rows,
and apply several rows to other rows). The LU decomposition [6]
is determined in the first part of the algorithm, and the initial
matrix is described in the second part as the product of an evi-
dently defined invertible matrix and a clearly defined reduced
scale matrix.
A variant of the Gaussian reduction method is the Gauss-Jordan
method. It is named after Carl Friedrich Gauss and Wilhelm Jordan
because it is a variant of the Gaussian elimination, which Jordan
described in 1887. Although Gaussian elimination adds zeros to
each pivot point in the matrices from top to bottom, the Gauss-
Jordan method takes it a step further [7]. Often, add zeros to the
top and bottom of each pivot point.
This paper is organized as follows, In Section II we have
described the Literature Survey of various similar research works
and in Section III we have explained the Methodology and com-
pared the manual solution with the automated solution, finally fol-
lowed by Conclusion in Section IV.
2. Literature review
It isn’t astonishing that the start of matrices and determinants
ought to emerge by means of the investigation of direct matrices.
Babylonians examined issues that prompted concurrent straight
conditions and a portion of these are saved in earth tablet that
endure. The Chinese, who lived between 200 and 100 BCE, were
even closer to matrices as compared to Babylonians. In fact, any
reasonable person would accept that the Han Dynasty’s material
nine sections on Mathematics Art include the previously estab-
lished example of matrix methods.
Cardan gives a law, which he calls normal de modo and is
regarded as the mother of rules, for a system of two linear equa-
tions in Art Magna (1545). To find a solution to a 2
2 problem,
this rule provides a simplified version of Crammer’s rule. Although
Seki in Japan undoubtedly published first, in Japan and Europe, the
notion of a determinant emerged almost simultaneously. Seki pub-
lished a method for solving the dissimulated problem in 1683,
which included matrix approaches written as tables, close to the
Chinese methods previously described. Despite a lack of a word
for ‘‘determinant,” Seki presented them and demonstrated how
to calculate them using general methods focused on examples.
Treatise of Algebra was written by Maclaurin in the 1730 s, two
years after his death, in 1748, it was finally published. It includes
the first determinant proving Crammer’s rule results of 3
3 and
2
2 structures, as well as a description of the working of 4
4
case. Crammer presented the basic concept for n
n systems. In
his article, Introduction to Algebraic Curve Analysis, in the year
1750 . It was influenced by the search to find the equation of a
plane curve passing through a sequence of points.
Bezout published technique for measuring determinants during
1764, and Vandermonde published them in 1771. In 1772, Laplace
stated that Crammer and Bezout’s approach was impractical, and
he explored the solution of a system of linear equations without
ever calculating it using determinants in a paper on the orbits of
the inner planets. Surprisingly, the word ‘‘resultant” was coined
by Laplace to characterise what we now refer to as the determi-
nant. Surprisingly, by using the same term as Leibniz, Laplace
seems to have had little knowledge of his work. The extension of
a determinant bearing his name is attributed to Laplace.
In the form of solving systems of ordinary differential equa-
tions, Jacques strum suggested a generalisation of the eigen value
problem. In reality, O Alembert’s work on systems of linear differ-
ential equations, that looked at how a string with mass attached at
2
Materials Today: Proceedings xxx (xxxx) xxx
different points moved, introduced the definition of an eigen value
80 years earlier.
In 1850, Sylvester used the phrase ‘‘matrix” before anyone else.
Sylvester defines a matrix as an oblong arrangement of terms that
results in separate determinants from square arrays contained
within it. Sylvester became a lawyer after residing in America
and returning to England in 1851, where he met Cayley, a young
lawyer who expressed his curiosity in mathematics. Cayley soon
recognised the significance of the matrix idea, then during 1853,
he actually written the first note describing the inverse of a matrix.
Despite claiming to be unaware of Cayley’s thesis, Frobenius
published a valuable paper on matrices, linear substitutions, and
linear forms in 1878. In his paper, Frobenius discussed form co-
efficients but did not use the term matrix. He did, however,
demonstrate useful findings on canonical matrices as members of
equivalence classes. In 1874 and 1868, he credits Kronecker and
Weierstrass with identifying special cases with his findings. Frobe-
nius established that a matrix satisfies the characteristic equation
in general. The idea of matrix rank, which he used in his disserta-
tion on canonical forms, as well as the description of canonical
forms and the definition of orthogonal matrices, were all used in
Frobenius’s 1878 paper.
The Gaussian elimination method is mentioned in the Chinese
mathematics text Jiuzhang Suanshu, chapter eight, rectangular
Array, of the nine chapters on the Mathematical Art. Its implemen-
tation is demonstrated in eighteen problems ranging from two to
five equations. The first mention of a book with this title dates from
179BC, although parts of it were written around 150BC. It was
started in the 3rd century by Liu Hui. The European approach is
based on Isaac Newton’s notes. In 1670, he said that all algebra
books he had seen omitted a lesson on solving simultaneous equa-
tions, which Newton later added.
Cambridge University published the findings as Arithmetical
University in 1707, long after Newton had left academia. The notes
were widely distributed, and by the end of the 18th century,
(known as) in algebra textbooks, Gaussian elimination had been
a basic tutorial. Carl Frederick Gauss invented a notation for sym-
metric elimination in 1810, which was adopted by professional
hand computers in the 19th century to solve normal equations of
least squares problems.
Around 1880, Gauss developed Gaussian reduction, which he
employed to solve least squares questions in celestial computa-
tions and later to measure the earth’s crust. Geodesy is a field of
applied mathematics dealing with accurately marking points on
the earth’s surface or calculating or deciding the outline of the
earth’s surface. Despite the fact that Gauss’ name is associated with
this method of separating variables from systems of linear equa-
tions in a sequential manner. For a long time, it was thought that
Gaussian elimination was the product of geodesy rather than
mathematics. The first publication of Gauss-Jordan exclusion was
in Wilhelm’s handbook Jordan’s or geodesy paper.
‘‘Although there has been some confusion as to which Jordan
should receive credit for this algorithm, it is clear that the method
was in fact introduced by a geodesist named Wilhelm Jordan
(1842–1899) and not by the more well-known mathematician
Marie Ennemond Camille Jordan (1838–1992), whose name is
sometimes mistakenly associated with this algorithm,” writes Carl
D.Meyor (2000) in his book Matrix Analysis and Linear Algebra.
‘‘The Gauss-Jordan method, so called, seems to have been defined
first by Clasen (1888) because it can be regarded as a modification
of Gaussian elimination, the name Gauss is properly applied, but
that of Jordan seems to be due to an error,” Theory of matrices in
numerical analysis write by A.S. Household (1964, P. 141). S.C.
Althoen and R. Mcluaghlin investigated these claims (1987). 94,
130–142 in American Mathematical Monthly. Household was right
about Clasen and his 1888 prose, which eventually led Althoen and
B. Udawat, J. Begani, M. Mansinghka et al.
Fig. 1. Python Implementation of Gauss Jordan algorithm.
Mcluaghin to a decision, but he was wrong about Jordan. They
went on to state that in the 1877 s edition, the ‘‘germ of the theory”
was already there (This entry was contributed by John Aldrich).
Two sections divided for the Gaussian elimination method. The
first factor (forward elimination) reduces a given structure to trian-
gular or echelon form, or produces a degenerated equation with no
solution, meaning that it is unsolvable. The use of simple row oper-
ations is used to do this. Back substitution is used in the second
step to find the solution to a series of linear equations.
The first part uses elementary row operations to reduce a
matrix to row echelon form, and the second part uses reduced
row operations to reduce it to reduced row echelon form. Gaussian
elimination computes matrix decomposition, which is another
viewpoint that is very useful in analysing the algorithm. The three
basic row operations of Gaussian elimination (multiplying rows,
switching rows, and applying multiples of rows to other rows)
are equivalent to multiplying a matrix with an invertible matrix
[8–10] from the left.
3. Methodology and results
Now by explaining the method we are going to take an example
in which we need to balance the following chemical reaction:
P4 O10 + H2 O ! H3 PO4 (Not Balanced)
The equation for balancing has been found. Three elements
make up this chemical reaction: Phosphorus(P); Hydrogen (H);
Oxygen (O). The equation that we need to balance is identified.
We assign the unknowns coefficients (a, b, c) to each chemical spe-
cies. A balance equation can be written as follows:
a P4 O10 + b H2 O ! c H3 PO4
Phosphorus(P): 4a = c ! 4a —c = 0
Oxygen(O): 10a + b = 4c ! 10a + b —4c = 0
Hydrogen(H): 2b = 3c ! 2b —3c = 0
The system is solved by Gauss Jordan method as follows:
2 3
4 0 1 0
6 7
4 10 1 4 0 5
0 2 3 0
R1 ! R1/4
2 3
1 0 0:25 0
6 7
4 10 1 4 05
0 2 3 0
R2 ! R2  10R1
3
Materials Today: Proceedings xxx (xxxx) xxx
2 3
1 0 0:25 0
6 7
4 0 1 1:5 0 5
0 2 3 0
R3 ! R3  2R2
1 0 0:25 0
0 1 1:5 0
0 0 0 0
i.e., a  0.25c = 0, b  1.5c = 0
i.e., a = 0.25c, b = 1.5c
Solution by Gauss Jordan method:
a = 0.25c, b = 1.5c and c = c
c is a free variable here. Solution is obtained by assigning some
value to c.
For instance, we take value of c to be 4.
Then, a = 1, b = 6, c = 4
Thus, the balanced chemical reaction equation is:
P4 O10 + 6 H2 O ! 4 H3 PO4
We have also applied Gauss Jordan algorithm using Python Lan-
guage and have received the same output, which is shown below in
the Fig. 1. The input to the application is the unbalanced chemical
equation and we get the output as the balanced chemical equation.
The same reaction which we have solved using the gauss Jordan
method is being solved using our python application.
Hence, we can say that by solving it manually or by the help of
our Python application, we have obtained the same results which
proves the credibility of the application.
4. Conclusion
The paper explains how Gauss Jordan approach to answer the
mathematical problem was used in balancing chemical equations
without any contradictions. On examination of various research
papers, and instances where formal and systematic methods for
balancing chemical reaction equations were used, it was found that
all kinds of chemical reactions could be balanced by using gauss
elimination. But, Gauss Jordan method is preferred more than
Gaussian elimination since in case of Gauss Jordan, there is no need
for back substitution. These methods were found to be successful
at even balancing relatively difficult chemical equations with ease.
Moreover, Only these statistical techniques were found to be cap-
able of balancing chemical reactions containing atoms with frac-
tional oxidation numbers. In future, we can add several other
features to the python application which can check whether the
chemical equation is already balanced or not, we can also cate-
gorise the type of the chemical reaction. Along with that by lever-
aging the image processing technology we can have the input of
the application as an image.
B. Udawat, J. Begani, M. Mansinghka et al.
CRediT authorship contribution statement
Bharat Udawat: Conceptualization, Supervision, Writing -
review & editing. Jatin Begani: Writing - original draft. Mudit
Mansinghka: Writing - review & editing. Nipun Bhatia: Supervi-
sion. Hardik Sharma: Writing - original draft. Arti Hadap: Investi-
gation, Writing - original draft.
Declaration of Competing Interest
The authors declare that they have no known competing finan-
cial interests or personal relationships that could have appeared
to influence the work reported in this paper.
References
[1] F. Soleimani, P.S. Stanimirovi, F. Soleymani, Some Matrix Iterations for
Computing Generalized Inverses and Balancing Chemical Equations,
Algorithms 8 (2015) 982–998, https://doi.org/10.3390/a8040982.
[2] I. Hamid, Balancing Chemical Equations by Systems of Linear Equations,
Applied Mathematics 10 (07) (2019) 521–526.
Materials Today: Proceedings xxx (xxxx) xxx
[3] Y. Hari Krishna, N. Vijaya, P. Bindu. Balancing chemical equations using Gauss-
Jordan Elimination aided by MATLAB. Journal of Xi’an University of
Architecture & Technology, 2020, Volume XII, Issue VII.
[4] D.A. Johar, Application of the Concept of Linear Equation Systems in Balancing
Chemical Reaction Equations, International Journal of Global Operations
Research 1 (4) (2020) 130–135.
[5] Y. Hari Krishna, P. Bindu, V. Yaragani, N. Vijaya, O.D. Makinde, Application of
Gauss-Jordan elimination method in balancing typical chemical equations,
International Journal of Scientific and Technology Research 9 (1) (2020) 465–
468.
[6] Adenegan, Kehinde Emmanuel and Aluko, Tope Moses. Gauss and gauss-jordan
elimination methods for solving system of linear equations: comparisons and
applications. Journal of Science and Science Education, 19th November 2012,
Ondo Vol. 3(1), pp. 97 – 105.
[7] M.K. Weldesemaet, The Importance of Gauss-Jordan Elimination Methods for
Balancing Chemical Reaction Equation, International Journal of Engineering
Development and Research 6 (2018) 685–691.
[8] X. Sheng, Computation of weighted Moore-Penrose inverse through Gauss-
Jordan elimination on bordered matrices, Appl. Math. Comput. 323 (2018) 64–
74.
[9] I.B. Risteski, New very hard problems of balancing chemical reactions,
Chemistry 21 (4) (2012) 574–580.
[10] U.B. Trivedi, S.K. Sharma, M.V.K. Singh, Gauss Elimination, Gauss-Jordan
Elimination and Gauss Seidel Iteration Method: Performance Comparison
using MAT LAB, International Journal of Engineering Technology Science and
Research 4 (10) (2017) 753–763.