Scribd
Upload
9 views4 pages

Linear Algebra 1b

Uploaded by

okjsv17
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views4 pages

Linear Algebra 1b

Uploaded by

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

Session-2:

Gauss Elimination Method:


Solution by Gauss Elimination: The Gauss Elimination is a standard method for solving
linear equations. It is a systematic elimination. It is a reduction to triangular form, from which
we shall obtain the values of the unknowns by substitution. This method will be very clear by
taking the following problems.

x1  x2  xSolve
Solved Example: 3  0 the following system by Gauss Elimination:

 x1  x2  x3  0
10 x2  25 x3  90
20 x1  10 x2  80

 x2 can
x1 We
Solution:  x3write
 0 the system and its augmented matrix side by side:
 x1  x2  x3  0
10 x2  25 x3  90 1 −1 1 0
20 x1  10 x2  80 −1 1 −1 0
𝐾= .
0 10 25 90
[ 20 10 0 80 ]

Step -1: Elimination of 𝒙𝟏


The first equation is called pivot equation and the coefficient 1 of its 𝑥1 −term the
pivot. Using pivot equation, we can eliminate 𝑥1 from other equation .For this, we have to do:

Adding 1 times pivot equation to the 2nd and -20 times pivot equation to the 4th
 x2result
equation,x1 the  x3 is:0
00
10 x2  25 x3  90 1 −1 1 0
30 x2  20 x3  80 0 0 0 0
𝐾= .
0 10 2 90
[ 0 30 −20 80 ]

Step -2: Elimination of 𝒙𝟐


The 1st equation which has just served as the pivot equation remains unchanged. The 2 nd
equation is the next pivot equation, but for this problem 2 nd equation contains no 𝑥2 −term.
Now it is required to change the order of the equation to get a non-zero pivot. W e can put 2nd
equation at the end and the 3rd and 4th equations one place up. This is called partial pivoting.
We get:

x1  x2  x3  0
10 x2  25 x3  90
30 x2  20 x3  80 1 −1 1 0

00 0 10 25 90
𝐾= .
0 30 −20 80
[ 0 0 0 0 ]

x1  x2 3xtimes
Adding 3  0 pivot equation to the 3rd equation, the result is:

10 x2  25 x3  90
1 −1 1 0
 95 x3  190
00 0 10 25 90
𝐾= .
0 0 −95 − 190
[ 0 0 0 0 ]

Back Substitution: Determination x 𝑥3, 𝑥190


 95 of 2 , 𝑎𝑛𝑑
 x𝑥3(in
2 this order)
3 3

10 x2  25 x3  90  x2  4
x1  x2  x3  0  x1  2

The solution of the system is:

𝑥1 = 2, 𝑥2 = 4, 𝑎𝑛𝑑 𝑥3 = 2.

Elementary Operations for Equations:


 Interchange of two equations
 Addition of a constant multiple of one equation to another equation
 Multiplication of an equation by a non-zero constant C

Elementary Row Operations for Matrices:


Elementary row operations do not change the solution set of the system of linear equations
represented by a matrix, and are used in Gaussian elimination (respectively, Gauss-Jordan
elimination) to reduce a matrix to row echelon form (respectively, reduced row echelon
form).

The acronym "ERO" is commonly used for "elementary row operations".

 Row switching
A row within the matrix can be switched with another row.
𝑅𝑖 ⟷ 𝑅𝑗
 Row multiplication
Each element in a row can be multiplied by a non-zero constant.

𝑘𝑅𝐼 → 𝑅𝑖 , 𝑤ℎ𝑒𝑟𝑒 𝑘 ≠ 0

 Row addition
A row can be replaced by the sum of that row and a multiple of another row.

𝑅𝐼 + 𝑘𝑅𝑗 → 𝑅𝑖 , 𝑤ℎ𝑒𝑟𝑒 𝑖 ≠ 𝑗

The elementary matrix for any row operation is obtained by executing the operation on an
identity matrix.

Row Echelon Form:


In linear algebra a matrix is in row echelon form if

 All nonzero rows (rows with at least one nonzero element) are above any rows of all
zeroes [All zero rows, if any, belong at the bottom of the matrix]
 The leading coefficient (the first nonzero number from the left, also called the pivot)
of a nonzero row is always strictly to the right of the leading coefficient of the row
above it.
 All entries in a column below a leading entry are zeroes (implied by the first two
criteria).

This is an example of 3×4 matrix in row echelon form:

1 𝑎1 𝑎2 ⋮ 𝑎3
[0 2 𝑎 4 ⋮ 𝑎 5 ]
0 0 −1 ⋮ 𝑎6

A matrix is in reduced row echelon form (also called row canonical form/Row-Echelon
Normal Form) if it satisfies the additional condition:

 Every leading coefficient is 1 and is the only nonzero entry in its column, like in this
example:

1 0 0 ⋮ 𝑏1
[0 1 0 ⋮ 𝑏2 ]
0 0 1 ⋮ 𝑏3
Note that this does not always mean that the left of the matrix will be an identity matrix. For
example, the following matrix is also in reduced row-echelon form:

You might also like