Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
From MaRDI portal
Publication:475676
DOI10.1016/j.cam.2014.09.023zbMath1304.65131arXiv1307.2186OpenAlexW2052733347MaRDI QIDQ475676
Gianna M. Del Corso, Luca Gemignani, Roberto Bevilacqua
Publication date: 27 November 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.2186
algorithmeigenvalue problemblock Lanczos algorithmunitary matricesCMV matricesQR iterationblock tridiagonal reductionrank-structured matrices
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04)
Related Items
Editorial: Advanced methods for space-time environmental data, Factoring Block Fiedler Companion Matrices, Sampling the eigenvalues of random orthogonal and unitary matrices, A CMV-Based Eigensolver for Companion Matrices, Fast Hessenberg Reduction of Some Rank Structured Matrices
Cites Work
- Unnamed Item
- Rank structures preserved by the \(QR\)-algorithm: the singular case
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- Out-of-band quasiseparable matrices
- Completing a matrix when certain entries of its inverse are specified
- Schur parameter pencils for the solution of the unitary eigenproblem
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- An extension of the \(QZ\) algorithm beyond the Hessenberg-upper triangular pencil
- Eigenvalue computation for unitary rank structured matrices
- An Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
- Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift
- CMV: The unitary analogue of Jacobi matrices
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- The unitary completion and QR iterations for a class of structured matrices