AQZ-method based on semiseparable matrices
From MaRDI portal
Publication:932737
DOI10.1016/j.cam.2007.07.032zbMath1153.65038OpenAlexW2034997880MaRDI QIDQ932737
Yvette Vanberghen, Marc Van Barel, Raf Vandebril
Publication date: 11 July 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.07.032
algorithmnumerical examplesgeneralized eigenvalue problemQZ-algorithmstructured rank matricessemiseparable
Related Items (3)
A matricial computation of rational quadrature formulas on the unit circle ⋮ Implicit QR for rank-structured matrix pencils ⋮ Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices
Uses Software
Cites Work
- Unnamed Item
- Structure ranks of matrices
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
- An implicit \(Q\) theorem for Hessenberg-like matrices
- The Quadratic Eigenvalue Problem
- An implicit QR algorithm for symmetric semiseparable matrices
- A note on the representation and definition of semiseparable matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
This page was built for publication: AQZ-method based on semiseparable matrices
