Module 1 Part 1
Module 1 Part 1
Department of Mathematics
School of CS and AI
SR University
Detailed Syllabus
Module I
Matrices and Linear Equations
• Vector Space over R and Subspaces, Module II
• Null space and Column space, Numerical Methods
• Linear dependence-independence, • Algebraic and Transcendental Equations
• Span-Basis-dimensions, • Bisection Method
• Types of Matrices, • Newton Raphson Method
• Matrix operations, • Finite Differences,
• System of linear equations, • Relations between the operators ,
• Gauss elimination method, • Newton’s Forward and Backward
• Rank, Inverse Matrices, Interpolation
• Properties of Determinants, • Lagrange’s Interpolation Formula.
• Linear transformations, • Numerical Integration – Trapezoidal Rule –
• Matrix representation of a linear transformation, Simpson’s 1/3 Rule – Simpson’s 3/8 Rule
• Change of basis, • Numerical Solutions of ODE – Euler’s
• Eigenvalues and Eigenvectors, Method and Euler’s Modified Method –
• Characteristic polynomials, Runge - Kutta 4th order Method.
• Cayley-Hamilton theorem – applications.
Vectors
In matrix algebra, there are two kinds of matrix multiplication: multiplication of a matrix by a
number and multiplication of a matrix by another matrix.
Scalar Multiplication
When you multiply a matrix by a number, you multiply every element in the matrix by the same
number. This operation produces a new matrix, which is called a scalar multiple.
Ex: =
Product of Matrices
The matrix product AB is defined only when the number of columns in A is equal to the number
of rows in B. Similarly, the matrix product BA is defined only when the number of columns in B
is equal to the number of rows in A.
Example
Elementary Row Operations
• Addition/Subtraction of any row to/from any row (𝑒. 𝑔., 𝑅𝑖 replaced with 𝑅𝑖 ± 2𝑅𝑗 )
A matrix is in reduced row echelon form when it satisfies the following conditions.
• The matrix satisfies conditions for a row echelon form.
• The leading entry (pivot) in each row is only 1.
• The leading entry in each row is the only non-zero entry in its column.
System of Linear Equations
• Step 3: Convert the augmented matrix (A|B) to its row echelon form.
1 −3 −2 6 𝟑
⇒ Consider the augmented matrix 2 −4 −3 8 𝑹𝟐 → 𝑹𝟐 − 𝟐𝑹𝟏 ; 𝑹𝟑 → 𝑹𝟑 + 𝟑𝑹𝟏 ; 𝑹𝟑 → 𝑹𝟑 + 𝑹
𝟐 𝟐
−3 6 8 −5
1 −3 −2 6
⇒ Converting the augmented matrix to row echelon form (using row operations): 0 2 1 −4
7
0 0 7
2
7
⇒ Do Backward Calculation: 𝑧 = 7 ⇒ 𝑧 = 2, 2𝑦 + 𝑧 = −4 ⇒ 𝑦 = −3, 𝑥 − 3𝑦 − 2𝑧 = 6 ⇒ 𝑥 = 1
2
Hence, solution is 𝒙 = 𝟏, 𝒚 = −𝟑, 𝒛 = 𝟐.
Practice Problems
1.
𝑥 + 2𝑦 − 𝑧 = −1
2𝑥 + 2𝑦 + 𝑧 = 1
3 𝑥 + 5𝑦 − 2𝑧 = −1.
2.
𝑥−4𝑦−𝑧+𝑤 = 3
2𝑥 − 8𝑦 + 𝑧 − 4𝑤 = 9
−𝑥 + 4𝑦 − 2𝑧 + 5𝑤 = −6
Inverse of Matrix
Properties:
• An invertible matrix has a unique inverse.
• 𝐴−1 −1
=𝐴
• 𝐴𝐵 −1 = 𝐵−1 𝐴−1
• 𝐴𝑡 −1 = 𝐴−1 𝑡
How to Find Inverse of Matrix?
Gauss-Jordan Method:
Gauss-Jordan Method:
1 0 1
0 , 1 , 1 ⇒ Linearly Dependent.
0 0 0
Rank of a Matrix
Definition:
The rank of a matrix is defined as:
i) the maximum number of linearly independent column vectors in
the matrix
or
ii) the maximum number of linearly independent row vectors in the
matrix. Both definitions are equivalent.
For an 𝑚 × 𝑛 matrix:
▪ If 𝑚 is less than 𝑛, then the maximum rank of the matrix is 𝑚.
▪ If 𝑚 is greater than 𝑛, then the maximum rank of the matrix is 𝑛.
Properties of Rank
Notes:
i) The rank of a matrix is always unique.
ii) The rank of a zero matrix is always zero.
iii) The rank of a non-singular matrix of order 𝑛 is 𝑛.
iv) The rank of a singular matrix of order 𝑛 is < 𝑛.
v) The rank of a unit/identity matrix of order 𝑛 is 𝑛.
vi) If 𝑨 is a matrix of order 𝑚 × 𝑛, then 𝑟𝑎𝑛𝑘(𝐴) ≤ min(𝑚, 𝑛).
vii) rank(𝐴)= rank(𝐴𝑡 ).
How to Find Rank of a Matrix?
First interchange 𝑹𝟏 and 𝑹𝟐 . Next apply the operations ‘‘Replace 𝑹𝟐 by 𝑹𝟐 + 𝟒𝑹𝟏 ’’ and
‘‘Replace 𝑹𝟑 𝒃𝒚 𝑹𝟑 − 𝟔𝑹𝟏 ’’; and then apply the operation ‘‘Replace 𝑹𝟑 by 𝑹𝟑 + 𝑹𝟐 .’’
These operations yield
You can check that the number of non-zero rows in the echelon form of B is two. Hence the
rank of B is 2.
Practice Problems
1. 2.
3.
Working rule for finding the solutions of 𝐴𝑥 = 𝐵
Show that the following system is consistent and has a unique solution:
x + 2y + z = 3
x + 3y + z = 5
3x + 8y + 4z = 17
Ans: Reduce the augmented matrix (M) to echelon form (using the row operations 𝑹𝟐 → 𝑹𝟐 − 𝑹𝟏 ,
𝑹𝟑 → 𝑹𝟑 − 𝟑𝑹𝟏 , 𝑹𝟑 → 𝑹𝟑 − 𝟐𝑹𝟐 ) as follows:
Show that the following system is consistent and has infinite number of solutions:
x + y + 3z = 1
2x + 3y − z = 3
5x + 7y + z = 7
Ans: Reduce the augmented matrix (M) to echelon form (using the row operations
𝑹𝟐 → 𝑹𝟐 − 𝟐𝑹𝟏 , 𝑹𝟑 → 𝑹𝟑 − 𝟓𝑹𝟏 , 𝑹𝟑 → 𝑹𝟑 − 𝟐𝑹𝟐 ) as follows:
1 1 3 1
~ 0 1 −7 1
0 0 0 0
𝑥 + 2𝑦 + 3𝑧 = 4
𝑥 + 3𝑦 + 4𝑧 = 5
𝑥 + 3𝑦 + 𝑎𝑧 = 𝑏
will have (i) No solution (ii) Unique solution (iii) Infinite number of solutions?