MTH165

Mathematics for Engineers

#Zero Lecture
Books Required
Text Book:
ADVANCED ENGINEERING MATHEMATICS BY JAIN AND IYENGAR

References Books:
MATHEMATICS FOR CLASS 12 PART 1-2 BY NCERT

HIGHER ENGINERING MATHEMATICS BY B.S GREWAL

Course Assessment Model
Teaching Model:
L-T-P: 3-1-0 (3 Lectures, 1 Tutorial, 0 Practical)
Marks Breakup:
Attendance 5
CA (2 best out of 3 online Tests) 30
MTE (MCQ/Viva based) 25
ETE (MCQ) 40
Total 100
 Course Outcomes
Through this course students should be able to
1. Recall the concepts of matrices and its application to solve the system
of linear equations.
2. Review the basic concept of calculus of one variable.
3. Apply the concept of calculus to evaluate extreme values of functions.
4. Describe calculus of multivariate functions and their applications.
5. Evaluate surface and volume integral using multiple integral.
6. Describe the concept of Fourier series and its application.
 Syllabus Distribution:
Unit-1
Linear Algebra
• Review of matrices
• Elementary operations of matrices
• Rank of a matrix
• Linear dependence and independence of vectors
• Solution of Linear system of equations
• Inverse of matrices
• Eigen values and Eigen vectors
• Properties of Eigen values
• Cayley-Hamilton theorem
 Unit-2
Differential and Integral
Calculus • Integration as an inverse process of
differentiation
• Differential coefficient
• Methods of integration-By
• General rules of differentiation Substitution
• Derivatives of standard functions • Methods of integration-By Parts
• Derivatives of Parametric forms • Methods of integration-By Partial
• Derivatives of implicit functions fractions
• Logarithmic differentiation • Definite integral as Limit of sum
• Properties of definite integral
 Unit-3
Applications of Derivatives
• Rolles’ Theorem
• Mean Value Theorems
• Taylors’ theorem with remainders
• Maclaurins’ theorem with remainders
• Indeterminate Forms
• L-Hospital rule
• Maxima and Minima
 Unit-4
Multivariate Functions

• Functions of two variables

• Limits and Continuity
• Partial derivatives
• Total derivative and differentiability
• Chain rule
• Euler’s theorem for Homogeneous functions
• Maxima and Minima
• Lagrange method of multiplier
 Unit-5
Multivariate Integrals

• Double integrals
• Change of order of integration
• Triple integrals
• Change of variables
• Application of double integrals to calculate area and volume
• Application of triple integrals to calculate volume
 Unit-6
Fourier Series

• Euler Coefficients
• Fourier Series
• Fourier Series for Even and Odd functions
• Half range Fourier Series
• Parseval’s Formula
• Complex form of Fourier Series
What Do You Think?
What could be considered the greatest achievements of the
human mind ?
It's the Greatest!
• Consider that all these things emerged because of technological
advances
• Those advances relied on CALCULUS !
• Calculus has made it possible to:
• Build giant bridges
• Travel to the moon
• Predict patterns of population change
Use of Matrices:
The key matrix is used to encrypt the messages, and its
inverse is used to decrypt the encoded messages. It is
important that the key matrix be kept secret between the
message senders and intended recipients. If the
key matrix or its inverse is discovered, then all
intercepted messages can be easily decoded.

In Geology, Matrices are used for taking seismic surveys.

They are used for plotting graphs, statistics and also to do
scientific studies in almost different fields. ... Matrices are
used in calculating the Gross domestic products in
economics which eventually helps in calculating the goods
production efficiently.

Application of Homogeneous Transformation Matrices to

the Simulation of VLP Systems. In robotics, Homogeneous
Transformation Matrices (HTM) have been used as a tool
for describing both the position and orientation of an object
and, in particular, of a robot or a robot component
You might have observed in use of matrices in routine:

Grid of Computer Screen

Online Booking of Cinema Hall

You might have observed in use of matrices in routine:

Republic Day Parade

Matrix Movie
Uses of Matrices in Various Fields:
Encryption
Games especially 3D
Economics and business
Construction
Dance – contra dance
Animation
Physics
Geology
Uses of Calculus:
Sir Isaac Newton used calculus to solve many physics problems such as
the problem of planetary motion, shape of the surface of a rotating fluid
etc. – recorded in Principia Mathematica
Uses of Calculus:
Gottfried Leibniz developed calculus to find area under curves
Rate of change is everywhere….
Rate of change is everywhere….
Rate of change is everywhere….
Differentiation and Integration are Inverse of each other…
Differentiation and Integration are Inverse of each other…
Differentiation and Integration are Inverse of each other…

