Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
From MaRDI portal
Publication:281973
DOI10.1016/j.laa.2015.08.026zbMath1338.65098arXiv1501.07812OpenAlexW1809605868MaRDI QIDQ281973
Leonardo Robol, Dario Andrea Bini
Publication date: 11 May 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07812
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Vector spaces, linear dependence, rank, lineability (15A03) Canonical forms, reductions, classification (15A21)
Related Items
On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial, Fast Hessenberg Reduction of Some Rank Structured Matrices
Cites Work
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- An algorithm for computing the eigenvalues of block companion matrices
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Solving secular and polynomial equations: a multiprecision algorithm
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- An implicit QR algorithm for symmetric semiseparable matrices
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Unnamed Item
- Unnamed Item
- Unnamed Item