On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices (Q1571150): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Khakim D. Ikramov / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Alexey A. Tret'yakov / rank | |||
Normal rank | |||
Revision as of 10:57, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices |
scientific article |
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