Differentiation Integration
Derivatives are used to determine the maximum and minimum values of
the functions like cost, strength, amount of material used in a building,
profit loss etc.
The best example of use of chain rule in differentiation, is the working
of pulleys of different sizes with same belt to reduce the effort and
optimize the output.
Calculus and Electronics Engineering
The various kinds of LCR circuits can not be solved without differential
equations and Ohm’s law which is dependent on derivative of voltage.
Development of different kinds of computer languages such as C, C++,
Java, Linux, Python and development of various mobile apps has a great
reliance on Calculus.
Multivariate Calculus
Multivariate Calculus
Major Contributors are:

Leibnitz

Lagrange
Multivariate Calculus
Major Contributors are:

Newton

Leonhard Euler
Difference:
Single variable calculus Multivariable Calculus
𝑦 = 𝑥2 𝑧 = 𝑥2 + 𝑦2
Uses of Multivariate Calculus:

Maxima and Minima

Area under curve

Volume
Uses of Fourier Series:

In Signal Processing

In Image Processing
 Matrices - Introduction
Matrix algebra has at least two advantages:
•Reduces complicated systems of equations to simple
expressions
•Adaptable to systematic method of mathematical treatment
and well suited to computers

Definition:
A matrix is a set or group of numbers arranged in a square or
rectangular array enclosed by two brackets

 4 2 a b 
1  1  3 0 c d 
   
 Matrices - Introduction
Properties:
•A specified number of rows and a specified number of
columns
•Two numbers (rows x columns) describe the dimensions
or size of the matrix.

Examples:
3x3 matrix 1 2 4 
2x4 matrix
4  1 5 1 1
  
3  3
 1  1
1x2 matrix 3 3 3 0 0 3 2 
 Matrices - Introduction
A matrix is denoted by a bold capital letter and the elements
within the matrix are denoted by lower case letters
e.g. matrix [A] with elements aij

 a11 a12 ... aij ain 

a 
Amxn=

mA
n
 21 a22 ... aij a2 n 
     
 
am1 am 2 aij amn 
i goes from 1 to m
j goes from 1 to n
MCQ
MCQ
 Matrices - Introduction
TYPES OF MATRICES

1. Column matrix or vector:

The number of rows may be any integer but the number of
columns is always 1

1   a11 
4 1  a21 
   3  
 2     
 am1 
 Matrices - Introduction
TYPES OF MATRICES

2. Row matrix or vector

Any number of columns but only one row

1 1 6 0 3 5 2

a11 a12 a13  a1n 

 Matrices - Introduction
TYPES OF MATRICES

3. Rectangular matrix
Contains more than one element and number of rows is not
equal to the number of columns

1 1 
3 7  1 1 1 0 0 
   2 0 3 3 0
7  7   
 
7 6 
mn
 Matrices - Introduction
TYPES OF MATRICES
4. Square matrix
The number of rows is equal to the number of columns
(a square matrix A has an order of m)
mxm

1 1 1 1 1 
9 9 0 
3 0  
  6 6 1
The principal or main diagonal of a square matrix is composed of all
elements aij for which i=j
 Matrices - Introduction
TYPES OF MATRICES

5. Diagonal matrix
A square matrix where all the elements are zero except those on
the main diagonal
3 0 0 0
1 0 0  0 
3 0 0
0 2 0  
  0 0 5 0
0 0 1  
0 0 0 9
i.e. aij =0 for all i = j
aij = 0 for some or all i = j
 Matrices - Introduction
TYPES OF MATRICES

6. Unit or Identity matrix - I

A diagonal matrix with ones on the main diagonal

1 0 0 0
0 
 1 0 0 1 0 aij 0
0 0 1 0 0 1  0 
   aij 
 
0 0 0 1
i.e. aij =0 for all i = j
aij = 1 for some or all i = j
 Matrices - Introduction
TYPES OF MATRICES

7. Null (zero) matrix - 0

All elements in the matrix are zero

0  0 0 0 
0  0 0 0 
   
0 
0 0 0

aij  0 For all i,j

 Matrices - Introduction
TYPES OF MATRICES

8. Triangular matrix
A square matrix whose elements above or below the main
diagonal are all zero

1 0 0  1 0 0  1 8 9 
2 1 0 2 1 0 0 1 6 
     
5 2 3 5 2 3 0 0 3
 Matrices - Introduction
