Professional Documents
Culture Documents
The Different Solving Methods of Linear Systems
The Different Solving Methods of Linear Systems
The Different Solving Methods of Linear Systems
ISSN No:-2456-2165
The system of linear equations forms the basis of II. THE DIFFERENT SOLVING METHODS OF
linear algebra, which helps in solving and analyzing LINEAR SYSTEMS
important issues in the natural sciences, especially
mathematics. It is also used in solving mathematical An important issue to consider in the solving of linear
problems with the help of computer mathematical systems are the consistent and inconsistent situation of
programs. linear systems. Its mean if a system has a solution, it is
called a consistent system, and if it hasn’t no solution, it is
For example, it is used in the study and analysis of called an inconsistent system. Of course, generally in the
linear transformation as well as in solving optimization beginning we can't say the system is consistent or
problems. inconsistent. But in the particular case, we can define the
consistent and inconsistent case of Homogeneous system
I. INTRODUCTION through the matrix rank by The Rouché –Capelli theorem.
The concept of a system of linear equations was The following four methods are used for the solution
introduced first in Europe in 1637 by the famous French of linear systems;
mathematician René Descartes, in the words of Descartes. 1. Gauss Elimination method
Descartes 'appropriation was later incorporated into 2. Gauss Jordan Method
mathematics as Descartes' geometry. Today, with the help of 3. Cramer’s Roll
this system, the routes of air transit lines at airports are 4. LU Decomposition.
determined and shown, and their intersections are calculated
by solving a system of linear equations. Note:
Before describing these methods, it is necessary to
Suppose we have 𝑚 equations and 𝑛 unknowns then consider the following primary changes in the systems:
they form a system of the following: - Changing the location of two equations in a system
- Multiply the nonzero real number on both sides of an
𝑎11 𝑥1 + 𝑎12 𝑥2 +, … … … , +𝑎1𝑛 𝑥𝑛 = 𝑏1 equation
𝑎21 𝑥1 + 𝑎22 𝑥2 +, … … … , +𝑎2𝑛 𝑥𝑛 = 𝑏2 - Adding one equation to another equation
( … … … (1) - And remove the equations from the system which that
⋮ ⋮ ⋮ ⋮
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 +, … … … , +𝑎𝑚𝑛 𝑥𝑛 = 𝑏𝑚 take the form of compatibility.
For example:
Assuming that the matrix 𝐴 is the matrix of the
𝑥1 + 3𝑥2 + 𝑥3 = 10 coefficient unknowns and the matrix 𝐵 is the matrix of the
{ 𝑥1 − 2𝑥2 − 𝑥3 = −6 constants numbers so:
2𝑥1 + 𝑥2 + 2𝑥3 = 10
1 3 1 𝑥1 10
𝐴 = [1−2−1] , 𝑥 = [𝑥2 ] , 𝐵 = [−6]
2 1 2 𝑥3 10
IV. CONCLUSION