PROOFS PROGRAMME

MM-02 Matrices (Problem Sets)

For page specific messages
For page specific messages

Problem Set 1 :
Matrix Diagonalisation; There are 150 different sets.
Each set has five 3x3 matrices to be
diagonlised. Out of five matrices there is one matrix of each of the following types.
(a) All three eigenvalues are distinct
(b) Two distinct eigenvalues, one eigenvalue has degeneracy 2; three linearly indepdendent
      eigenvectors.
(c) Two disticnt eigenvalues and two linearly independent eigenvactors.
(d) Only one distinct eignevalue and two linearly indpendent eigenvectors.
(e) Only one distinct eigenvalue and only one linearly independent eigenvector.   

Problem Set 2:
Simultaneous Diagonalisation of Matrices

 

Exclude node summary : 

n