An implicit multishift QR-algorithm for Hermitian plus low rank matrices
From MaRDI portal
Publication:2998029
Recommendations
- A generalization of the multishift QR algorithm
- A multiple shift \(QR\)-step for structured rank matrices
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Implicit QR for rank-structured matrix pencils
- Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
Cited in
(13)- Fast QR iterations for unitary plus low rank matrices
- Implicit QR for rank-structured matrix pencils
- Block tridiagonal reduction of perturbed normal and rank structured matrices
- A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- Rank-Structured QR for Chebyshev Rootfinding
- A multiple shift \(QR\)-step for structured rank matrices
- A CMV-Based Eigensolver for Companion Matrices
- Fast and Backward Stable Computation of Roots of Polynomials
- A condensed representation of almost normal matrices
- Fast computation of eigenvalues of companion, comrade, and related matrices
- An implicit \(Q\) theorem for Hessenberg-like matrices
- On reduction of \(k\)-almost normal and \(k\)-almost conjugate normal matrices to a block tridiagonal form
This page was built for publication: An implicit multishift \(QR\)-algorithm for Hermitian plus low rank matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998029)