PX153 - K16 - diagonalization
o use similarity transformations to diagonalize matrices:
-
make the
column the eigenvector of -
transforming
with will make , a diagonal matrices -
if
independent eigenvectors can be found , is diagonal, if has column vectors composed of the independent eigenvectors -
for hermitian matrices, the eigenvectors are orthogonal:
with columns as eigenvectors:
-
hence,
is unitary -
considering
-
the similarity transformation has made
a diagonal matrix with eigenvalues in the diagonals -
eg: diagonalize
- the matrix is hermitian:
- for eigenvalues and eigenvectors:
- the matrix is hermitian:
- to diagonalize: