Journal for Research in Applied Sciences ISSN: 2583-4053

and Biotechnology Volume-2 Issue-3 || June 2023 || PP. 114-117

www.jrasb.com https://doi.org/10.55544/jrasb.2.3.15

Methods Used for Solving Linear Equation Systems

Ghulam Omer ABDULLAH
Assistant Professor, Department of Mathematics, Kabul University, AFGHANISTAN.

Correspondence Author: Ghulam Omer ABDULLAH

www.jrasb.com || Vol. 2 No. 3 (2023): June Issue

Received: 23-05-2023 Revised: 03-06-2023 Accepted: 10-06-2023

ABSTRACT

The two variable equations of 𝒂𝟏 𝒙 + 𝒂𝟐 𝒚 = 𝒃 whose degree of variables is 𝑛 = 1 are called linear equations. If the
number of variables exceeds two (𝑛), such a linear equation is called a 𝒏𝒕𝒉 variable linear equation. If the number of equations
reaches more than one (𝑚), then existed a system of 𝒎𝒕𝒉 equations, which is called a system of linear equations (𝒎 × 𝒏) and
shows the number of system equations and the number of variables in the system.
The system of linear equations forms the basis of linear algebra, which helps in solving and analyzing important issues
in the natural sciences, especially mathematics. It is also used in solving mathematical problems with the help of computer
mathematical programs. For example, it is used in the study and analysis of linear transformation as well as in solving
optimization problems.

Keywords- Linear Equations, Gauss Elimination, Gauss Jordan, Cramer’s Roll and LU decomposition or factorization
methods.

I. INTRODUCTION of equations and 𝑥𝑖 represents unknown numbers in the

system. If 𝑏𝑖 = 0 in (1) system, such a system is called a
The concept of a system of linear equations was homogeneous system. And we can show the linear
introduced first in Europe in 1637 by the famous French system as matrixes.
mathematician René Descartes, in the words of
Descartes. Descartes 'appropriation was later
II. METHODOLOGY
incorporated into mathematics as Descartes' geometry.
Since the collection of materials and
Today, with the help of this system, the routes of air
transit lines at airports are determined and shown, and information in this article is in the form of a library;
their intersections are calculated by solving a system of therefore, the study has used a qualitative method. The
linear equations. researcher has compared four different methods of
Suppose we have 𝑚 equations and 𝑛 unknowns then solving linear equation system and decided to choose the
they form a system of the following: suitable method among them.
𝑎11 𝑥1 + 𝑎12 𝑥2 +, … … … , +𝑎1𝑛 𝑥𝑛 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 +, … … … , +𝑎2𝑛 𝑥𝑛 = 𝑏2 𝑎11 𝑎12 ⋯ 𝑎1𝑛 𝑏1 𝑥1
( … … … (1) 𝑎21 𝑎22 𝑥2
⋮ ⋮ ⋮ ⋮ ⋯ 𝑎2𝑛 𝑏2
[ ] , 𝐵 = [ ] , 𝑥 = [ ⋮ ] or
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 +, … … … , +𝑎𝑚𝑛 𝑥𝑛 = 𝑏𝑚 ⋮ ⋱ ⋮ ⋮
𝑎𝑚1 𝑎𝑚2 ⋯ 𝑎𝑚𝑛 𝑏𝑚 𝑥𝑚𝑛
Explanation: In the above system 𝑎𝑖𝑗 (𝑖 = 𝑎11 𝑎12 ⋯ 𝑎1𝑛 : 𝑏1
1,2,3, … … … , 𝑚 , 𝑗 = 1,2,3, … … … 𝑛) are the 𝑎21 𝑎22 ⋯ 𝑎2𝑛 : 𝑏2
[ ]
coefficients of the equation which are 𝑖 equation number ⋮ ⋱ ⋮
and 𝑗 unknown number 𝑏𝑖 represents constant numbers 𝑎𝑚1 𝑎𝑚2 ⋯ 𝑎𝑚𝑛 : 𝑏𝑛
114 This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Journal for Research in Applied Sciences ISSN: 2583-4053
and Biotechnology Volume-2 Issue-3 || June 2023 || PP. 114-117
www.jrasb.com https://doi.org/10.55544/jrasb.2.3.15

III. THE DIFFERENT SOLVING 3.2 Gauss Jordan Method

METHODS OF LINEAR SYSTEMS To perform this method, the linear system
should be arranged to (𝐴, 𝐵) matrix and then we perform
An important issue to consider in the solving of on this matrix Row Reduction operation to take the in
linear systems is the consistent and inconsistent situation the (𝐼𝑛 𝑥) form.
of linear systems. It means if a system has a solution, it For example:
𝑥1 + 3𝑥2 + 𝑥3 = 10
is called a consistent system, and if it has no solution, it
is called an inconsistent system. Of course, generally in { 𝑥1 − 2𝑥2 − 𝑥3 = −6
the beginning it cannot be said that the system is 2𝑥1 + 𝑥2 + 2𝑥3 = 10
consistent or inconsistent. But in the particular case, we 𝑥1
can define the consistent and inconsistent case of 1 3 1 10
𝐴 = [1−2−1] , 𝑥 = [𝑥2 ] , 𝐵 = [−6]
Homogeneous system through the matrix rank by
2 1 2 𝑥3 10
The Rouché –Capelli theorem.
The following four methods are used for the
−𝑅1 + 𝑅2 → 𝑅2 𝑎𝑛𝑑 − 2𝑅1 + 𝑅3 → 𝑅3
solution of linear systems:
1. Gauss Elimination method
1 3 1 10
2. Gauss Jordan Method 𝐴 = [0−5−2] , 𝐵 = [−16]
3. Cramer’s Roll
0 5 0 −10
4. LU Decomposition.
Before describing these methods, it is necessary to 1 3 1 10
consider the following primary changes in the systems: 𝑖𝑓: 𝑅2 ↔ 𝑅3 ⇒ 𝐴 = [0−5 0 ] , 𝐵 = [−10]
- Changing the location of two equations in a 0 5 −2 −16
system
- Multiply the nonzero real number on both sides 1 3 1 10
of an equation −𝑅2 + 𝑅3 → 𝑅3 ⇒ 𝐴 = [0−5 0 ] , 𝐵 = [ 10 ]
- Adding one equation to another equation 0 0 −2 −6
And remove the equations from the system that take the
form of compatibility. 1 3 1 10
𝑅2 𝑅3
3.1 Gauss Elimination method 𝑖𝑓: 𝑎𝑛𝑑 ⇒ 𝐴 = [0 1 0] , 𝐵 = [ 2 ]
−5 −2
Suppose the following a linear system is given; 0 0 1 3
𝑎11 𝑥1 + 𝑎12 𝑥2 +, … … … , +𝑎1𝑛 𝑥𝑛 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 +, … … … , +𝑎2𝑛 𝑥𝑛 = 𝑏2 1 0 1 4
( … … … (2) 𝑖𝑓: −3𝑅2 + 𝑅1 → 𝑅1 ⇒ 𝐴 = [0 1 0] , 𝐵 = [2]
⋮ ⋮ ⋮ ⋮
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 +, … … … , +𝑎𝑚𝑛 𝑥𝑛 = 𝑏𝑚 0 0 1 3

1 0 0 1
𝑖𝑓: −1𝑅3 + 𝑅1 → 𝑅1 ⇒ 𝐴 = [0 1 0] , 𝐵 = [2] ⇒
It should be tried to find the coefficient 0 0 1 3
(𝑎11 ≠ 0) of 𝑥1 . If the coefficient is equal to zero, then 𝑥1 = 1, 𝑥2 = 2, 𝑥3 = 3
use other coefficients and remove 𝑥1 from the system.
𝑎
To do this, it should be multiplied by 21 the both 3.3 Cramer’s Roll
𝑎11 ≠0
sides of first equation and it is abstracted from the Using the Cramer’s method to solve a 𝑛
second equation. unknowns and 𝑚 equations linear system. The condition
Then the both sides of first equation are for solving a linear system with this method is that; the
𝑎
multiplied by 31 and subtracted from the third determinant of the coefficients of linear system shouldn’t
𝑎11 ≠0 be zero or (its matrix must be nonsingular).
equation, continuing this operation until 𝑥1 becomes This method is used for the solving of those
zero throughout the system. linear systems where the number of unknowns equal
We study the above method in the following 𝑚 with the number of equations of the system or 𝑚 = 𝑛 and
equations and 𝑛 unknown system, which in the det 𝐴 ≠ 0.
following system all of 𝑥1 are zero. Suppose the following linear system is given:
𝑎11 𝑥1 + 𝑎12 𝑥2 +, … … … , 𝑎1𝑛 𝑥𝑛 = 𝑏1
+𝑎22 𝑥2 +, … … … 𝑎12𝑛 𝑥𝑛 = 𝑏2
{ … … … (2)  a11 a12  a1n   x1   b1 
⋮ ⋮ ⋮ a a    b 
+𝑎𝑚2 𝑥2 +, … … … , 𝑎𝑚𝑛 𝑥𝑛 = 𝑏𝑚  a2n  x2 
A =  21 22 , X=  , B =  2
Note: Follow the same procedure for all other unknown.      
     
a n1 a n 2  a nn   xn  bn 

115 This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Journal for Research in Applied Sciences ISSN: 2583-4053
and Biotechnology Volume-2 Issue-3 || June 2023 || PP. 114-117
www.jrasb.com https://doi.org/10.55544/jrasb.2.3.15

Assuming that the matrix 𝐴 is the matrix of the 𝐿 and 𝑈 are called the decomposition of 𝐴 matrix, If we
coefficient unknowns and the matrix 𝐵 is the matrix of consider the above situation in terms of linear system,
the constants numbers so: then we can write:
If det 𝐴 ≠ 0 and the matrix 𝐴 is reversible
which its revers matrix is called (𝐴)−1 ,then this 𝑎11 𝑥1 + 𝑎12 𝑥2 +, … , 𝑎1𝑛 𝑥𝑛 = 𝑏1
(𝐴)−1 matrix multiplied on the both sides of the equation
𝑎21 𝑥1 + 𝑎22 𝑥2 +, … , 𝑎2𝑛 𝑥𝑛 = 𝑏2
𝐴𝑋 = 𝐵, so it can be written as: { … (1)
⋮ ⋮ ⋮
𝑋 = 𝐴−1 𝐵
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥1 +, … , 𝑎𝑚𝑛 𝑥1 = 𝑏𝑚
Now with the using of adjoin matrix we can find the
value of 𝐴−1 as:
𝑎11 𝑎12 ⋯ 𝑎1𝑛 𝑏1 𝑥1
𝑎11 𝑎12 𝑎13 𝑎21 𝑎22 ⋯ 𝑎2𝑛 𝑏 𝑥2
𝐴=[ ],𝐵 = [ 2],𝑥 = [ ⋮ ]
𝐴 = [𝑎21 𝑎22 𝑎23 ] , 𝐶 = ⋮ ⋱ ⋮ ⋮
𝑎31 𝑎32 𝑎33 𝑎𝑚1 𝑎𝑚2 ⋯ 𝑎𝑚𝑛 𝑏𝑚 𝑥𝑚𝑛
𝑎22 𝑎23 𝑎21 𝑎23 𝑎21 𝑎22
+ [𝑎 𝑎 ] − [𝑎 𝑎 ] + [𝑎 𝑎 ]
32 33 31 33 31 32 𝐴𝑋 = 𝐵 … (2)
𝑎12 𝑎13 𝑎11 𝑎13 𝑎11 𝑎12
+ [𝑎 𝑎 ] − [𝑎 𝑎 ] + [𝑎 𝑎 ] = 𝐿𝑈𝑋 = 𝐵 … (3)
32 33 31 33 31 32
𝑎12 𝑎13 𝑎11 𝑎13 𝑎11 𝑎12
[+ [𝑎22 𝑎23 ] − [𝑎21 𝑎23 ] + [𝑎21 𝑎22 ]] 𝑖𝑓: 𝑈𝑋 = 𝑌 ⇒ 𝐿𝑌 = 𝐵 … (4)
𝑐11 𝑐12 𝑐13 𝑐11 𝑐21 𝑐31
Computation
[𝑐21 𝑐22 𝑐23 ] 𝑖𝑓𝐶 𝑇 ⇒ 𝑎𝑑𝑗𝐴 = [𝑐12 𝑐22 𝑐32 ]
𝑐31 𝑐32 𝑐33 𝑐13 𝑐23 𝑐33 Therefor to solve a system by the using
decomposition method, we need to take the following
Therefore, the results of the multiplication of 𝐴 and 𝐶 steps for 𝐿 and 𝑈 matrixes:
matrixes show that they 𝑥1 , 𝑥2 , … , 𝑥𝑛 are as follows: - Finding the first line of the 𝑈 matrix (𝑢11 𝑢12 𝑢13 ).
1 - Finding the first column of the 𝐿 matrix (𝑙21 , 𝑙31 ).
𝑥1 = [𝑏 𝑐 + 𝑏2 𝑐21 + ⋯ + 𝑏𝑛 𝑐𝑛1 ] - Creating the second line of the
det 𝐴 1 11
matrix( 𝑢22 𝑢23 ).
1 - Finding the second column of matrix (𝑙32 ).
𝑥2 = [𝑏 𝑐 + 𝑏2 𝑐22 + ⋯ + 𝑏𝑛 𝑐𝑛2 ]
det 𝐴 1 12 - Find the third line of the matrix (𝑢33 ).
For example, if we consider the following linear system,
1
𝑥𝑛 = [𝑏 𝑐 + 𝑏2 𝑐2𝑛 + ⋯ + 𝑏𝑛 𝑐𝑛𝑛 ] write:
det 𝐴 1 1𝑛 𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 = 𝑏1
{𝑎21 𝑥1 + 𝑎22 𝑥2 + 𝑎23 𝑥3 = 𝑏2
The last formulas are called Cramer’s formulas, for
𝑎31 𝑥1 + 𝑎32 𝑥2 + 𝑎33 𝑥3 = 𝑏3
example we have for (3 × 3) square linear system:

𝑏1 𝑎12 𝑎13 𝑎11 𝑏1 𝑎13 a11 x1 + a12 x 2 + ... + a1n x n = b1

| 𝑏2 𝑎22 𝑎23 | | 𝑎21 𝑏2 𝑎23 |
a x + a x + ... + a x = b
𝑥1 =
𝑏3 𝑎32 𝑎33
, 𝑥2 =
𝑎31 𝑏3 𝑎33
, 𝑥3  21 1 22 2 2n n 2
∆ ∆ 
𝑎11 𝑎12 𝑏1
| 𝑎21 𝑎22 𝑏2 |
    
𝑎31 𝑎32 𝑏3 
a n1 x1 + a n 2 x 2 +  + a nn x n = bn
=
∆
𝐴𝑋 = 𝐵
Comment
- If ∆ = 0 and ∆1 = ∆2 = ∆3 … ∆𝑛 = 0, then the linear
system has just one solution and that solution isn’t
unique but its infinite.
- If ∆ = 0 and at least one of ∆1 , ∆2 , … , ∆3 … ∆𝑛 = 0
 x1   c11 c 21  a n1   b1 
x    c n 2  b2 
is nonzero then the system has no solution. 1 c12 c 22
- If ∆ ≠ 0 and the system was homogeneous i.e. X =  2 =
(𝑏𝑖 = 0) then the system has only zero solution, i.e.
   det A        
    
3.4 LU decomposition or factorization method  xn  c1n c2n  c nn  bn 
Suppose 𝐴 is a square matrix and 𝐿 and 𝑈 are
the multiplication factors of that matrix, i.e. 𝐴 = 𝐿𝑈 then

116 This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Journal for Research in Applied Sciences ISSN: 2583-4053
and Biotechnology Volume-2 Issue-3 || June 2023 || PP. 114-117
www.jrasb.com https://doi.org/10.55544/jrasb.2.3.15

𝑎11 𝑎12 𝑎13 REFERENCES

𝐴 = [𝑎21 𝑎22 𝑎23 ] = 𝐿𝑈
𝑎31 𝑎32 𝑎33 [1] Anton, H., & Rorres, C. (2005). Student solutions
manual to accompany Elementary linear algebra with
1 0 0 𝑢11 𝑢12 𝑢13 applications. John Wiley & Sons.
𝐿 = [ 𝑙21 1 0 ] , 𝑈 = [ 0 𝑢12 𝑢13 ] [2] Anton, H., & Rorres, C. (2013). Elementary linear
𝑙31 𝑙32 1 0 0 𝑢13 algebra: applications version. John Wiley & Sons.
[3] Howard, A. (2000). Elementary linear algebra
1 0 0 𝑢11 𝑢12 𝑢13 with applications: applications version. Wiley.
𝐴 = 𝐿𝑈 ⇒ [ 𝑙21 1 0 ] ∙ [ 0 𝑢22 𝑢23 ] = [4] Scheick, J. T. (1997). Linear algebra with
𝑙31 𝑙32 1 0 0 𝑢33 applications (Vol. 81). New York: McGraw-Hill.
[5] V. VEKATESWARA RAO and N.
1 0 0 𝑢11 𝑢12 𝑢13 KRTSHNAMURTHY , Mathematics for B,S,C volume-3
pages(3-108)
𝐴 = 𝐿𝑈 ⇒ [ 𝑙21 1 0 ] ∙ [ 0 𝑢22 𝑢23 ]
[6] Emal, Abdulhaq, Linear Algebra III Saeed
𝑙31 𝑙32 1 0 0 𝑢33
Publications (2011)
𝑢11 𝑢12 𝑢13
[7] Emal, Abdulhaq, Linear Algebra II Saeed
= [ 𝑙21 𝑢11 𝑙21 𝑢12 + 𝑢22 𝑙21 𝑢13 + 𝑢23 ] Publications (2014)
𝑙31 𝑢11 𝑙31 𝑢12 + 𝑙32 𝑢22 𝑙31 𝑢13 + 𝑙32 𝑢23 + 𝑢33 [8] Emal, Abdulhaq, Issues of linear algebra solved
Saeed Publications (2017)
[9] Porncky, Mohammad Raza, Tabish, Yahya
IV. CONCLUSION Analytical Geometry and Linear Algebra, Iran Textbook
Publishing Company (2015)
By providing this research paper, we can [10] Sanaye, Ghulam, Theory of numbers and linear
conclude that the importance and role of linear systems algebra Saeed Publications (2017)
in mathematical and natural sciences. Also understand
what’s the role of linear system in technology and
engineering? This study also identified an effective
method of solving equations for linear systems.

117 This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)