On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices (Q1571150)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices |
scientific article; zbMATH DE number 1472894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices |
scientific article; zbMATH DE number 1472894 |
Statements
On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices (English)
0 references
28 March 2001
0 references
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.
0 references
unitary transformation
0 references
band form
0 references
\(QR\) algorithm
0 references
tridiagonal pseudo-Hermitian matrices
0 references
algorithm
0 references
