QR-Like Algorithms for Symmetric Arrow Matrices
From MaRDI portal
Recommendations
- Structured QR algorithms for Hamiltonian symmetric matrices
- Matrix shapes invariant under the symmetric QR algorithm
- scientific article; zbMATH DE number 169552
- An implicit QR algorithm for symmetric semiseparable matrices
- On QR factorization and algorithms for unitary symmetric matrices
- QR -like algorithms for the nonsymmetric eigenvalue problem
- The QR algorithm for unitary Hessenberg matrices
- A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
- A fast QR algorithm for companion matrices
- The convergence of multi-shift QR algorithm for symmetric matrices
Cited in
(10)- Computable eigenvalue bounds for rank-\(k\) perturbations
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- An approximate inverse matrix technique for arrowhead matrices
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- Implicit QR for rank-structured matrix pencils
- An efficient method for computing the inverse of arrowhead matrices
- A graph-theoretic model of symmetric Givens operations and its implications
- Matrix shapes invariant under the symmetric QR algorithm
This page was built for publication: QR-Like Algorithms for Symmetric Arrow Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4005094)