Transformations to rank structures by unitary similarity
From MaRDI portal
Publication:556881
DOI10.1016/j.laa.2004.12.029zbMath1076.15004OpenAlexW2078881056MaRDI QIDQ556881
Roberto Bevilacqua, Enrico Bozzo, Gianna M. Del Corso
Publication date: 23 June 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2004.12.029
Frobenius matrixbanded matricesQR algorithmcomparison matrixnonderogatory matrixKrylov matriceslow rank submatrices
Linear transformations, semilinear transformations (15A04) Direct numerical methods for linear systems and matrix inversion (65F05) Canonical forms, reductions, classification (15A21)
Related Items
A condensed representation of almost normal matrices, A unification of unitary similarity transforms to compressed representations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
- Linear complexity algorithms for semiseparable matrices
- Inverses of banded matrices
- On the shifted QR iteration applied to companion matrices
- Structural properties of matrix unitary reduction to semiseparable form
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- On band matrices and their inverses
- Inverses of Matrices $\{a_{ij}\}$ which Satisfy $a_{ij} = 0$ for $j > i+p$.
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- A note on the representation and definition of semiseparable matrices
- Matrix Analysis
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form