Diagonalizing by Unitary Similarity Transformation

  • Thread starter Thread starter Thadis
  • Start date Start date
  • Tags Tags
    Transformation
Click For Summary

Homework Help Overview

The discussion revolves around the diagonalization of a specific 5x5 matrix using unitary similarity transformations. Participants are tasked with computing the inverse, eigenvalues, and eigenvectors of the matrix, while also exploring the orthogonality of the eigenvectors and the conditions for diagonalization.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss using computational tools like Mathematica to find eigenvalues and eigenvectors, noting challenges in achieving a diagonal matrix. There are questions about the properties of the matrix, particularly its nearly Hermitian nature and the signs of specific elements.

Discussion Status

Some participants have attempted various methods to diagonalize the matrix and have shared their experiences with computational tools. There is an acknowledgment of the difficulties encountered, particularly in obtaining a characteristic polynomial that can be factored. Others have suggested that with the right tools, approximate diagonalization might be possible.

Contextual Notes

Participants are operating under the assumption that the matrix should be Hermitian, leading to discussions about the implications of the signs of certain matrix elements. There is also mention of the need for clarity in the logic behind the steps taken in the diagonalization process.

Thadis
Messages
43
Reaction score
0

Homework Statement



Compute the inverse, eigenvalues and eigenvectors of the following matrix, M.
Are the eigenvectors orthogonal? Determine a unitary similarity transformation
matrix U such that U-1MU is diagonal.With M being

{2, 0, 2i, 0, 1}
{0, -1, 0,-2i,0}
{-2i, 0, 1, 1, 1}
{ 0, 2i, 1, 0,1}
{1, 0, 1, -1,-1}

Homework Equations


I know for that you are able to diagonalize real matrices by creating a matrix of the eigenvectors.


The Attempt at a Solution


I have tried solving this problem using Mathmatica by creating a matrix from the eigenvectors then inversing that matrix and using the U-1MU identity to see if I get a diagonal matrix but I end up not getting a diagonal matrix. I also have tried orthogonalizing the eigenvector matrix to see if that was a problem but it did not seem to work. Does anyone have anything that might help me understand how to do this problem and also the logic behide the steps? Thank you!
 
Physics news on Phys.org
Thadis said:

Homework Statement



Compute the inverse, eigenvalues and eigenvectors of the following matrix, M.
Are the eigenvectors orthogonal? Determine a unitary similarity transformation
matrix U such that U-1MU is diagonal.With M being

{2, 0, 2i, 0, 1}
{0, -1, 0,-2i,0}
{-2i, 0, 1, 1, 1}
{ 0, 2i, 1, 0,1}
{1, 0, 1, -1,-1}

Homework Equations


I know for that you are able to diagonalize real matrices by creating a matrix of the eigenvectors.


The Attempt at a Solution


I have tried solving this problem using Mathmatica by creating a matrix from the eigenvectors then inversing that matrix and using the U-1MU identity to see if I get a diagonal matrix but I end up not getting a diagonal matrix. I also have tried orthogonalizing the eigenvector matrix to see if that was a problem but it did not seem to work. Does anyone have anything that might help me understand how to do this problem and also the logic behide the steps? Thank you!
I notice that the matrix is nearly Hermitian. Do ##m_{45}## and ##m_{54}## have the right signs? In either case, it doesn't look like you get very nice answers for the eigenvalues from what I see from Mathematica.
 
vela said:
I notice that the matrix is nearly Hermitian. Do ##m_{45}## and ##m_{54}## have the right signs? In either case, it doesn't look like you get very nice answers for the eigenvalues from what I see from Mathematica.

Yeah, I agree. I tried changing it both ways and I still don't get a characteristic polynomial I can factor or anything. But either way including the nonhermitian initial form, I still get 5 distinct eigenvalues. So with the right computer tools you should be able to get an approximate diagonalization. I know I don't have the right tools.
 
vela said:
I notice that the matrix is nearly Hermitian. Do ##m_{45}## and ##m_{54}## have the right signs? In either case, it doesn't look like you get very nice answers for the eigenvalues from what I see from Mathematica.

It is suppose to be a Hermitian matrix. They both should be -1, sorry about that. And I believe I have an approximate answer. I believed I just changed the way I did it and use the face that for a unility matrix that U-dagger =U-1 and it was much cleaner output. Thanks for your help!
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
9
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K