TYPES OF MATRICES

8a. Upper triangular matrix

A square matrix whose elements below the main
diagonal are all zero
1 7 4 4
aij aij aij  1 8 7  0 
  0 1 8   1 7 4
0 aij aij 
  0
0 0 7 8
 0 aij  0 0 3  
0 0 0 3
i.e. aij = 0 for all i > j
 Matrices - Introduction
TYPES OF MATRICES

8b. Lower triangular matrix

A square matrix whose elements above the main diagonal are all
zero

aij 0 0 1 0 0 
  2 1 0
aij aij 0
 
aij aij aij  5 2 3

i.e. aij = 0 for all i < j
 Matrices – Introduction
TYPES OF MATRICES
9. Scalar matrix
A diagonal matrix whose main diagonal elements are
equal to the same scalar
A scalar is defined as a single number or constant

aij 0 0 1 0 0  6 0 0 0
  0 1 0  0 
0 aij 0    6 0 0
0 aij  0 0 1
 0 0 0 6 0
 
i.e. aij = 0 for all i = j 0 0 0 6
aij = a for all i = j
MCQ
MCQ
 Matrices - Operations
EQUALITY OF MATRICES
Two matrices are said to be equal only when all corresponding
elements are equal Therefore their size or dimensions are equal as
well

1 0 0  1 0 0 
A= 2 1 0 B= 2 1 0 A=B
   
5 2 3 5 2 3
 Matrices - Operations
Some properties of equality:

•If A = B, then B = A for all A and B

•If A = B, and B = C, then A = C for all A, B and C

1 0 0  b11 b12 b13 

A= 2 1 0 B=
b b b23 
   21 22

5 2 3 b31 b32 b33 

If A = B then aij  bij

 Matrices - Operations
ADDITION AND SUBTRACTION OF MATRICES

The sum or difference of two matrices, A and B of the same

size yields a matrix C of the same size

cij  aij  bij

Matrices of different sizes cannot be added or subtracted
 Matrices - Operations
Commutative Law:

A+B=B+A

Associative Law:

A + (B + C) = (A + B) + C = A + B + C

7 3  1  1 5 6  8 8 5
2  5 6    4  2 3   2  7 9
     
A B C
2x3 2x3 2x3
 Matrices - Operations
A+0=0+A=A
A + (-A) = 0 (where –A is the matrix composed of –aij as elements)

6 4 2 1 2 0 5 2 2 
3 2 7  1 0 8  2 2  1
     
 Matrices - Operations
SCALAR MULTIPLICATION OF MATRICES

Matrices can be multiplied by a scalar (constant or single

element)
Let k be a scalar quantity; then
kA = Ak

Ex. If k=4 and

 3  1
2 1 
A 
2  3
 
4 1 
 Matrices - Operations
 3  1  3  1  12  4 
2 1  2 1  8 4 
4   4   
2  3 2  3  8  12
     
4 1  4 1  16 4 

Properties:
• k (A + B) = kA + kB
• (k + g)A = kA + gA
• k(AB) = (kA)B = A(k)B
• k(gA) = (kg)A
 Matrices - Operations
MULTIPLICATION OF MATRICES

The product of two matrices is another matrix

Two matrices A and B must be conformable for multiplication to
be possible
i.e. the number of columns of A must equal the number of rows
of B
Example.
A x B = C
(1x3) (3x1) (1x1)
 Matrices - Operations
B x A = Not possible!
(2x1) (4x2)

A x B = Not possible!
(6x2) (6x3)

Example
A x B = C
(2x3) (3x2) (2x2)
 Matrices - Operations
b11 b12 
 a11 a12 a13     c11 c12 
a   b21 b22    
 21 a22 a23 
b31 b32   c21 c22 

(a11  b11 )  (a12  b21 )  (a13  b31 )  c11

(a11  b12 )  (a12  b22 )  (a13  b32 )  c12
(a21  b11 )  (a22  b21 )  (a23  b31 )  c21
(a21  b12 )  (a22  b22 )  (a23  b32 )  c22

Successive multiplication of row i of A with column j of

B – row by column multiplication
 Matrices - Operations
4 8 
1 2 3     (1 4)  (2  6)  (3  5) (1 8)  (2  2)  (3  3) 
4 2 7 6 2  (4  4)  (2  6)  (7  5) (4  8)  (2  2)  (7  3)
  5 3  
 

31 21
 
63 57

Remember also:
IA = A

1 0 31 21 31 21

