An algorithmic test for diagonalizability of finite-dimensional PT-invariant systems
From MaRDI portal
Publication:3376087
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.
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
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)
