0% found this document useful (0 votes)
23 views35 pages

Week 2

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

Week 2

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

Linear Algebra

Lecturer: Res. Asst. Dr. Ekrem BAŞER


Contact:[email protected]
Matrices
• A rectangular array of numbers of the form is called an m × n matrix,
with m rows and n columns. We count rows from the top and
columns from the left.
Matrices
• Consider this matrix:

This row and column vectors represent respectively the 2-nd row and
the 3-rd column of the matrix, and 5 represents the entry in the matrix
on the 2-nd row and 3-rd column
Aritmetic Operations
Aritmetic Operations
Aritmetic Operations
• In order to perform addition or subtraction operations on matrices,
the dimensions of the matrices must be the same.
• For example; we do not have a definition for “adding” or
“subtracting” the matrices.
Aritmetic Operations
• Suppose that A, B, C are m × n matrices.
• Suppose further that O represents the m × n matrix with all entries
zero.
• Then;
(a) A + B = B + A;
(b) A + (B + C) = (A + B) + C;
(c) A + O = A; and
(d) there is an m × n matrix A’ (inverse of A) such that A + A’ = O.
Multiplication Matrix by Scalars
Multiplication Matrix by Scalars
Multiplication Matrix by Scalars
• Suppose that A, B are m×n matrices, and that c, d ∈ R.
• Suppose further that O represents the m × n matrix with all entries
zero.
• Then;
(a) c(A + B) = cA + cB;
(b) (c + d)A = cA + dA;
(c) 0A = O; and
(d) c(dA) = (cd)A.
Matrix Multiplication
• In order to multiply two matrices with each other, the number of columns of the first
matrix must be equal to the number of rows of the second matrix.

• Then the matrix product AB is given by the m × p matrix


• AB ≠ BA
Matrix Multiplication
Matrix Multiplication
• Suppose that A is an m×n matrix, B is an n×p matrix and C is an p × r
matrix. Then A(BC) = (AB)C.
• Suppose that A is an m × n matrix and B and C are n × p matrices.
Then A(B + C) = AB + AC.
• Suppose that A and B are m × n matrices and C is an n × p matrix.
Then (A + B)C = AC + BC.
• Suppose that A is an m × n matrix, B is an n × p matrix, and that c ∈ R.
Then c(AB) = (cA)B = A(cB).
Identity Matrix
• The n × n matrix;

where

is called the identity matrix.


Identity Matrix
• A is a n*n matrix;
Propositions
• A is a n*n matrix;
Finding Inverse of a Matrix by Elementary
Row Operations.
• Inverse of a matrix that is n*n can be found by using elementary row
operations.
• The inverse of every square matrix cannot be found this way.
• To find the inverse of a matrix A, the basic steps are;
1. Write it as
2. Apply elementary row operations to get it converted as
3. The right side matrix () will be the inverse of (which is )
Conditions for a matrix to be invertible
• There are two conditions for a matrix to be invertible:
1. The matrix must be a squared matrix. ()
2. The determinant of the matrix should not be 0.
Finding Inverse of a Matrix by Elementary
Row Operations.
• Find the inverse of the matrix , by elementary row operations.
•⇾ Should be 0

• ⇾
• ⇾
Should be 1

Should be 0

𝐼 𝐴
−1
• Find the inverse of the matrix , by elementary row operations.


Should be 0


Should be 0

Should be 1

Should be 0

𝐼 𝐴
−1

Should be 0
Solving Linear Equations By Using Inverse
of Matrix
• The criteria to solve a linear equation by using inverse of a matrix is;
1. The number of linear equations must be equal to the number of
unknown variables.
Example
• Solve this linear system by using inverse matrix.
3th step: =

1th step:

=
2th step: ⇾


26
𝑥=
5
12
⇾ 𝑦 =−
5

𝐼 𝐴
−1
Example
• Example on board.
Gauss Jordan Method
• Some authors use the term Gaussian elimination to refer only to the
procedure until the matrix is in echelon form, and use the term
Gauss-Jordan elimination to refer to the procedure which ends in
reduced echelon form.

•In linear algebra, Gauss–Jordan elimination is an algorithm for


getting matrices in reduced row echelon form using elementary
row operations. It is a variation of Gaussian elimination
Gauss Jordan Method
• This method can be used when number of linear equations are equal
to the number of unknown variables.
• Liner equations must be written as augmented matrix form.
The Steps To Gauss-Jordan Elimination
 Turn the equations into an augmented matrix.

 Use elementary row operations on matrix [A|b]


transform A into diagonal form. Make sure there are
no zeros in the diagonal.

 Divide the diagonal element and the right-hand


element (of b) for that diagonal element's row so
that the diagonal element is equal to one.
Example
• Solve the following system by using the Gauss-Jordan
elimination method.
Solution
• The augmented matrix of the system is the following.

• We will now perform elementary row operations until we obtain a


matrix in reduced row echelon form.
Solution
Solution
Solution
Solution
Solution
Solution
Solution

Finally we obtain the result of the system.

X= 3
Y=4
Z=-2

You might also like