Factoring Block Fiedler Companion Matrices
From MaRDI portal
Publication:3294688
DOI10.1007/978-3-030-04088-8_7zbMath1443.15008OpenAlexW2936657169MaRDI QIDQ3294688
Federico Poloni, Gianna M. Del Corso, Leonardo Robol, Raf Vandebril
Publication date: 29 June 2020
Published in: Structured Matrices in Numerical Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-04088-8_7
Related Items
Cites Work
- On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial
- Condition numbers for inversion of Fiedler companion matrices
- Spectral equivalence of matrix polynomials and the index sum theorem
- Structured strong linearizations from Fiedler pencils with repetition. I.
- Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
- Palindromic companion forms for matrix polynomials of odd degree
- A permuted factors approach for the linearization of polynomial matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- Fast and stable unitary QR algorithm
- A note on companion matrices
- Block Kronecker linearizations of matrix polynomials and their backward errors
- A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
- A real QZ algorithm for structured companion pencils
- A comparison of eigenvalue condition numbers for matrix polynomials
- Backward error and condition of polynomial eigenvalue problems
- Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
- Fast QR iterations for unitary plus low rank matrices
- Large vector spaces of block-symmetric strong linearizations of matrix polynomials
- Counting Fiedler pencils with repetitions
- Implicit QR for rank-structured matrix pencils
- Fiedler Companion Linearizations and the Recovery of Minimal Indices
- Recovery of Eigenvectors and Minimal Bases of Matrix Polynomials from Generalized Fiedler Linearizations
- Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
- An algorithm for the complete solution of quadratic eigenvalue problems
- On the complexity of matrix product
- Core-Chasing Algorithms for the Eigenvalue Problem
- A new family of companion forms of polynomial matrices
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- A Framework for Structured Linearizations of Matrix Polynomials in Various Bases
- Eigenvectors and minimal bases for some families of Fiedler-like linearizations
- Vector Spaces of Linearizations for Matrix Polynomials
- Symmetric Linearizations for Matrix Polynomials
- A CMV-Based Eigensolver for Companion Matrices