0 1 63 57  
    63 57
MCQ
 Matrices - Operations
Assuming that matrices A, B and C are conformable for
the operations indicated, the following are true:
1. AI = IA = A
2. A(BC) = (AB)C = ABC - (associative law)
3. A(B+C) = AB + AC - (first distributive law)
4. (A+B)C = AC + BC - (second distributive law)
Caution!
1. AB not generally equal to BA, BA may not be conformable
2. If AB = 0, neither A nor B necessarily = 0
3. If AB = AC, B not necessarily = C
 Matrices - Operations
AB not generally equal to BA, BA may not be conformable

1 2
T  
 5 0 
3 4
S 
 0 2 
1 2 3 4  3 8
TS       
5 0 0 2 15 20
3 4 1 2 23 6
ST       
0 2 5 0 10 0
 Matrices - Operations
If AB = 0, neither A nor B necessarily = 0

1 1  2 3  0 0
0 0  2  3  0 0
    
 Matrices - Operations
TRANSPOSE OF A MATRIX

If :
2 4 7 
A 2 A  3

2x3 5 3 1 
Then transpose of A, denoted AT is:

 2 5
A 2 A
T 3T
 4 3
7 1

aij  a T
ji For all i and j
 Matrices - Operations
To transpose:
Interchange rows and columns
The dimensions of AT are the reverse of the dimensions of A

2 4 7 
A 2 A  
3
 2x3
5 3 1 
 2 5
A 3 A
T T2
 4 3 3x2
7 1
 Matrices - Operations
Properties of transposed matrices:
1. (A+B)T = AT + BT
2. (AB)T = BT AT
3. (kA)T = kAT
4. (AT)T = A
 Matrices - Operations
1. (A+B)T = AT + BT

7 3  1  1 5 6  8 8 5 8  2
2  5 6    4  2 3   2  7 9 8  7 
       
5 9 

7 2  1  4 8  2
 3  5  5  2  8  7 
     
 1 6  6 3  5 9 
 Matrices - Operations
(AB)T = BT AT

1 
1 1 0   2
0 2 3 1   8   2 8
   2  
 
1 0
1 1 21 2  2 8
0 3
 Matrices - Operations
SYMMETRIC MATRICES
A Square matrix is symmetric if it is equal to its
transpose:
A = AT

a b 
A 
b d 
a b 
A 
T

 b d 
SKEW SYMMETRIC MATRICES
A Square matrix is skew symmetric if it is equal
to negative of its transpose:
A = AT
MCQ
MCQ
 Matrices - Operations
INVERSE OF A MATRIX
Consider a scalar k. The inverse is the reciprocal or division of 1
by the scalar.
Example:
k=7 the inverse of k or k-1 = 1/k = 1/7
Division of matrices is not defined since there may be AB = AC
while B = C
Instead matrix inversion is used.
The inverse of a square matrix, A, if it exists, is the unique matrix
A-1 where:
AA-1 = A-1 A = I
 Matrices - Operations
Example:
3 1
A 2 A  
2

2 1
1 1  1
A  
 2 3
Because:
 1  1 3 1 1 0
 2 3  2 1  0 1
   
3 1  1  1 1 0
2 1  2 3   0 1
   
 Matrices - Operations
Properties of the inverse:

( AB ) 1  B 1 A1
1 1
(A )  A
( AT ) 1  ( A1 )T
1 1
1
(kA)  A
k
A square matrix that has an inverse is called a nonsingular matrix
A matrix that does not have an inverse is called a singular matrix
Square matrices have inverses except when the determinant is zero
When the determinant of a matrix is zero the matrix is singular
 Matrices - Operations
DETERMINANT OF A MATRIX

To compute the inverse of a matrix, the determinant is required

Each square matrix A has a unit scalar value called the
determinant of A, denoted by det A or |A|

1 2
If A 
 6 5 
1 2
then A
6 5
 Matrices - Operations
If A = [A] is a single element (1x1), then the determinant is
defined as the value of the element
Then |A| =det A = a11
If A is (n x n), its determinant may be defined in terms of order
(n-1) or less.
 Matrices - Operations
MINORS
If A is an n x n matrix and one row and one column are deleted,
the resulting matrix is an (n-1) x (n-1) submatrix of A.
The determinant of such a submatrix is called a minor of A and
is designated by mij , where i and j correspond to the deleted
row and column, respectively.
mij is the minor of the element aij in A.
 Matrices - Operations
eg.
 a11 a12 a13 

A  a21 a22 a23 
 a31 a32 a33 
