Bidiagonalization and diagonalization
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.
scientific article; zbMATH DE number 4030835
scientific article