0% found this document useful (0 votes)
122 views5 pages

Microsoft Word Document جديد ‫‬

The document discusses solving systems of linear equations using the Gauss elimination method. It defines three types of systems: consistent independent (one solution), consistent dependent (multiple/infinitely many solutions), and inconsistent (no solutions). The Gauss elimination method involves performing elementary row operations on the coefficient matrix until it is in reduced row echelon form. This reveals whether the system has a solution and if so, what the values of the unknowns are. An example using a 3x3 system demonstrates applying row operations to transform the matrix and determine the system is inconsistent.

Uploaded by

Mohammed Madi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
122 views5 pages

Microsoft Word Document جديد ‫‬

The document discusses solving systems of linear equations using the Gauss elimination method. It defines three types of systems: consistent independent (one solution), consistent dependent (multiple/infinitely many solutions), and inconsistent (no solutions). The Gauss elimination method involves performing elementary row operations on the coefficient matrix until it is in reduced row echelon form. This reveals whether the system has a solution and if so, what the values of the unknowns are. An example using a 3x3 system demonstrates applying row operations to transform the matrix and determine the system is inconsistent.

Uploaded by

Mohammed Madi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Read more:

 System of equations calculator


 Square matrix
 Determinant of a matrix
 Invertible matrices

Gauss elimination method is used to solve a system of linear equations.


Let’s recall the definition of these systems of equations. A system of linear
equations is a group of linear equations with various unknown factors. As we
know, unknown factors exist in multiple equations. Solving a system involves
finding the value for the unknown factors to verify all the equations that make
up the system.

If there is a single solution that means one value for each unknown factor,
then we can say that the given system is a consistent independent system. If
multiple solutions exist, the system has infinitely many solutions; then we say
that it is a consistent dependent system. If there is no solution for unknown
factors, and this will happen if there are two or more equations that can’t be
verified simultaneously, then we say that it’s an inconsistent system.

This can be summarized in a table as given below:

Name of the system of equations Number of solutions

Consistent independent system 1

Consistent dependent system Multiple or Infinitely many

Inconsistent system 0

Now, let’s have a look at the method that can be used to find the solution(s) of
the given system of equations.

What is the Gauss Elimination Method?


In mathematics, the Gaussian elimination method is known as the row
reduction algorithm for solving linear equations systems. It consists of a
sequence of operations performed on the corresponding matrix of coefficients.
We can also use this method to estimate either of the following:
 The rank of the given matrix
 The determinant of a square matrix
 The inverse of an invertible matrix

To perform row reduction on a matrix, we have to complete a sequence


of elementary row operations to transform the matrix till we get 0s (i.e., zeros)
on the lower left-hand corner of the matrix as much as possible. That means
the obtained matrix should be an upper triangular matrix. There are three
types of elementary row operations; they are:

 Swapping two rows and this can be expressed using the notation ↔, for example,
R2 ↔ R3
 Multiplying a row by a nonzero number, for example, R1 → kR2 where k is some
nonzero number
 Adding a multiple of one row to another row, for example, R2 → R2 + 3R1

Learn more about the elementary operations of a matrix here.

The obtained matrix will be in row echelon form. The matrix is said to be in
reduced row-echelon form when all of the leading coefficients equal 1, and
every column containing a leading coefficient has zeros elsewhere. This final
form is unique; that means it is independent of the sequence of row
operations used. We can understand this in a better way with the help of the
example given below.

Gauss Elimination Method with Example


Let’s have a look at the gauss elimination method example with a solution.

Question:

Solve the following system of equations:

x+y+z=2

x + 2y + 3z = 5

2x + 3y + 4z = 11

Solution:

Given system of equations are:

x+y+z=2

x + 2y + 3z = 5
2x + 3y + 4z = 11

Let us write these equations in matrix form.

Subtracting R1 from R2 to get the new elements of R2, i.e. R2 → R2 – R1.

From this we get,

Let us make another operation as R3 → R3 – 2R1


Subtract R2 from R1 to get the new elements of R1, i.e. R1 → R1 – R2.

Now, subtract R2 from R3 to get the new elements of R3, i.e. R3 → R3 – R2.

Here,

x – z = -1

y + 2z = 3
0=4

That means, there is no solution for the given system of equations.

You might also like