- #1
SUSY
- 6
- 0
Hi,
I have a 3 by 3 hermitian matrix K that I need to diagonalise. More accurately, I am searching for a unitary matrix S such that [tex]S^{\dagger} K S[/tex] is diagonal.
The problem is that K is very complicated and the expression for S in mathematica takes up quiiiiiet a lot of space.
Is it possible to find approximate expressions for the entries of S in terms of entries in K? What I am looking for is something like (as an example) [tex]S_{ij}=K_{ij} + K_{ji} bla bla[/tex]
Or is it maybe possible to decompose S into matrices which I can then approximate by such expressions (they can, of course, be more complicated than the example given above).
Since the entries in K are given as a power series of some small parameter ε [tex]K_{ij}=a_0 + a_1 \epsilon + ...[/tex] and I am only interested in the lowest non-vanishing order anyway, it would be nice to have expressions for the entries in S in terms of the entries in K. Then, I could easily evaluate the entries in S to lowest non-vanishing order in ε (so I am only interested in an approximate S anyway).
Does anybody know of such a method?
Thanks,
Susy
I have a 3 by 3 hermitian matrix K that I need to diagonalise. More accurately, I am searching for a unitary matrix S such that [tex]S^{\dagger} K S[/tex] is diagonal.
The problem is that K is very complicated and the expression for S in mathematica takes up quiiiiiet a lot of space.
Is it possible to find approximate expressions for the entries of S in terms of entries in K? What I am looking for is something like (as an example) [tex]S_{ij}=K_{ij} + K_{ji} bla bla[/tex]
Or is it maybe possible to decompose S into matrices which I can then approximate by such expressions (they can, of course, be more complicated than the example given above).
Since the entries in K are given as a power series of some small parameter ε [tex]K_{ij}=a_0 + a_1 \epsilon + ...[/tex] and I am only interested in the lowest non-vanishing order anyway, it would be nice to have expressions for the entries in S in terms of the entries in K. Then, I could easily evaluate the entries in S to lowest non-vanishing order in ε (so I am only interested in an approximate S anyway).
Does anybody know of such a method?
Thanks,
Susy