Engineering Mathematics - I (MATH ZC 161) : BITS Pilani

BITS Pilani, K K Birla Goa Campus
BITSPilani
K K Birla Goa Campus
Engineering Mathematics I
(MATH ZC 161)
Dr. Amit Setia (Assistant Professor)
Department of Mathematics
BITSPilani
Chapter 8: Matrices
The remaining part of section 8.1(Matrix Algebra) with
examples was discussed:
Triangular Matrix
Upper triangular matrix
Summary of lecture 2
BITS Pilani, K K Birla Goa Campus BITS Pilani, K K Birla Goa Campus
Upper triangular matrix
Lower triangular matrix
Symmetric Matrix
03/08/2012 3 Engineering Mathematics I (MATH ZC 161)
Then the section 8.2 (System of linear algebraic equations)
was started and following topics were covered:
Linear equations and its examples with geometrical
interpretations in 2-dimensional and 3-dimensional space
Linear System
Linear System
Solution of Linear System
Homogeneous and non-homogeneous linear system
Consistent and inconsistent system
Equivalent systems
Row equivalent
Elementary row operations
Row echelon form
Reduced row echelon form
Augmented Matrix
Method for solving linear system: Gaussian elimination
Method for solving linear system: Gaussian elimination
and Gauss-Jordan elimination method
Procedure for finding leading 1, echelon form and row
reduced echelon form
Examples based on Gaussian elimination method having
unique solution, no solution.
8.2 System of Linear Algebraic Equations
8.3 Rank of a Matrix
Outline of presentation
1 2 3
Solve the following system of equations
using Gauss Jordan Method
2 3 16
3 2 16
x x x
x x x
+ + =
+ + =
Problem (infinite solutions)
1 2 4
1 3 4
3 2 16
2 12 5 5
x x x
x x x
+ + =
+ =
1
2 1 3 0 16 1 1/ 2 3/ 2 0 8
1
3 2 0 1 16 3 2 0 1 16
2 0 12 5 5 2
2
0 12 5 5
R
( (
( (
( (
( (

Solution
2 0 12 5 5 2 0 12 5 5
( (


( )
( )
1 2
1 3
1 1/ 2 3/ 2 0 8
0 1/ 2 9 / 2
1 1/ 2 3/ 2 0 8
3 2 0 1 16
2 0 1
3
1 8
0 1 9 1 2 5 5 1 5
2
R R
R R
+
+
(
(
(
(
(

(
(

(

2 0 1 0 1 9 1 2 5 5 1 5
(

(

2
1 1/ 2 3/ 2 0 8
0 1/ 2 9 / 2 1 8
1 1/ 2 3/ 2 0
8
0 1 9 2 16 2R
(
(
(
(
(

(
(

(

2
0 1/ 2 9 / 2 1 8
0 1 9 5 11
0 1 9 2 16
0 1 9 5 11
2R (
(
(

(

(

2 1
1 1/ 2 3/ 2 0
8
0 1 9 2 16
1 0 6 1
1
1
6
0 1 9 2 16 2
R R
(
(
(
(
| |
+
|
\
(
(
(
(
2 3
0 1 9 5 11 0 0 0 3 27 R R
(

(

\
+
(

(


3
1 0 6 1
16
0 1 9 2 16
1 0 6 1
16
0 1 9 2 1
1
6
3
R
| |
|
(
(
(
(
(
( (
\
3
0 1 9 2 16
0 0 0 3 2
0 1 9 2 16
0
3
0 0 1 9 7
R
|
(
(
(
\

(

( )
3 1
3 2
1 0 6 0
25
0 1 9 0 34
9
0 0 0 1
6 25
1 0 6 1
16
0 1 9 2 16
9
0 0 0 1
2
x x
R R
R R
(
(
(
(
(

+ =
(
(
(
(

+
+

1 3
2 3
4
3
6 25
9 34
9
3 column does not have leading 1 let
the infinite solution set is
25 6 , 9 3
rd
x x
x x
x
x c
c c
+ =

( ) { }
4, , 9 | c c R
Column without leading 1
Example ( )
If the resulting augmented matrix by using
Gaussian elimination method is
1 5 2 3 2 4
0 1 1 3 7 2
solution set
(
(

(

0 1 1 3 7 2
0 0 0 1 2 5
0 0 0 0 0 0
then find the complete solution set for the
corresponding sys
(

(
(
(
(

tem of linear equations.
1 5 2 3 2
4
2
0 1 1 3 7
(

(
(
(
Columns without
leading 1
3 5
3 5
5
0 0 0 1 2
0
0 0 0 0 0
& are independent variables
let ,
x x
x c x e
(
(
(

= =
This matrix corresponds to
1 5 2 3 2
4
2
0 1 1 3 7
the system
5
0 0 0 1 2
0
0 0 0 0 0
(

(
(
(
(

1 2 3 4 5
2 3 4 5
4 5
This matrix corresponds to the system
5 2 3 2 4 (1)
3 7 2 (2)
2 5 (3)
0 0 (4)
x x x x x
x x x x
x x
+ + =
=
+ =
=
( )
4 5
2 3 4 5
4
Ignore eq. (4),
eq. (3) 5 2
eq. (2) 3 7 2
3 5 2 7 2
5 2
x x
x x x x
x c e e
x e
=
= + +
= + +
=
( )
( ) ( )
2
1 5 4 3
1
2
1
2
3 5 2 7 2
eq. (1) 2 3 2 5 4
2 3 5 2 2 5 13 4
13
3 13 46
x c e e
x x x x x
x c
x e
e
x c e
e c c e
= + +
= +
= + + +
= + +
= + +
( ) { }
the complete solution set is
: ,
Particular solution can be found by choosing values
3 13 46, 13, ,
Note
,
:
5 2 c e c e c e e c e R + + + +

Particular solution can be found by choosing values
for c and e
e.g.
For 1, 2gives (23, 12, 1, 9, 2) as one of
solution out of possi
c e = =
ble solutions.
( )
11 1 12 2 1
A system of linear equations 1 is said to be
homogeneous if the constant terms are zero.
i.e.
... 0
n n
a x a x a x + + + =

Homogeneous Linear
System
11 1 12 2 1
21 1 22 2 2
1 1 2 2
... 0
... 0
.......................................
... 0
n n
n n
m m mn n
a x a x a x
a x a x a x
a x a x a x
+ + + =

+ + + =
`
+ + + =
( )
2
. . i e
AX O
)
=
2 3 0
4 6 0
e.g.
x y
x y
=
+ =

i.e. ,
2 3 0
where , ,
4 6 0
AX O
x
A X O
y
=
( ( (
= = =
( ( (

1. A homogenous system is
and (0,0,0,.....,0) is a of AX=O
Any oth
always consistent
nontrivial solution
er sol
trivi
ution of AX=O is called
.
al solution
Remarks
( )
. .
2 3 0
1
4 6 0
(0, 0) is a trivial solut
e g
x y
x y
=

`
+ =
)
( )
( )
ion of 1
(9, 6) is a nontrivial solution of 1
2. The homogeneous linear system has two
posibilities for its solutions:
i) The system has only the trivial solution
ii) The system has infinitely many nontrivial solutions,
in addition to the trivial solution
Existence of Nontrivial
solution
Let be a homogeneous system of
equations in variables.
If ,
AX O
m n
m n
=
<
If ,
then the system has a nontrivial solution.
m n <
Use Gauss-Jordan method to determine the complete
solution set for each system and give one particular
nontrivial solution, if exists.
2 3 2 13 0 x x x x + =
Problem
1 2 3 4
1 2 3 4
1 2 3 4
2 3 2 13 0
4 7 4 29 0
2 8 0
x x x x
x x x x
x x x x
+ =
+ =
+ + =
1
2 3 2 13 0 1 3/ 2 1 13/ 2 0
4 7 4 29 0 4 7 4 29 0
1
R
( (
( (

( (
| |
|
Solution
1
13
4 7 4 29 0 4 7 4 29 0
1 2 1 8 0 1 2 1 8 0
Note: R was a better
2
option
R
( (
( (

|
\
25 03/08/2012 25 Engineering Mathematics I (MATH ZC 161)

( )
( )
1 2
4
1
1 3/ 2 1 13/ 2 0
0 1 0
1 3/ 2 1 13/ 2 0
4 7 4 3 0 29 0
R R
R R
+
+
(
(

(
(
(
(

(
( )
1 3
1
0 1/ 2 0 1 2 1 8 3 2 0 0 /
R R +
(
(

(
(


( )
2
1 3/ 2 1 13/ 2 0
0 1 0 3 0
1 3/ 2 1 13/ 2
0
0 1 0 3 0 1 R
(
(

(
(
(
(

( )
2
0 1 0 3 0 0 1 0 3 0
0 1 0 1/ 2 0 3/ 2 0 / 2 0
1
/ 2 0 3
R
(
(
(
(

(

2 3
1 0 1 2
0
0 1 0 3 0
1 3/ 2 1 13/ 2
1
2
0
0 1 0 3 0
R R
| |
+
|
\
(
(
(
(
(
(
2 1
0 1 0 3 0
0 0
0 1 0 3 0
0 1
3
/ 2 0 3/ 2 0
2
0 0 0 R R
\
|
(
( |
+
|
\
(
(
(


1 3 4
2 3
2 0
3 0
1 0 1 2
0
0 1 0 3 0
0 0 0 0 0
x x x
x x
(
(
(
(
(

+ =

+ =

( ) { }
( )
rd th
3 4
here 3 & 4 columns are without leading 1's
let ,
2 , 3 , , | , is complete solution set
For particular solution, let 1, 2
3, 6,1, 2
x c x d
c d d c d c d R
c d
= =

= =

BITSPilani
8.3 Rank of a Matrix
[ ]
11 12 1
21 22 2
1 2
Let A= be the general m n matrix
n
n
m m mn
a a a
a a a
a a a
(
(
(

(
(

Row and column vectors of

a matrix A
[ ]
[ ]
[ ]
1 11 12 1
2 21 22 2
1 2
then the rows u .........
u .........
...................................
u .........
are calle
n
n
m m m mn
a a a
a a a
a a a

=
=
=
d row vectors of A
1 11 12
2 21 22
and the columns
n
n
a a a
a a a
( ( (
( ( (
( ( (
2 21 22
1 31 2 32 3
1 2
, ,......,
are called column vectors of
n
n n
m m mn
a a a
v a v a v a
a a a
A
( ( (
( ( (
= = =
( ( (
( ( (
( ( (

( )
1 2
The rank of matrix , denoted by rank ,
is the maximum number of
row vectors in .
Let , ,...., be the row vectors
linearly independent
of
m
m n A A
A
u u u A
Rank of a Matrix
The row vectors are linearly independent if none of the
The row vectors are linearly dependent if
any of th
row vectors can be written as a linear combination
e row vectors of can be written as a
linear comb
of
the other row vector
ination of the oth w
s
er ro
A
vectors of A
If we row-reduce a matrix into a row-echelon matrix ,
then the nonzero rows of are linearly independent
A B
B
Remark
1 2 3
Determine whether given set of vectors are
linearly dependent or linearly independent
1, 2, 3 , 1, 0,1 & 1, 1, 5 u u u = = =
Problem
1 2 3
Forming a matrix A by
1, 2, 3 , 1, 0,1 & 1, 1, 5
as row vectors of A,
u u u = = =
Solution
( )
( )
2 1
23
3 1
1 2 3 1 2 3
1
1 0 1 0 0 1
1
1 1 5 0 1 5
R R
R
R R
( (
+
( (
( (
+
( (


( )
2
1 2 3
1 2 3
0 1 5 1 0 1 5
0 0 1
0 0 1
R B
(
(
(
(
=
(
(
(
(

0 0 1
0 0 1
3 linearly independent row vectors in B as well as in A
no. of nonzero rows in B 3
(
(
(

=
1 2 3
Write the vector 1, 2, 5 as a linear combination
of the vectors e 1,1,1 , 1, 2, 3 & 2, 1,1
v
e e
=
= = =
Problem
[ ] [ ] [ ] [ ]
[ ] [ ] [ ] [ ]
1 2 3
We want to writescalars , , such that
1, 2, 5 1,1,1 1, 2, 3 2, 1,1
1, 2, 5 , , , 2 , 3 2 , ,
a b c
v ae be ce
a b c
a a a b b b c c c
= + +
= + +
= + +
Solution
[ ] [ ] [ ] [ ]
[ ] [ ]
1, 2, 5 2 , 2 , 3
2 1
2 2
3 5
which can be written in the form
a b c a b c a b c
a b c
a b c
a b c
AX
= + + + + +
+ + =
+ =
+ + =
= B
[ ]
1 1 2 1
Writing as A|B 1 2 1 2
1 3 1 5
(
(
=
(
(

1 2 3
solving it by Gauss elimination method, we get
6, 3, 2
6 3 2
a b c
v e e e

= = =
= + +
1 2 3
Write the vector 2, 5, 3 as a linear combination
of the vectors 1, 3, 2 , 2, 4, 1 & 1, 5, 7
Trying as in last problem,
Hint:
v
e e e
=
= = =
Problem
Trying as in last problem,
one will get an inconsistent system.
So one can not write as a linear combi v
1 2 3
nation of
1, 3, 2 , 2, 4, 1 & 1, 5, 7 e e e = = =
If a matrix is row equivalent to a row-echelon form ,
then
rank( ) the number of nonzero rows in row-echelon form
A B
A B =
Rank of a Matrix by row
reduction
rank( ) the number of nonzero rows in row-echelon form A B =
Find rank of the matrix
1 2 3 4
1 4 6 8
(
(
(
(
Problem
0 1 0 0
2 5 6 8
(
(
(

( )
( )
2 1
4 1
1 2 3 4
1 2 3 4
1
1 4 6 8
0 6 3 4
0 1 0 0
2 0 1 0 0
R R
R R
(
(
(
(
+
(
(
(
(
+
(
(

Solution
( )
4 1
0 1 0 0
2 0 1 0 0
2 5 6 8
0 9 0 0
R R
(
(
+
(
(
(


23
1 2 3 4
0 1 0 0
0 6 3 4
1 2 3 4
0 6 3 4
0 1 0 0
R
(
(
(
(
(
(
(
(
(
(

0 6 3 4
0 9 0
0
0
0
1 0 0
0 9 0
(
(
(
(
(
(


( )
( )
3 2
4 2
1 2 3 4
6
0 1 0 0
9
0 0 3 4
1 2 3 4
0 1 0 0
0 6 3 4
R R
R R
(
(
+
(
(
+
(
(
(
(
(
(

( )
4 2
9
0 0 3 4 0 6 3 4
0 9 0 0 0 0 0 0
R R
(
+
(
(
(
(

(

3
1 2 3 4
0 1 0 0
1
4
3
0 0 1
3
1 2 3 4
0 1 0 0
0 0 3 4
R
(
(
(
| |
(
|
( \
(
(
(
(
(
(

( )
3
0 0 0 0
the no. of nonzero rows in echelon form of
given ma
0 0 0 0
trix is 3
rank 3 A
(
(

(
(

=

( )
( )
A linear system of equations is
rank rank
consistent AX B
A A B
=
= (

Theorem:
(consistent and inconsistent system AX=B)
( )
( )
A linear system of equatio inconsist ns is
rank rank
ent AX B
A A B
=
< (

( )
Suppose a linear system with
equations and n unknowns is consistent.
If rank ,
AX B
m
A r
=
=
Theorem:
(number of parameters in a solution)
( )
( )
If rank ,
then the solutions of the stystem contains
parameters
A r
n r
=

, 0 AX B B =
consistent inconsistent
( )
Let equations in unknowns
Two cases: 0, B 0; let rank
m n AX B
B A r
=
= =
( )
( )
rank
consistent
rank A A B = (

( )
( )
ran
inconsis
k
tent
rank A A B < (

( )
( )
ran
unique solution
k rank A n A B = (
( )
( )
rank ,
arbitrary par
solu
ameters in solutio
tion
n
s
A r n
n r
=
<

0 AX =
Always consistent
Solution of homogeneous
system
( )
unique solution
rank
, 0
A r
X
n
=
= =
( )
( )
rank ,
arbitrary par
solu
ameters in solutio
tion
n
s
A r n
n r
=
<

1 2 3
1 2 3
Using rank of a matrix, check whether the system
5 2 2 14
3 8
2 2 3
x x x
x x x
x x x
+ =

+ =
`
+ =
)
Problem (unique solution)
1 2 3
2 2 3
is having
i) unique solution
ii) solutions
iii) no solution
x x x

+ =
)

we have got the in same way
as explained earlier (in lecture 2 slide no. 45)
2 2
14
1
5 5
5
row-echelon form of [ ] A B
(

(
(
( )
( )
5
0 1 1 2
5
0 0 1
rank rank 3
unique solution for given syste m
A A B
AX B
(
(
(
(
(

= ( =

=

1 2 4
1 2 3 4
3 6 3 9
2 4 2 11
4 8 6 7 5
x x x
x x x x
x x x x
+ =

+ + =
`
+ + =
)
Problem (no solution)
1 2 3 4
4 8 6 7 5
is having
i) unique solution
ii) solutions
iii) no solution
x x x x

+ + =
)

1 2 0 1 3
1 5
(
(
(
( )
( )
1 5
0 0 1
2 2
0 0 0 0
1
rank 2 rank 3
no solution for given system
A A B
AX B
(
(
(
(
(

= < ( =

=

1 2 3
1 2 4
2 3 16
3 2 16
2 12 5 5
x x x
x x x
x x x
+ + =
+ + =
+ =
Problem (infinite solutions)
1 3 4
2 12 5 5
is having
i) unique solution
ii) solutions
iii) no solution
x x x + =

1 0 6 0
25
(
(
( )
( )
( )
0 1 9 0 34
9
0 0 0 1
rank rank 3 i.e. no. of variables 4
solutions for given s
A A B n
(
(
(
(

= ( = < =

ystem AX B =
( )
Suppose the system is consistent and AX B =
Problem
( )
is a 5 8 matrix and rank 3. How many
parameters does the solution of the system have ?
A A =
( )
( )
( )
is consistent
rank rank 3 8
no. of parameters in the solution is 5
AX B
A A B r n
n r
=
= ( = = < =

=
Solution
( )
no. of parameters in the solution is 5 n r =
( )
( )
b) If rank 2, then for what value
a) What is the maximum rank that A can have ?
Let be a nonzero 4 6 matrix
A B s
A
( =

Problem
( )
( )
of rank A is the system ,
c) If rank 3, then
0,
inconsistent, consistent ?
how many
AX B
A
B =
=

parameters does
the solution of the system 0 have ? AX =
( )
( )
b) If rank 2, then for what value
a) What is the maximum rank that A can have ?
Let be a nonzero 4 6 matrix
A B s
A
( =

Problem
( )
( )
of rank A is the system ,
c) If rank 3, then
0,
inconsistent, consistent ?
how many
AX B
A
B =
=

parameters does
the solution of the system 0 have ? AX =
( )
( )
( )
then for rank rank 2
a) A can have maximu
Let be a n
b) rank 2,
onze
m
ro 4 6 mat
ra
ix
nk 4
r
A A B
A
A B
< ( =

( =

Solution
( )
( )
( )
( )
the system , 0, is inconsistent,
rank rank 2
the system , 0, i
and
s consi
AX B B
A A B
AX B B

=
= ( =

=
( )
( ) ( )
c) rank 3, then the solution of system
0 have parameters = 6 3 =
stent
3
A r
AX n r
= =
=

Thanks
Thanks

Engineering Mathematics - I (MATH ZC 161) : BITS Pilani

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Engineering Mathematics - I (MATH ZC 161) : BITS Pilani

Uploaded by

Copyright:

Available Formats

BITS Pilani, K K Birla Goa Campus

03/08/2012 8 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

03/08/2012 9 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

03/08/2012 10 Engineering Mathematics I (MATH ZC 161)

03/08/2012 11 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

25 03/08/2012 25 Engineering Mathematics I (MATH ZC 161)

03/08/2012 26 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

03/08/2012 28 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

Row and column vectors of

03/08/2012 36 Engineering Mathematics I (MATH ZC 161)

03/08/2012 44 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

03/08/2012 45 Engineering Mathematics I (MATH ZC 161)

03/08/2012 47 Engineering Mathematics I (MATH ZC 161)

03/08/2012 49 Engineering Mathematics I (MATH ZC 161)

03/08/2012 50 Engineering Mathematics I (MATH ZC 161)

03/08/2012 51 Engineering Mathematics I (MATH ZC 161)

03/08/2012 52 Engineering Mathematics I (MATH ZC 161)

03/08/2012 53 Engineering Mathematics I (MATH ZC 161)

03/08/2012 54 Engineering Mathematics I (MATH ZC 161)

03/08/2012 55 Engineering Mathematics I (MATH ZC 161)

03/08/2012 56 Engineering Mathematics I (MATH ZC 161)

03/08/2012 62 Engineering Mathematics I (MATH ZC 161)

You might also like