An algorithmic test for diagonalizability of finite-dimensional PT-invariant systems
DOI10.1088/0305-4470/39/1/017zbMATH Open1093.81026arXivquant-ph/0506042OpenAlexW3098151594WikidataQ62045674 ScholiaQ62045674MaRDI QIDQ3376087FDOQ3376087
Authors: Stefan Weigert
Publication date: 20 March 2006
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0506042
Recommendations
- How to test for diagonalizability: the discretized \textbf{PT}-invariant square-well potential
- Search of exact invariants for \(\mathcal{PT}\) and non-\(\mathcal{PT}\)-symmetric complex Hamiltonian systems
- Finite-dimensional -symmetric Hamiltonians
- Diagonalizability with respect to perplectic and pseudo-unitary similarity transformations
- Algebraic treatment of \(\mathcal{PT}\)-symmetric coupled oscillators
- Approximate diagonalization in differential systems and an effective algorithm for the computation of the spectral matrix
- On the eigenvalues and dynamics of non-Hermitian \(PT\) symmetric Hamiltonians in finite basis spaces
- The diagonalization of linear autonomous dynamical systems
- PT-symmetric, quasi-exactly solvable matrix Hamiltonians
- scientific article; zbMATH DE number 6136535
Vector and tensor algebra, theory of invariants (15A72) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Exactly and quasi-solvable systems arising in quantum theory (81U15)
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)