Factoring block Fiedler companion matrices

DOI10.1007/978-3-030-04088-8_7MaRDI QIDQ3294688zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

companion matrixFiedler linearizations

Mathematics Subject Classification ID

Factorization of matrices (15A23)

Recommendations

• A note on companion pencils
• Fiedler companion linearizations for rectangular matrix polynomials
• Fiedler-comrade and Fiedler-Chebyshev pencils
• A block bidiagonal form for block companion matrices
• A note on companion matrices

Cites work

• A CMV-Based Eigensolver for Companion Matrices
• A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
• A comparison of eigenvalue condition numbers for matrix polynomials
• A fast implicit QR eigenvalue algorithm for companion matrices
• A framework for structured linearizations of matrix polynomials in various bases
• A new family of companion forms of polynomial matrices
• A note on companion matrices
• A permuted factors approach for the linearization of polynomial matrices
• A real QZ algorithm for structured companion pencils
• An algorithm for the complete solution of quadratic eigenvalue problems
• Backward error and condition of polynomial eigenvalue problems
• Block Kronecker linearizations of matrix polynomials and their backward errors
• Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
• Condition numbers for inversion of Fiedler companion matrices
• Core-Chasing Algorithms for the Eigenvalue Problem
• Counting Fiedler pencils with repetitions
• Eigenvectors and minimal bases for some families of Fiedler-like linearizations
• Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
• Fast QR iterations for unitary plus low rank matrices
• Fast and Backward Stable Computation of Roots of Polynomials
• Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
• Fast and stable unitary QR algorithm
• Fast computation of the zeros of a polynomial via factorization of the companion matrix
• Fiedler companion linearizations and the recovery of minimal indices
• Implicit QR for rank-structured matrix pencils
• Large vector spaces of block-symmetric strong linearizations of matrix polynomials
• On a class of matrix pencils and -ifications equivalent to a given matrix polynomial
• On the complexity of matrix product
• Palindromic companion forms for matrix polynomials of odd degree
• Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
• Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
• Recovery of eigenvectors and minimal bases of matrix polynomials from generalized Fiedler linearizations
• Spectral equivalence of matrix polynomials and the index sum theorem
• Structured strong linearizations from Fiedler pencils with repetition. I.
• Symmetric Linearizations for Matrix Polynomials
• Vector Spaces of Linearizations for Matrix Polynomials

Cited in

(3)

• Fast QR iterations for unitary plus low rank matrices
• Block TERM factorization of block matrices
• A note on generic Fiedler matrices

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)