Each element in A has a minor
Delete first row and column from A .
The determinant of the remaining 2 x 2 submatrix is the minor
of a11
a22 a23
m11 
a32 a33
 Matrices - Operations
Therefore the minor of a12 is:

a21 a23
m12 
a31 a33
And the minor for a13 is:

a21 a22
m13 
a31 a32
 Matrices - Operations
COFACTORS

The cofactor Cij of an element aij is defined as:

i j
Cij  (1) mij

When the sum of a row number i and column j is even, cij = mij and
when i+j is odd, cij =-mij
c11 (i  1, j  1)  (1)11 m11   m11
1 2
c12 (i  1, j  2)  (1) m12  m12
1 3
c13 (i  1, j  3)  (1) m13   m13
 Matrices - Operations
DETERMINANTS CONTINUED

The determinant of an n x n matrix A can now be defined as

A  det A  a11c11  a12 c12    a1n c1n

The determinant of A is therefore the sum of the products of the

elements of the first row of A and their corresponding cofactors.
(It is possible to define |A| in terms of any other row or column
but for simplicity, the first row only is used)
 Matrices - Operations
Therefore the 2 x 2 matrix :
 a11 a12 
A 
a21 a22 
Has cofactors :
c11  m11  a22  a22
And:
c12   m12   a21   a21

And the determinant of A is:

A  a11c11  a12 c12  a11a22  a12 a21

 Matrices - Operations
Example 1:
3 1
A 
1 2 
A  (3)( 2)  (1)(1)  5
 Matrices - Operations
For a 3 x 3 matrix:
 a11 a12 a13 
A  a21 a22 a23 
 a31 a32 a33 
The cofactors of the first row are:
a22 a23
c11   a22 a33  a23 a32
a32 a33
a21 a23
c12    (a21a33  a23 a31 )
a31 a33
a21 a22
c13   a21a32  a22 a31
a31 a32
 Matrices - Operations
The determinant of a matrix A is:

A  a11c11  a12 c12  a11a22  a12 a21

Which by substituting for the cofactors in this case is:

A  a11 (a22 a33  a23 a32 )  a12 (a21a33  a23 a31 )  a13 (a21a32  a22 a31 )
 Matrices - Operations

Example 2:
 1 0 1
A   0 2 3
 1 0 1

A  a11 (a22 a33  a23 a32 )  a12 (a21a33  a23 a31 )  a13 (a21a32  a22 a31 )

A  (1)( 2  0)  (0)(0  3)  (1)(0  2)  4

 Matrices - Operations
ADJOINT MATRICES

A cofactor matrix C of a matrix A is the square matrix of the same

order as A in which each element aij is replaced by its cofactor cij .

Example:
 1 2
If A 
  3 4

 4 3
The cofactor C of A is C 
  2 1
 Matrices - Operations
The adjoint matrix of A, denoted by adj A, is the transpose of its
cofactor matrix
adjA  C T

It can be shown that:

A(adj A) = (adjA) A = |A| I

Example:
 1 2
A 
  3 4 
A  (1)( 4)  (2)( 3)  10
 4  2
adjA  C  T

 3 1 
 Matrices - Operations
 1 2 4  2 10 0 
A(adjA)         10 I
 3 4 3 1   0 10

4  2  1 2 10 0 
(adjA) A         10 I
3 1   3 4  0 10
 Matrices - Operations
USING THE ADJOINT MATRIX IN MATRIX INVERSION
Since
AA-1 = A-1 A = I

and
A(adj A) = (adjA) A = |A| I

then
1adjA
A 
A
 Matrices - Operations
Example
 1 2
A=   3 4
 

1 1 4  2 0.4  0.2
A   
10 3 1  0.3 0.1 


To check AA-1 = A-1 A = I

 1 2 0.4  0.2 1
1 0
AA        I
 3 4 0.3 0.1  0 1
1 0.4  0.2  1 2 1 0
A A      I
0.3 0.1   3 4 0 1
 Matrices - Operations
Example 2
3  1 1 
A  2 1 0 
1 2  1
The determinant of A is
|A| = (3)(-1-0)-(-1)(-2-0)+(1)(4-1) = -2

The elements of the cofactor matrix are

c11  (1), c12  (2), c13  (3),
c21  (1), c22  (4), c23  (7),
c31  (1), c32  (2), c33  (5),
 Matrices - Operations
The cofactor matrix is therefore
 1 2 3
C   1  4  7 
 1 2 5 

so
 1 1  1
