Bidiagonalization and diagonalization

From MaRDI portal





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.





Describes a project that uses

Uses Software






This page was built for publication: Bidiagonalization and diagonalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096332)