0% found this document useful (0 votes)
13 views26 pages

Matrices Part 4

Uploaded by

alaayousefmm
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)
13 views26 pages

Matrices Part 4

Uploaded by

alaayousefmm
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/ 26

Linear Algebra: Matrices and

Vectors – Part 4

By Dr. Samer Awad


Assistant professor of biomedical engineering
The Hashemite University, Zarqa, Jordan
[email protected]
June 9, 2024 :Last update
2 [email protected] June 9, 2024

Cramer’s Rule for Linear


Systems of Two Equations

D1

D2
3 [email protected] June 9, 2024

Cramer’s Rule for Linear


Systems of Two Equations

D D1

D D2
4 [email protected] June 9, 2024

Cramer’s Rule for Linear


Systems of Two Equations
D D1

D D2
5 [email protected] June 9, 2024

Example 1: Cramer’s Rule for


Linear Systems of Two Equations
6 [email protected] June 9, 2024

Example 2: Cramer’s Rule for


Linear Systems of Two Equations
• Homework: solve this previous Gauss Elimination
example using Cramer’s Rule:

• back substitution now yields


7 [email protected] June 9, 2024

Cramer’s Rule for Linear


Systems of Three Equations
8 [email protected] June 9, 2024

Cramer’s Rule for Linear


Systems of n Equations
9 [email protected] June 9, 2024

Cramer’s Rule for Linear


Systems of n Equations

• This last rule will be used in Eigenvalues problems


10 [email protected] June 9, 2024

Inverse of a Matrix.
Gauss–Jordan Elimination
• For a matrix to have an inverse, it has to be a
square matrix.
• The inverse of an n x n matrix, is denoted by A-1
which is also an n x n matrix:

• If A has an inverse, then A is called a non-singular


(or invertible) matrix. Otherwise it is called singular.
• If A has an inverse then the inverse is unique.
• A has an inverse iff rank(A) = n.
• A has an inverse iff det(A) ≠ 0.
11 [email protected] June 9, 2024

Example: Finding Inverse of a Matrix


by Gauss–Jordan Elimination
12 [email protected] June 9, 2024

Example: Finding Inverse of a Matrix


by Gauss–Jordan Elimination
13 [email protected] June 9, 2024

Example: Finding Inverse of a Matrix


by Gauss–Jordan Elimination
• Up to here is Gauss elimination. In the next slide we
perform Gauss-Jordan steps, reducing
14 [email protected] June 9, 2024

Example: Finding Inverse of a Matrix


by Gauss–Jordan Elimination
• Gauss-Jordan steps: reducing
15 [email protected] June 9, 2024

Example: Finding Inverse of a Matrix


by Gauss–Jordan Elimination
• Gauss-Jordan steps: reducing
16 [email protected] June 9, 2024

Example: Finding Inverse of a Matrix


by Gauss–Jordan Elimination
• Gauss-Jordan steps: reducing
17 [email protected] June 9, 2024

Example: Finding Inverse of a Matrix


by Gauss–Jordan Elimination
18 [email protected] June 9, 2024

Formulas for Inverses


19 [email protected] June 9, 2024

Example: Formulas for Inverses

Here checkerboard:
20 [email protected] June 9, 2024

Example: Formulas for Inverses


• Find the inverse of:
21 [email protected] June 9, 2024

Example: Inverse of Diagonal


Matrices
• A diagonal matrix has an inverse if ajj≠0

• A-1 is also diagonal with entries ,


22 [email protected] June 9, 2024

Properties of Matrix Operations


• (AC)-1 = C-1 A-1
• (AC … PQ)-1 = Q-1 P-1 … C-1 A-1
• Matrix multiplication is NOT commutative: AB ≠ BA
• AB = 0, does not generally imply that A = 0 or B = 0 or
BA = 0


• AC = AD, does not imply that C = D even when A ≠ 0
23 [email protected] June 9, 2024

Properties of Matrix Operations


Let A, B, C be n x n matrices then:
• If rank(A) = n and AB = AC then B = C
Proof: A-1 exists, A-1AB = A-1AC  B = C
• If rank(A) = n and AB = 0 implies that B = 0.
Proof: A-1 exists, A-1AB = A-10  B = 0
• Hence, if AB = 0, but A ≠ 0 & B ≠ 0 then rank(A) < n
and rank(B) < n
Proof: if rank(A) = n  A-1 exists  A-1AB = A-10  B = 0
also if rank(B) = n  B-1 exists  ABB-1 = 0B-1  A = 0
24 [email protected] June 9, 2024

Properties of Matrix Operations


Let A, B, C be n x n matrices then:
• If A is singular  BA and AB are singular
Proof: see textbook
For any n x n matrices A and B
• det (AB) = det (BA) = det A det B.
Proof: see textbook
25 [email protected] June 9, 2024

Example: Solving Systems of Linear


Equations Using Matrix Inverse

Ax=b
26 [email protected] June 9, 2024

Example: Solving Systems of Linear


Equations Using Matrix Inverse
Ax=b

Multiply by inverse:
A-1 A x = A-1 b  x = A-1 b

You might also like