Bidiagonalization and diagonalization (Q1096332)
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: Bidiagonalization and diagonalization |
scientific article; zbMATH DE number 4030835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bidiagonalization and diagonalization |
scientific article; zbMATH DE number 4030835 |
Statements
Bidiagonalization and diagonalization (English)
0 references
1987
0 references
The author discusses four related topics. In the first it is shown how an \(n\times n\) complex matrix A can be diagonalized, if the diagonalization for a matrix near A is known. The second introduces a modified shift strategy for use with the QR algorithm. The third concerns the fast Givens procedure and the QR algorithm. The last considers the problem of expressing an \(m\times n\) complex A as \(QBP^*\) where P, Q are unitary and B is upper bidiagonal.
0 references
bidiagonalization
0 references
fast Givens transformation
0 references
shift strategy
0 references
QR algorithm
0 references
0 references
0 references
0.8946028
0 references
0.8902163
0 references
0 references
0.8812169
0 references
0.87862575
0 references
0 references
