Factoring block Fiedler companion matrices
From MaRDI portal
Publication:3294688
DOI10.1007/978-3-030-04088-8_7zbMATH Open1443.15008OpenAlexW2936657169MaRDI QIDQ3294688FDOQ3294688
Authors: Gianna M. Del Corso, Federico Poloni, 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
Recommendations
Cites Work
- An algorithm for the complete solution of quadratic eigenvalue problems
- A note on companion matrices
- 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
- Condition numbers for inversion of Fiedler companion matrices
- Spectral equivalence of matrix polynomials and the index sum theorem
- A new family of companion forms of polynomial matrices
- A permuted factors approach for the linearization of polynomial matrices
- Backward error and condition of polynomial eigenvalue problems
- On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial
- Vector Spaces of Linearizations for Matrix Polynomials
- Symmetric Linearizations for Matrix Polynomials
- Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Palindromic companion forms for matrix polynomials of odd degree
- Structured strong linearizations from Fiedler pencils with repetition. I.
- A fast implicit QR eigenvalue algorithm for companion matrices
- Fast and Backward Stable Computation of Roots of Polynomials
- Large vector spaces of block-symmetric strong linearizations of matrix polynomials
- A comparison of eigenvalue condition numbers for matrix polynomials
- Fast and stable unitary QR algorithm
- Fast computation of the zeros of a polynomial via factorization of the companion matrix
- Core-Chasing Algorithms for the Eigenvalue Problem
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- A CMV-Based Eigensolver for 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
- Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
- A framework for structured linearizations of matrix polynomials in various bases
- A real QZ algorithm for structured companion pencils
- Eigenvectors and minimal bases for some families of Fiedler-like linearizations
- On the complexity of matrix product
- Fast QR iterations for unitary plus low rank matrices
- Implicit QR for rank-structured matrix pencils
- Counting Fiedler pencils with repetitions
Cited In (3)
This page was built for publication: Factoring block Fiedler companion matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3294688)
