Generalized Householder transformations for the complex symmetric eigenvalue problem

Noble, J. H. and Lubasch, M. and Jentschura, Ulrich David (2013) Generalized Householder transformations for the complex symmetric eigenvalue problem. EUROPEAN PHYSICAL JOURNAL PLUS, 128 (8). ISSN 2190-5444

Preview

Text 1301.5758v3.pdf Available under License Creative Commons Attribution. Download (385kB) | Preview

Abstract

We present an intuitive and scalable algorithm for the diagonalization of complex symmet- ric matrices, which arise from the projection of pseudo–Hermitian and complex scaled Hamilto- nians onto a suitable basis set of “trial” states. The algorithm diagonalizes complex and sym- metric (non–Hermitian) matrices and is easily implemented in modern computer languages. It is based on generalized Householder transformations and relies on iterative similarity transformations T → T ′ = QT T Q, where Q is a complex and orthogonal, but not unitary, matrix, i.e, QT = Q−1 but Q+ 6 = Q−1. We present numerical reference data to support the scalability of the algorithm. We construct the generalized Householder transformations from the notion that the conserved scalar product of eigenstates Ψn and Ψm of a pseudo–Hermitian quantum mechanical Hamiltonian can be reformulated in terms of the generalized indefinite inner product ∫ dx Ψn(x, t) Ψm(x, t), where the integrand is locally defined, and complex conjugation is avoided. A few example calculations are described which illustrate the physical origin of the ideas used in the construction of the algorithm.

Actions (login required)

Edit Item