L2

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
8.1 Matrix Algebra
Matrix
Square Matrix
Equality of Matrices
Addition of 2 matrices
Scalar multiple of a matrix
Summary of last lecture
BITS Pilani, K K Birla Goa Campus BITS Pilani, K K Birla Goa Campus
Scalar multiple of a matrix
Difference of 2 matrices
Properties of Addition and scalar multiplication
Matrix multiplication: Associative law, Distributive law
Transpose of a matrix
Properties of transpose of a matrix
Zero of a matrix
Identity Matrix
31/07/2012 3 Engineering Mathematics I (MATH ZC 161)
8.1 Matrix Algebra
8.2 System of Linear Algebraic Equations
Outline of presentation
zero are diagonal main the below entries its all if
matrix r triangula a be to said is matrix An A n n
Triangular Matrix
zero. are diagonal main the above entries its all if or
A square matrix A is called an upper triangular matrix,
if 0
ij
a ; i j = >
Upper Triangular Matrix &
Lower Triangular Matrix
A square matrix is called lower triangular matrix,
if 0
ij
A
a ; i j = <
Which of the following are upper and lower triangular matrices ?
1 2 1 2 1 0
) , ) , )
0 3 0 0 2 0
1 0 0 1 2 9
i ii iii
( ( (
( ( (

( (
( (
Problem
1 0 0 1 2 9
) 2 4 0 , ) 0 4 0
7 0 5 0 0 5
iv v
( (
( (
( (
( (

upper triangular matrices: ), ), )
lower triangular matrices: ), )
i ii v
iii iv
Answer
lower triangular matrices: ), ) iii iv
i, j a a A
A A A
T
=
=
if symmetric is
i.e.
if symmetric be to said is matrix square A
Symmetric Matrix
i, j a a A
ji ij
= if symmetric is
1 5 7
Let 5 2 9
7 9 3
1 5 7
A
(
(
=
(
(

(
(
Example
1 5 7
then 5 2 9
7 9 3
T
A A
(
(
= =
(
(

Problem
Show that if is an matrix,
then BB is symmetric.
T
B m n
BITSPilani
8.2 System of Linear Algebraic
Equations
An equation of the form
; ( , and are real constants),
is called a linear equation in the variables and .
ax by c a b c
x y
+ =
Introduction
What does represent geometrically in - plane ? ax by c xy + =
Similarly, an equation of the form
; ( , , and d are real constants),
is called a linear equation in the variables , and .
ax by cz d a b c
x y z
+ + =
What does represent geometrically in space ? ax by cz d + + =
1 2
We now define a linear equation in the variables
, ,......, as
n
n
x x x
a x a x a x b + + + =
1 1 2 2
1 2
where , ,......., and are real constants.
n n
n
a x a x a x b
a a a b
+ + + =
Which of the following equations are linear ?
) 100 0 02
) 2 5 4
i x y . ;
ii x y
+ =
+ =
Problem
1 2 3
) 2 5 4
) 12 3 1
) 100 cos
) 3 0.1 0
) 2 2
ii x y
iii y x z ;
iv y x
v x x x
vi x y xz
+ =
= +
=
+ + =
+ =
1) A linear equation does not involve any products
or radical sign like square roots of variables etc.
Remarks
2) All variables appear only to the first power and do not appear as
arguments for trigonometric,logarithmic or exponential functions.
System of Linear equations or
Linear system
A system of linear equation in unknowns
has the general form
...
m n
a x a x a x b + + + =

General Form:
( )
11 1 12 2 1 1
21 1 22 2 2 2
1 1 2 2
...
...
1
.......................................
...
n n
n n
m m mn n m
a x a x a x b
a x a x a x b
a x a x a x b
+ + + =

+ + + =

`
+ + + =
)
11 12 13 1 1 1
Writing (1) in matrix form
. .
n
AX B
where
a a a a x b
=
( ( (
( ( (
11 12 13 1 1 1
21 22 23 2 2 2
1 2 3
. .
. . . . . . , . , .
. . . . . . . .
. .
n
n
m m m mn n m
a a a a x b
A X B
a a a a x b
( ( (
( ( (
( ( (
( ( (
= = =
( ( (
( ( (
( ( (

where ( 1, 2,..., ; 1, 2,..., )
are known as coefficients of the unknowns,
, 1, 2,..., , are called constants of the system.
ij
j
a i m j n
b j m
= =
=
( )
If all the constants , 1, 2,..., , are zero
the system 1 is said to be h
j
b j m =
omogeneous
otherwise it is called non-homogeneous system.
( )
1 2
A solution of a linear system 1 is a set of numbers
, ,...., that satisfies each equation in the system.
e.g.
n
n
x x x
Solution
e.g.
3
5
has solution ....... & .......
x y
x y
x y
+ =
=
= =
If there exists at least one solution of the linear system,
then system is called consistent
(i.e. it has a unique solution or solutions).
Consistent & Inconsistent
(i.e. it has a unique solution or solutions).
A linear system of equations which has no solutions is
said t
o be inconsistent.
system of non-homogeneous linear equations
consistent
inconsistent
consistent
inconsistent
unique solution
solutions
Can a system of 2 linear equations in 2 unknowns have
2 solutions or 3 solutions
or any finite number of solutions more than one ?
Problem
solution. one exactly has system the case
in which point, one only at intersect and
lines the Because exist. solution the Here,
2
1
L
L
Answer:
Case I
x
y
1
L
2
L
system. the o solution t
no ly consequent and on intersecti no is there
case in which parallel are and lines The
2 1
L L
Case II
x
y
1
L

2
L
system. the to solutions many infinitely ly consequent
and on intersecti of points many infinitely
are there case This coincide. and lines The
2 1
L L
Case III
x
y
1
L

2
L
Example a). : Solve
1
3 2 12
Example b) : Solve
3 3
x y
x y
x y
=

`
+ =
)
+ =

System of 2- linear equations in 2 variables :
3 3
2 6 8
Example c) : Solve
2 4
2 4 8
x y
x y
x y
x y
+ =

`
+ =
)
+ =

`
+ =
)
Answer a) 2, 3
Answer b) no solution
x y = =
Answer c) solutions
Two systems of linear equations in variables
are equivalent
they have exactly the same solution set
e.g.
m n
Equivalent Systems
( ) { }
2 1 4 14
and
3 9 5 2 4
are equivalent
because solution set of both is exactly
e.g
2, 3
.
x y x y
x y x y
= + =

+ = =

Solving Systems
We can transform a system of linear equations into an
by the following elementary operations:
i) Multiply an equation by a non-zero constant
equivalent system
i) Multiply an equation by a non-zero constant
ii) Interchange the positions of equations in the system
iii) Add a non-zero multiple of one equation to any
other equation
( )
11 12 1 1
21 22 2 2
The matrix of the stystem 1 can be written as
n
n
a a a b
a a a b
(
(
(
(

1 2
. .
This array is called the augmented matrix of the system.
m m mn m
a a a b
i e A B
(
(
(

(


Elementary Row Operations
(ERO)
i) Multiply a row by a non-zero constant
ii) Interchange any two rows
iii) Add a non-zero multiple of one row to any other row
Symbol Meaning
Symbol Meaning
Multiply the i
th
row by the nonzero
constant c
Interchange rows i and j
Multiply the i
th
row by c and add to
the j
th
row
ij
R
i
cR
i j
cR R +
An augmented matrix is row equivalent to
a matrix
A B
C D
(

(

Row Equivalent
is obtained from after a finite
number of elementary row operations
C D A B
( (

Elimination Methods
1. Gaussian elimination method
2. Gauss Jordan elimination method
2. Gauss Jordan elimination method
Row-echelon form
( )
i) The first nonzero entery in a nonzero row is 1
1
ii) In consecutive nonzero rows, the 1
called leading
leading
in the lower row appears to the right of
the 1 in the higher row
iii) Rows consistin
leading
g of all zeros are at the
bottom of the matrix
1 2 2 3
1
(
(
1 3 2
6
0 1 0 2
3
0 0 1
A
(
(
( =
(
(

The following augmented matrix
row ech
are al
elon f
l in
orm:
4
0 1 3 0
2
0 0 0 1
0
0 0 0 0
B
(
(
=
(
(
(

(

1 4 3 3
7
0 0 1 2 5
0 0 0 0
1
C
(
(
( =
(
(

Reduced row-echelon form
( )
i) The first nonzero entery in a nonzero row is 1
1
ii) In consecutive nonzero rows, the 1
in the lower row appears to the right of
called leading
leading
the 1 in the higher row
iii) Rows consistin
leading
g of all zeros are at the
bottom of the matrix
iv) A column containing the 1 has
zeros everywhere else.
leading
1 0 2 0
1
(
(
1 0 0
6
0 1 0 2
3
0 0 1
A
(
(
( =
(
(

The following augmented matrix are
reduced row echelon
all
f
in
orm:
4
0 1 3 0
2
0 0 0 1
0
0 0 0 0
B
(
(
=
(
(
(

(

1 4 0 3
0
0 0 1 2 0
0 0 0 0
1
C
(
(
( =
(
(

[ ]
[ ]
[ ]
1. Form the augmented matrix A| B
2.Obtain a | D from the
augmented matrix A| B by using
row echelon form
elementary
C
Gaussian elimination
method for solving AX=B
[ ]
[ ]
augmented matrix A| B by using

3. Solve the linear syste
elementar
m corresponding to | D
by
y
row operations.
back substitut & ion
C
ignore the rows consisting
entirely of zeros.
[ ]
[ ]
[ ]
1. Form the augmented matrix A| B
2.Obtain the | D from
the augmented matrix A| elementary B by using
C reduced row echelon form
Gauss Jordan elimination
method for solving AX=B
[ ]
[ ]
the augmented matrix A| elementary
row operations
B by using

3. Solve the linear system corresponding to | D
.
back su by bs
C
& ignore the rows consisting
entirely of
titu
zer
tion
os.
( )
( )
1. Find the first counting from left to right column
in augmented matrix not all of whose enteries are zero.
2. Identify the first counting from top to bottom
nonzero entry in that column
Procedure to find leading 1
nonzero entry in that column
3. Interchange the first row with the row where
the leading 1 if already occurs
otherwise use ERO to get the leading 1 at the nonzero entry,
so that the leading 1 is now in the firs
or
t row.
To obtain
1. first obtain leading 1 in first row as described,
then use this leading 1 to make zeros below it
echelon form:
Key point
then use this leading 1 to make zeros below it
in that column
2. Repeat the procedure, starting from top row
to the bottom row
To obtain
:
row reduced ech
from echelon f
elon f
orm
orm
Key point
Apply ERO's to make 0's above each leading 1,
starting from bottom rowto the top row
Using Gaussian elimination method,
solve the following linear system of equations
5 2 2 14 x x x + =

Problem(unique solution)
1 2 3
1 2 3
1 2 3
5 2 2 14
3 8
2 2 3
x x x
x x x
x x x
+ =

+ =
`
+ =
)
The augmented matrix for the given system is
2 2 14
1
2 2 14
5 5 5
5
(

(
(
(
Solution
1
2 2 14
5 5 5
3 1 1 8 3
1
1 1 8
2 2 1 2 2 1 3
5
3
5
R
(
(
(
(

(
(
(
(

(


1 2
2 2 14
1
3
2 2 14
1
5 5 5

1 1 2

5 5 5
3 1 1 8 0
5 5 2 5
R R
R R
(

(
(
(
(
(

(
(

(
(
+
+
1 3
6 1 13
0
5 5
3 1 1 8
2 2
0
5 5
3
5
1
2 5 R R

(
(
(
(

(
(

(

2
2 2 14
1
5
2 2
14
1
5 5
5
0 1 1 2
5 5
1 1 2
0 5R
(

(
(
(

(
(
(
(
(

2
0 1 1 2
6 1 1
0
5 5 5
6 1 13
0
3
0
5 5 5
5
5 5 5
R
(
(
(
(
(
(
(

2 3
2 2
1
2 2
14
1
5 5
5
0 1 1 2
4
1
5 5
5
6
0 1 1 2
5
R R
(

(
(
(

(
(

(
(
| |
(
+
|
\ (
2 3
0 1 1 2
6 1 13
0
5 5 5
0 1 1
0 0 1 5
2
5
R R
(

(
(
(
+
|
\ (
(
(

1 2 3
2 3
we have got the as
2 2
14 2 2 14
1
5 5
5 5 5 5
0 1 1 2 2
row echelon form
x x x
x x
(
+ =
(
(
(
=
(
2 3
3
3 2 1
0 1 1 2 2
5 5
0 0 1
by back substitution, we get
5, 3, 2
x x
x
x x x
(
=
(
=
(
(

= = =
Problem (zero row)
3 5
6 2 10
4 5 8
x y
x y
x y
+ =

=
`
+ =
)
1 5
1
3 1 5
3 3
1
(
(
(
(
(
Solution
1
3 3
1
6 2 10 6 2 10
3
4 5 8 4 5 8
R
(
(

(
(
(
(

(


1 2
1 1 5
1
3 3
5
1
3 3
6 R R
(
(
+
(
(
(
(

( )
1 2
1 3
0 0 6 2 10
6
0
4
11 44
0
3 3
4 5 8
R R
R R
+
(
(
(

(
(
(

+
(
(


1 5
1
3 3
11 44
0
1 5
1
3 3
0 0 0 R
(
(
(
(
(
(
(
(
23
11 44
0
3
0 0 0
11 44
0
0
3
0
3
0
3
R
(
(
(
(
(
(
(
(
(

2
1
5
1
3
3
3
0 1
0
4
11
0 0
1 5
1
3 3
11 44
0
3 3
0 0 0
R
(
(
(
| |
(
(
(
(
(
|
\ (
(
(

0
4
4, 3
1 5
3
0 0
0 0
3
0
y
y x
x y
(
(

=

= =
`
+ =
)
(
(
(


3 6 3 9 x x x + =

Problem (no solution)
1 2 4
1 2 3 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
+ =

+ + =
`
+ + =
)
3 6 0 3 9 1 2 0 1 3
(
(
(
Solution
1
3 6 0 3 9 1 2 0 1 3
2 4 2 1 11 2 4 2 1 11
4 8 6 7 5 4 8 6 7 5
1
R
3
(
(
(
(

(
(
(
(


( )
1 2
1 2 0 1 3
2 4 2 1 11
1 2 0 1 3
0 0 2 1 5
2R R
(
(

(
+
(
( )
1 3
2 4 2 1 11
4 8 6 7 5
0 0 2 1 5
0 0 6
4 +
3 17
R R

(

(
(

2
1 2 0 1 3
1 5
0 0 1
1 2 0 1 3
0 0 2 1 5
1
R
(
(
(
(
(
(
2
0 0 1
2 2
0 0 2 1 5
0 0 6
0 0 6 3 1
R
2
3 17
7
(
(
(
(
(

( )
3 2
1 2 0 1 3
1 5
0 0 1
2 2
0 0 0 0 2
1 2 0 1 3
1 5
0 0 1
2 2
0 0 6 3 1
6
7
R R
(
(
(
(
(
(
(
(
(
(

1 2 4
4 3
0 0 0 0 2
2 3
1 5
the sys
0 0 6 3 1
tem is inconsist
0
e t
2 2
2
n
7
x x x
x x
(

+ =
+ =

In the system,
the final augmented matrix will always contains
at least one row of the form
0 0 0 . . . 0 0 0 0
where
1) inconsistent
c 0
c
(

Remarks
where
If in the final augmented matrix, one row is 2)
c
of the form
0 0 0 . . . 0 0 0
0
0 0
then it does not imply the system is inconsitent.

(

Thanks
Thanks

L2

Uploaded by

Document Information

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

L2

Uploaded by

Copyright:

Available Formats

BITS Pilani, K K Birla Goa Campus

31/07/2012 32 Engineering Mathematics I (MATH ZC 161)

31/07/2012 46 Engineering Mathematics I (MATH ZC 161)

31/07/2012 47 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

31/07/2012 48 Engineering Mathematics I (MATH ZC 161)

31/07/2012 49 Engineering Mathematics I (MATH ZC 161)

31/07/2012 52 Engineering Mathematics I (MATH ZC 161)

31/07/2012 53 Engineering Mathematics I (MATH ZC 161)

31/07/2012 54 Engineering Mathematics I (MATH ZC 161)

31/07/2012 55 Engineering Mathematics I (MATH ZC 161)

31/07/2012 57 Engineering Mathematics I (MATH ZC 161)

31/07/2012 58 Engineering Mathematics I (MATH ZC 161)

BITS Pilani, K K Birla Goa Campus

then it does not imply the system is inconsitent.

You might also like