adjA  C T   2  4 2 
 3  7 5 

and
 1 1  1  0.5  0.5 0.5 
1 adjA 1     1.0 2.0  1.0 
A   2  4 2
A 2    
 3  7 5    1.5 3.5  2.5
 Matrices - Operations
The result can be checked using

AA-1 = A-1 A = I

The determinant of a matrix must not be zero for the inverse to

exist as there will not be a solution
Nonsingular matrices have non-zero determinants
Singular matrices have zero determinants
 Rank of Matrix
The rank of a matrix is the order of the largest non-zero
square submatrix.

MTH165 2
REVISION MCQ

MTH165 3
MTH165 4
 Rank of Matrix Using Elementary
Transformation
• “row-rank of a matrix” counts the max.
number of linearly independent rows.
• “column-rank of a matrix” counts the max.
number of linearly independent columns.
• One application: Given a large system of linear
equations, count the number of essentially
different equations.
– The number of essentially different equations is
just the row-rank of the augmented matrix.

MTH165 5
Evaluating the row-rank by definition

Linearly independent

Linearly independent

Linearly independent

Linearly dependent

Linearly independent

Linearly independent
Linearly dependent  Row-Rank = 2
MTH165 6
Calculation of row-rank via RREF

Row reductions

Row-rank = 2
Row-rank = 2

Because row reductions

do not affect the number
of linearly independent rows

MTH165 7
 Calculation of column-rank by
definition
List all combinations  Column-Rank = 2
of columns

Linearly independent??

Y Y Y Y Y Y Y Y Y Y

N N N N

MTH165 8
 Theorem
Given any matrix, its row-rank and column-rank are equal.

In view of this property, we can just say the

“rank of a matrix”. It means either the row-
rank or column-rank.

MTH165 9
Why row-rank = column-rank?

Apply row reductions.

row-rank and column-rank
do not change.
Apply column reductions.
row-rank and column-rank
do not change.
The top-left corner is
an identity matrix.

The row-rank and column-rank of this

“normal form” is certainly
the size of this identity submatrix,
and are therefore equal.

MTH165 10
MTH165 11
MTH165 12
MCQ

MTH165 13
 LINEAR INDEPENDENT AND DEPENDENT OF VECTORS

In the theory of vector spaces, a set of vectors is said to be

linearly dependent if at least one of the vectors in the set
can be defined as a linear combination of the others; if no
vector in the set can be written in this way, then the vectors
are said to be linearly independent

MTH165 14
MTH165 15
MTH165 16
MTH165 17
MTH165 18
MCQ

MTH165 19
MTH165 20
MTH165 21
MTH165 22
MTH165 23
 Revision

a) 1

b) 2

c) 3

d) None of these
 Revision

a) 1

b) 2

c) 3

d) None of these
Solution of linear system of equations by using
rank of matrix
MCQ
a) Unique Solution

b) No solution

c) Infinite many solution

d) None of these
 Inverse of Matrix by Gauss Jordan Method

• When a matrix A has an inverse, A is called invertible (or

nonsingular); otherwise, A is called singular. A nonsquare
matrix cannot have an inverse.

• To see this, note that if A is of dimension m  n and B is of

dimension n  m (where m  n ), then the products AB and BA
are of different dimensions and so cannot be equal to each
other.

• Not all square matrices have inverses, as you will see later in
this section. When a matrix does have an inverse, however,
that inverse is unique. Example 2 shows how to use systems
of equations to find the inverse of a matrix.
 Inverse of Matrix by Gauss Jordan Method

• When a matrix A has an inverse, A is called invertible (or

nonsingular); otherwise, A is called singular. A nonsquare
matrix cannot have an inverse.

• To see this, note that if A is of dimension m  n and B is of

dimension n  m (where m  n ), then the products AB and BA
are of different dimensions and so cannot be equal to each
other.

• Not all square matrices have inverses, as you will see later in
this section. When a matrix does have an inverse, however,
that inverse is unique. Example 2 shows how to use systems
of equations to find the inverse of a matrix.
1.In structural engineering eigenvalues are usually used to determine the
response of stuctures under random or stochastic processes. For example
response of a building subjected to earthquake or wind-storm.

2. Eigenvalue analysis is also used in the design of the car stereo systems, where it
helps to reproduce the vibration of the car due to the music.

3. Electrical Engineering: The application of eigenvalues and eigenvectors is useful

for decoupling three-phase systems through symmetrical component
transformation.

4.
The Cayley Hamilton Theorem