An Algorithmic Test for Diagonalizability of Finite-Dimensional PT-Invariant Systems

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 1 figure

Scientific paper

A non-Hermitean operator does not necessarily have a complete set of eigenstates, contrary to a Hermitean one. An algorithm is presented which allows one to decide whether the eigenstates of a given PT-invariant operator on a finite-dimensional space are complete or not. In other words, the algorithm checks whether a given PT-symmetric matrix is diagonalizable. The procedure neither requires to calculate any single eigenvalue nor any numerical approximation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Algorithmic Test for Diagonalizability of Finite-Dimensional PT-Invariant Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algorithmic Test for Diagonalizability of Finite-Dimensional PT-Invariant Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithmic Test for Diagonalizability of Finite-Dimensional PT-Invariant Systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-202702

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.