Department of Computer Engineering

MINIPROJECT

Academic Year : 2024-2025

Engineering Mathematics-IV CSC401

Title: Eigenvalues and Eigenvectors

Submitted by:
A-431 Nitin Gupta
A-433 Sumeet Gupta
A-448 Sujal Kharatmol
A-465 Rajashekhar Maduri
A-468 Pratham Kothari

Submitted to:
Prof.Pallavi Tingne
 Matrices

1 Eigen values and Eigenvectors

2 Diagonalization
3 Symmetric Matrices and Orthogonal Diagonalization
4 Application

7.2
 1 Eigenvalues and Eigenvectors

Eigenvalue problem (one of the most important problems in
the linear algebra):
If A is an nn matrix, do there exist nonzero vectors x in Rn
such that Ax is a scalar multiple of x?
(The term eigenvalue is from the German word Eigenwert, meaning
“proper value”)

Eigenvalue and
Eigenvector :
A: an nn matrix ※ Geometric Interpretation
y
: a scalar (could be Ax = x
zero) x: a nonzero vector
in Rn
Eigenvalue x

Ax  x x 7.3

Ex 1: Verifying eigenvalues and
eigenvectors
2 0  1 2 0
A  
x   x   
1
0 1  0  1
Eigenvalue

2 0  1  2  1 
Ax 
1
      2   2x

1
0 1  0   0   0
Eigenvector

Eigenvalue

Ax 2  2 0  0 0 0

0 
   
 
  1 
  (1)x 2
1 1 1 1

Eigenvector
7.4

Thm. 1: The eigenspace corresponding to  of matrix
A
If A is an nn matrix with an eigenvalue , then the set of all
eigenvectors of  together with the zero vector is a
subspace of Rn. This subspace is called the eigenspace of 
Proof:
x1 and x2 are eigenvectors corresponding to
 x1, Ax2  x2 )
(i.e., Ax1 
(1) A(x1  x2 )  Ax1  Ax2  x1  x2  (x1  x 2 )
(i.e., x1  x2 is also an eigenvector corresponding to λ)
(2) A(cx1 )  c( Ax1 )  c(x1 )  (cx1 )
(i.e., cx1 is also an eigenvector corresponding to )
Since this set is closed under vector addition and scalar
multiplication, this set is a subspace of Rn .
7.5

Ex 3: Examples of eigenspaces on the xy-plane
For the matrix A as follows, the corresponding eigenvalues
are 1 = –1 and 2 = 1:
 1 0
A
0 1
Sol:
For the eigenvalue 1 = –1, corresponding vectors are any vectors on the x-axis
※ Thus, the eigenspace
 x  1 0  x  x   x corresponding to  = –1 is the
A       1  
0   0 1 0   0  0 x- axis, which is a subspace of
R2

For the eigenvalue 2 = 1, corresponding vectors are any vectors on the y-axis

※ Thus, the eigenspace

 0 1 0 0  0  0  corresponding to  = 1 is the
A     1
 y  0 1  y   y   y y- axis, which is a subspace of
R2 7.6
※ Geometrically speaking, multiplying a vector (x, y) in R2 by the matrix A
corresponds to a reflection to the y-axis, i.e., left multiplying A to v can
transform v to another vector in the same vector space

x   x 0   x 0

Av  A   A        A   A 
 y   0   y  0   y
 x   0   x 
 1    1    
0   y  y 

7.7

Thm. 2: Finding eigenvalues and eigenvectors of a matrix AMnn
Let A be an nn matrix.

(1) An eigenvalue of A is a scalar  such that det(I  A)  0

(2) The eigenvectors of A corresponding to  are the nonzero

solutions of (  I  A)x  0

Note: follwing the definition of the eigenvalue problem
Ax  x  Ax  Ix  (I  A)x  0 (homogeneous
system)
(I  A)x  0 has nonzero solutions for x iff det(I  A)  0
(The above iff results comes from the equivalent conditions on Slide 4.101)

Characteristic equation of A: n
det(I  A)  (I  A)    cn1 n1
 c1  c0
det(I  A)  0 7.7

Ex 4: Finding eigenvalues and eigenvectors

2 12
A 
1  5 

Sol: Characteristic equation:

2 12
det(I  A) 
1 
 52  3  2  ( 1)(  2)
0
   1,  2

Eigenvalue: 1  1, 2  2

7.8
 3 12  x1  0
(1) 
1  1  ( I  A)x  
1
    

1 4  x 2   0

3 12 1
G -J
.. E. 4
    
1 4 
 0 0 

x  4t  4
  1     t  ,
 t
 x 2  t   1
0

4 12  x1  0

(2)  2  2  ( 2 I  A)x       

1 3  x 2   0 

4 12 . . E. 1
G -J 3
     
1 
3 0 0 

 x1  3s 3
     
 s  , s
x s 1 7.9

Thm. 3: Eigenvalues for triangular matrices
If A is an nn triangular matrix, then its eigenvalues
are the entries on its main diagonal

Ex 7: Finding eigenvalues for triangular and diagonal matrices
1 0 0 0 0
2 0 0  0 
 1 0
2 0 0
(b) A   0 0
(a) A  1 
0  0
3 0 0 0
 5  0 0 3
3
Sol: 0 0
2 0 0 4
(a)  I  A 1  1 0  (0  2)( 1)(
0   3) 
 5 3  0 0
 1  2, 2 31, 3  3
(b) 1  1, 2  2, 3  0, 4  4, 5 7.17
 Diagonalization

Diagonalization of Matrix : A square matrix A of order n is called

diagonalizable if it is similar to diagonal matrix
Show that the following matrix A is not diagonalizable.
A   5  3
 3  1
Solution 5  3 
A   I 2  
 3  1  
The characteristic equation is
A  I 2 0  (5   )( 1   )  9 0
 2  4  4 0  (  2)(  2) 0
There is a single eigenvalue,  = 2. We find he corresponding
eigenvectors. (A – 2I ) x = 0 gives 3

 3  x 
0  3 x  3 x 0. 1


x

3 3 

  2
1 2

Thus x1 = r, x2 = r. The eigenvectors are nonzero vectors of the

form  1
r 
 1
The eigenspace is a one-dimensional space. A is a 2  2
matrix, but it does not have two linearly independent
Ch5_13

Ex 1: Eigenvalue problems and diagonalization
programs
1 3
0 
0 0 
2
A  3 1
Sol: Characteristic equation:
 1 3 00
I  A  3  1 0  (  4)(  2)2 
0 0  0
2
The eigenvalues : 1  4, 2  2, 3 
2

(1)   4  the eigenvector p1 11

0
 7.22
 1 0
(2)   2  the eigenvector p 2 1 , p3  0
1
 0

1 1 0 0 0
P  [p1   4  0
2 p3 ]  1 1  
2 
0 , and P1 AP   0
p
0 0 1 0 2
0

If P  p1 p3 ]
0
Note:
  
[p2

1 1 0 2 20
 1 1 0 
0
0 1 7.23
Applications:
1. Computer Graphics & Image Processing
2. Control Systems Engineering
3. Electrical Engineering & Signal Processing
4. Machine Learning & AI
5. Robotics & Computer Vision
Conclusion:

• Linear algebra is a powerful tool in engineering.

• Essential for modeling, analysis, and optimization.
• Continuous advancements make it relevant across multiple disciplines.
Refrences:
• https://www.geeksforgeeks.org/engineering-mathematics-tutorials/
• https://en.wikipedia.org/wiki/Linear_algebra
• G.V. Kumbhojkar
Thank You