An algorithmic test for diagonalizability of finite-dimensional PT-invariant systems

From MaRDI portal
Publication:3376087

DOI10.1088/0305-4470/39/1/017zbMATH Open1093.81026arXivquant-ph/0506042OpenAlexW3098151594WikidataQ62045674 ScholiaQ62045674MaRDI QIDQ3376087FDOQ3376087


Authors: Stefan Weigert Edit this on Wikidata


Publication date: 20 March 2006

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/quant-ph/0506042




Recommendations





Cited In (3)





This page was built for publication: An algorithmic test for diagonalizability of finite-dimensional PT-invariant systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376087)