On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices
It is well known that, before applying the \(QR\) algorithm to a Hermitian matrix \(A\), it is usually reduced to tridiagonal form. It is proved that any pseudo-Hermitian matrix can be brought to band form by a unitary similarity transformation. This band form is tridiagonal if the matrix is of the type \((n-1,1)\) or \((1,n-1)\). In this paper a pseudounitary analogue of the \(QR\) algorithm for tridiagonal pseudo-Hermitian matrices is discussed.
scientific article; zbMATH DE number 1472894