MATHEMATICS II
MATH F112
Department of Mathematics
BITS Pilani K K Birla Goa Campus
Team of Instructors
Dr.Anushaya Mohapatra(I/C)
Dr. Pradeep Boggarapu
Prof. Danumjaya Palla
Prof. Tarkeshwar Singh
Dr. Anil Kumar
Dr. Jajati Keshari Sahoo
Dr. Himadri Mukherjee
Dr. Amit Setia,
Dr. Manoj Kumar Pandey
Dr. Miza Rahaman
Text Book
Elementary Linear Algebra with Supplemental
Applications
by Howard Anton and Chris Rorres,
Wiley & Sons, 11th Ed., 2017
Other Interesting Books
• Gilbert Strang, Linear Algebra and its
Applications.
• B. Kolman and D. R. Hill, Introductory Linear
Algebra, An Applied First Course.
• K. Hoffman and R. Kunge, Linear Algebra
Evaluation Components
Component Duration Marks Remarks
Mid-Sem. 1 hour 90 Closed Book
Exam 30 min.
45 Min 90
Announced Open Book
Quizzes
120 Closed Book
Comprehensive 3 hours
Exam
Instructor 10
About the Course
Linear Algebra
Complex Analysis (theory of complex
valued functions)
Linear Algebra
Solving system of linear equations
Gaussian Elimination
Elementary Matrices and method of finding
inverse
Vector Spaces
Linear Transformations
Eigenvalues and Eigenfunctions
Complex Variables
Functions of complex variables
Limit, Continuity, Differentiability.
Analytic functions
Elementary Functions
Integrations
Power Series and its extension
Applications of Complex valued functions
Evaluating improper integrals
I/C Instructions
Follow the course page in LMS regularly for
any updates (particularly for the course handout).
New text book.
Chamber Consultation Hours (section 10-13)
Chamber Number – CC102
Thursday- 4:30 PM – 6:30 PM
Introduction to Linear Algebra
Linear Algebra has become as basic and as applicable as calculus
and fortunately it is easier - Gilbert Strang, MIT
System of Linear Equations
Let us consider a system of linear equations
x y 2
2x 3y 5
Let us take the following questions.
What is a solution ?
How to solve?
How these system of equations appear in
applications?
Systems of Linear Equations
Graphing a system of two linear equations in two
unknowns gives one of three possible situations:
Case 1: Lines intersecting in a
single point. The ordered pair that
represents this point is the unique
solution for the system.
Systems of Linear Equations
Case 2: Lines that are distinct parallel lines
and therefore don’t intersect at all. Because
the lines have no common points, this
means that the system has no solutions.
Systems of Linear Equations
Case 3: Two lines that are the same
line. The lines have an infinite number
of points in common, so the system
will have an infinite number of
solutions.
Elementary Row Operations (ERO)
Elementary row operations on an m x n matrix A:
Interchange rows of A
Multiply a row by a non-zero constant
Add a constant times row r to row s.
Solving Linear System
Let us consider the linear system:
a11x1 a12 x2 a1n xn b1
a21x1 a22 x2 a2 n xn b2
am1 x1 am 2 x2 am n xn bm1
We can abbreviate the system by writing only the
rectangular array of numbers
a11 a1n b1
a a2 n
b2
21 [ A | b]
am1 am n bm
This is called the augmented matrix for the
system.
Example
Let us consider the linear system:
x2 4 x3 8
2 x1 3x2 2 x3 1
5 x1 8 x2 7 x3 1
The augmented 0 1 4 8
matrix is 2 3 2 1
5 8 7 1
Elementary Row Operations (ERO)
Symbol Description
Change the ith row by adding
Ri→ Ri + kRj k times row j to it.
Then, put the result back in row i.
Ri→kRi Multiply the ith row by k.
Ri ↔ Rj Interchange the ith and jth rows.
Solving Linear System
Solve the system using Elementary Row operations:
x 2 y 3z 6
2 x 3 y 2 z 14
3 x y z 2
Ans: x =1, y = -2, z = 3
Problem
Solve:
x y 2z 9
2 x 4 y 3z 1
3x 6 y 5 z 0
Ans: x =1, y = 2, z = 3
Row Echelon and Reduced Row Echelon Form
An m x n matrix A is said to be in row echelon form if it
satisfies the following properties:
1. The first nonzero number in each row (reading from
left to right) is 1. This is called the leading entry
(leading 1).
2. The leading entry in each row is to the right of
the leading entry in the row immediately above it.
3. All rows consisting entirely of zeros are at
the bottom of the matrix.
Row Echelon and Reduced Row Echelon Form
A matrix is in reduced row echelon form if it is in row
echelon form and also satisfies the following condition:
4. Every column that contains a leading 1 has
zeros everywhere else in that column.
Examples:
Row-Echelon Form Reduced
Row-Echelon Form
1 3 6 10 0 1 3 0 0 0
0 0 1 4 3 0 0 1 0 3
0 0 0 1 1
2
0 0 0 1 1
2
0 0 0 0 0 0 0 0 0 0
Leading 1's shift to Leading 1's have
the right in 0's above and
successive rows. below them.
Problems
Check whether the following matrices are in row
echelon form or in reduced row echelon form:
1 4 3 7 0 1 2 6 0
(i ) 0 1 6 2 (ii ) 0 0 1 1 0
0 0 1 5 0 0 0 0 1
0 1 2 0 1
0 0 0 1 3
(iii )
0 0 0 0 0
0 0 0 0 0
Definition
An m x n matrix A is said to be row equivalent to
an m x n matrix B if B can be obtained by applying
a finite sequence of elementary row operations to
the matrix A.
Theorem
Let AX=b and CX=d be two linear systems each of
m equations in n unknowns. If the augmented
matrices [A|b] and [C|d] of these systems are row
equivalent, then both linear systems have exactly
the same solutions .
Methods of Solving Linear Systems
The results established provide us with two
methods for solving linear systems:
Gauss Elimination Method (based on row echelon
form)
Gauss-Jordan Elimination Method (based on
reduced row echelon form)
Example
Solve the linear system
x 2 y 3z 9
2x y z 8
3x z 3
by
(i) Gauss Elimination Method
(ii) Gauss-Jordan Elimination Method
Problems
Solve the linear system of equations by using both Gauss
Elimination and Gauss-Jordan Elimination methods
(i) x y 2 z 5w 3 (ii ) x 2 y 3z 4w 5
2 x 5 y z 9w 3 x 3 y 5 z 7 w 11
2 x y z 3w 11 x z 2w 6
x 3 y 2 z 7 w 5
Linear Systems
Let us consider the linear system AX=b:
(a) The linear system is said to be consistent if it has at
least one solution.
(b) The linear system with no solution is said to be
inconsistent system.
Homogeneous Linear Systems
The linear system AX=0 is said to be homogeneous
system. A homogeneous system is always consistent (??).
Solve the homogeneous system by Gauss elimination
method
x yzw0
x w0
x 2y z 0
Rank of a Matrix
Let A be an m x n matrix, then the rank of A, denoted by
rank(A), is equal to the number of non-zero rows in its
reduced row echelon form.
Problems
Find the ranks of the following matrices:
1 1 2 5
1 3 2 5 1 9
2
(i ) A 2 1 1 (ii ) B
2 1 1 3
3 0 1
1 3 2 7
1 2 3 4
(iii ) C 1 3 5 7
1 0 1 2
Important Result
Let AX=b be a linear system with m equations and n
unknowns then :
(a) The linear system is consistent if rank(A) = rank(A|b).
It has unique solution is rank(A) = rank(A|b)=n.
It has infinitely many solutions if rank(A) =
rank(A|b) < n.
(b) The linear system is inconsistent if rank(A) is not
equal to rank(A|b).
Example
For what values of a the linear system
x 2 y 3z 4
3x y 5 z 2
4 x y (a 2 14) z a 2
has
(a) Unique solution
(b) Infinitely many solutions
(c) No solution.
Example
For what values of a the linear system
x 2 y 3z 4
3x y 5 z 2
4 x y (a 2 14) z a 2
has
(a) Unique solution
(b) Infinitely many solutions
(c) No solution.
Problems
(1) Solve the following linear systems using both Gauss
elimination and Gauss-Jordan elimination methods:
(i ) x y z 1 (ii ) x y 2 z 3w 13
x y 2z 3 x 2y z w 8
2x y z 2 3x y z w 1
Problems
(2) Find an equation relating a, b and c so that the linear
system :
x 2 y 3z a
2 x 3 y 3z b
5x 9 y 6 z c
is consistent for any values of a, b and c that satisfy that
equation.
Ans: -3a-b+c=0
