Professional Documents
Culture Documents
CONTENTS
TEXT BOOKS
1.Mathematical Methods, T.K.V.Iyengar, B.Krishna
Gandhi and others, S.Chand and company
Mathematical Methods, C.Sankaraiah, V.G.S.Book
links.
A text book of Mathametical Methods,
V.Ravindranath, A.Vijayalakshmi, Himalaya
Publishers.
A text book of Mathametical Methods, Shahnaz
Bathul, Right Publishers.
REFERENCES
1. A text book of Engineering Mathematics,
B.V.Ramana, Tata Mc Graw Hill.
2.Advanced Engineering Mathematics, Irvin Kreyszig
Wiley India Pvt Ltd.
3. Numerical Methods for scientific and Engineering
computation, M.K.Jain, S.R.K.Iyengar and R.K.Jain,
New Age International Publishers
Elementary Numerical Analysis, Aitkison and Han,
Wiley India, 3rd Edition, 2006.
UNIT HEADER
Name of the Course:B.Tech
Code No:07A1BS02
Year/Branch:I Year CSE,IT,ECE,EEE,ME,
Unit No: I I
No.of slides:17
UNIT INDEX
UNIT-II
S.No.
Module
Lecture
No.
PPT Slide
No.
Eigenvalues,Eigenve L1-4
ctors,properties.
8-11
Diagonalisation of a
matrix
L5-7
12-14
Cayley-Hamilton
theorem and its
inverse
L8-9
15-17
UNIT-II
EIGEN VALUES AND EIGEN
VECTORS
LECTURE-1
Characteristic matrix: Let A be a square matrix of order n
then the matrix (A-I) is called Charecteristic matrix of
A.where
I is the unit matrix
of order n and is any scalar
Ex: Let A=
then
1 2
3 4
A- I=
2
1
4
3
1 2
1
4
1 2
4 1
then | A- I|=2-6+5=0
Ex: Let A=
3 4
LECTURE-2
LECTURE-3
Properties of eigen values and eigen
vectors
LECTURE-4
LECTURE-5
Diagonalization of a matrix: If a square matrix A of order
n has n eigen vectors X1, X2 ..Xn
Corresponding to n eigen values 1, 2 n respectively
then a matrix P can be found such that
P-1AP is a diagonal matrix
i.e., P-1AP=D.
Modal and spectral matrices: The matrix P in the above
result which diagonalize in the square matrix A is called
the modal matrix of A and the resulting diagonal matrix
D is known as spectral matrix.
LECTURE-6
Calculation of power of matrix: We can obtain the
powers of a matrix by using diagonalization.
Dn=P-1AnP
An=PDnP-1
LECTURE-7
Matrix Polynomial: An expression of the form
F(x)=A0+A1X+A2X2+..Am Xm 0, Where
A0,A1,A2,..Am are matrices each of order n is called
a matrix polynomial of degree m.
The matrices themselves are matric polynomials of degree
zero
LECTURE-8
CAYLEY-HAMILTON THEOREM
Statement: Every square matrix satisfies its own
characteristic equation.
Let A be square matrix of order n then |A-I|=0 is the
characteristic equation of A.
|A-I|=(-1)n[n+a1 n-1+a2n-2+.+an]
Put =A then
=|(-1)n[An+a1 An-1+a2An-2+.+anI]=0
= [An+a1 An-1+a2An-2+.+anI]= 0 which
implies that A satisfies its characteristic equation.
LECTURE-9
Determination of A-1 using Cayley-Hamilton
theorem.
A satisfies it characteristic equation
=(-1)n[An+a1 An-1+a2An-2+.+anI]=0
= [An+a1 An-1+a2An-2+.+anI]=0
=A-1 [An+a1 An-1+a2An-2+.+anI]= 0
If A is nonsingular, then we have
anA-1=-[An+a1 An-1+a2An-2+.+anI]
A-1=-1/an[An+a1 An-1+a2An-2+.+anI]