Unit I MSCS
Unit I MSCS
Computer Science
UNIT I
Matrices
– Introduction
– Determination
– Inverse of a matrix
– Rank of a Matrix
– Eigen value Problems
UNIT II
1 . Engineering Mathematics, Volume II, Dr M.K. Venkataraman, National Publishing Company, Chennai.
(Unit I)
2. Numerical Methods in Science & Engineering, M.K. Venkataraman, National Publishing Company,
Chennai, Revised Edition -2005 (Unit II & III)
3. Business Statistics, S.P. Gupta & M.P. Gupta, Sultan Chand and Sons (Unit IV & V)
UNIT I
Matrix
1.
2.
3.
are all matrices.
If a salesman has the following sales record during three months for three items A, B and C the same cr De
written in a matrix form as given below:
Jan. 90 100 20
Feb. 130 50 40
Mar 60 100 30
2.Importance
As matrix enables compact presentation and facilitates smooth manipulations, it is used in many fields of study. It is
convenient for computer operations also.
The common operations of
Addition
Multiplication
Transposition
A=
4. Order of matrix
In linear algebra, the order of a matrix refers to the number of rows and columns in the matrix. A matrix with
m rows and n columns is said to have an order of m x n.
For example, consider the following matrix:
A= 1 2 3
4 5 6
This matrix has 2 rows and 3 columns, so its order is 2 x 3
TYPES OF MATRICES
Square matrix: A square matrix is a matrix where the number of rows is equal to the number of columns.
For example,
A=
Unit or Identity matrix: An identity matrix is a diagonal matrix where all the diagonal elements are 1. For
example,
I=
Zero or Null matrix : If all the elements of a matrix are zeros,it is called zero or null matrix
3*3 matrix
TYPES OF MATRICES
Upper triangular matrix: An upper triangular matrix is a square matrix where all the elements below the
diagonal are zero. For example,
U=
Symmetric matrix: A symmetric matrix is a square matrix where the elements are symmetric across the
diagonal. For example,
S=
Eg 1 : if A = and B = , A= B
Eg 2: if A = and B= , A=B implies x=10 & y= 14
TYPES OF MATRICES
Equivalent matrices: Two matrices A and B of the same order are said to be
equivalent if one of them can be obtained from the other by elementary
transformations
A
TYPES OF MATRICES
Scalar matrix : A diagonal matrix in which all the elements in the diagonal are equal is called a scalar
matrix
TYPES OF MATRICES
Submatrix: A matrix obtained by deleting one or more rows or one or more columns (or both)
is a sub matrix of a given matrix
Eg: If A = , [9 10 15], and [41] are a sub matrices of A
TYPES OF MATRICES
Skew Symmetric matrix: A square matrix such that for all i and j is called a skew symmetric
matrix.
A’=-A
Matrix Operations
Addition
Subtraction
Scalar Multiplication
Multiplication
Transpose
Addition
Eg: If A = B =
A+B = B+A =
Subtraction
Eg : If A = and B =
A- B =
B-A =
A-B B-A
Scalar Multiplication
Eg: If A = (2 3 5) and B =
and
A = = coefficient matrix
X= = unknown vectors
C = = constant vectors
Determinants
Using the expansion by minors formula, we can choose the first row to expand the determinant:
det(A) = 1 * det([]) - 2 * det([]) + 3 * det([])
where each minor is a 2x2 matrix obtained by deleting the row and column containing the chosen element.
We can calculate the determinants of these minors as follows:
det() = 5*9 - 6*8 = 3
det() = 4*9 - 6*7 = -6
det() = 4*8 - 5*7 = -3
Substituting these values back into the expansion formula, we get:
det(A) = 1 * 3 - 2 * (-6) + 3 * (-3) = 0
Eg 2
𝑎 𝑏
=𝑎𝑑 − 𝑏𝑐
𝑐 𝑑
Minor and Cofactor
Depending on the position of an element, the minor itself is the cofactor or the
minor with change in sign is the cofactor
Take 2*2 matrix
Eg :
= =
= =
= =
= =
SIMILARLY, TAKE 3*3 MATRIX
𝑎1 𝑏1 𝑐1
𝑎2 𝑏2 𝑐2
𝑎3 𝑏3 𝑐3
Eg : find the minor & cofactor of all
the elements of
Solution:
3 0 0
2 5 -5
5 2 -2
0 3 3
Eg :
A-1 = (Adj A)
Where adj(A) is the classical adjoint of A, which is obtained by taking the transpose of the
matrix of cofactors of A.
cof(A) =
adj(A) =
A-1 = ( )*
=
Therefore, the inverse of A is:
A-1 =
METHOD I
Example 1
Find the inverse of
Solution
Let A=
Therefore, |A| = ad – bc
= , adj A =
:
= adj A
Example 2
Let A =
Therefore, =
Elements Minors Cofactors
1 =2 2
3 =6 -6
0 =4 4
0 =-21 21
4 =-7 -7
-6 =8 -8
-1 =-18 -18
5 =-6 6
-7 =4 4
Therefore, adj A =
50
I
I
*
=
Rank of a Matrix :
To find the rank of this matrix, we can perform row operations to reduce it to row echelon form, and count the number
of non-zero rows.
Performing row operations, we can transform the matrix A into row echelon form :
Since there are two non-zero rows in this matrix, the rank of A
is 2.
Therefore, the rank of the matrix A is 2.
METHOD 1
Example 1.1
Let A=
Order of A is 2 × 2 ∴ ρ(A)≤ 2
= 15 -8 =7
Let A =
Find |A| = 1 -2 +
= (24-25)-2(12-15)+3(10-12)
= -1+6-6
= -1
Therefore rank is 3
∴ρ (A) = 3
METHOD II
Eg 1
AX =C
4x+ 3y+2z+7=0
2x+y-4z+1=0
x-7y-2 = 0
EIGEN VALUES AND
EIGEN VECTORS
EIGEN VALUES
• EIGEN VALUES ARE THE SPECIAL SET OF
SCALAR VALUES THAT IS ASSOCIATED WITH
THE SET OF LINEAR EQUATIONS MOST
PROBABLY IN THE MATRIX EQUATIONS.
• FORMULA |A-
Eigen vectors
• EIGEN VECTORS ARE ALSO TERMED AS
CHARACTERISTIC ROOTS . IT IS A NON – ZERO
VECTOR THAT CAN BE CHANGED AT MOST BY ITS
SCALAR FACTORS AFTER THE APPLICATIONS OF
THE LINEAR TRANSFORMATION
• FORMULA (A- )X=0
Problem 1
= + +
-5 6= 0
-2 6= 0
(-2) – 3(-2)=0
(-2) (-3) =0
Eigen values are = 1,2,3
Eigen vectors
(a-
A=
A- =
(A- )x = 0
=0
For eigen value
=0
=0
+ =0
=0
+ =0
=-
Let = 1 so, = -1
= 1, = 0 , = -1
Eigen value
=
For eigen value
=0
=0
=0
= 0 let = 1
= 0, = 1 , = 0
Eigen value
=
For eigen value
=0
=0
- + = 0 - = 0 - = - = Let = 1 so, = 1
-=0 =0
= 1, = 0 , = -1
Eigen value
=