A framework for structured linearizations of matrix polynomials in various bases
From MaRDI portal
Abstract: We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework provides an extension of the classical linearization theory for polynomials expressed in non-monomial bases and allows to represent polynomials expressed in product families, that is as a linear combination of elements of the form , where and can either be polynomial bases or polynomial families which satisfy some mild assumptions. We show that this general construction can be used for many different purposes. Among them, we show how to linearize sums of polynomials and rational functions expressed in different bases. As an example, this allows to look for intersections of functions interpolated on different nodes without converting them to the same basis. We then provide some constructions for structured linearizations for -even and -palindromic matrix polynomials. The extensions of these constructions to -odd and -antipalindromic of odd degree is discussed and follows immediately from the previous results.
Recommendations
- Linearization of matrix polynomials expressed in polynomial bases
- Linearization of Lagrange and Hermite interpolating matrix polynomials
- On vector spaces of linearizations for matrix polynomials in orthogonal bases
- Linearizations of matrix polynomials in Bernstein bases
- Linearizations of matrix polynomials in Newton bases
Cites work
- A companion matrix analogue for orthogonal polynomials
- A new family of companion forms of polynomial matrices
- A note on companion matrices
- A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Bézier clipping is quadratically convergent
- Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
- Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains
- Controllability of linear differential-algebraic systems -- a survey
- Fiedler companion linearizations and the recovery of minimal indices
- Fiedler companion linearizations for rectangular matrix polynomials
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 194260 (Why is no real title available?)
- scientific article; zbMATH DE number 1235881 (Why is no real title available?)
- Jordan structures of alternating matrix polynomials
- Linearization of matrix polynomials expressed in polynomial bases
- Matrix Polynomials
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- Numerical stability of barycentric Hermite root-finding
- On a generalized companion matrix pencil for matrix polynomials expressed in the Lagrange basis
- Palindromic companion forms for matrix polynomials of odd degree
- Solving secular and polynomial equations: a multiprecision algorithm
- Spectral equivalence of matrix polynomials and the index sum theorem
- Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Symmetric Linearizations for Matrix Polynomials
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- The computation of Kronecker's canonical form of a singular pencil
- The condition of Vandermonde-like matrices involving orthogonal polynomials
- The eigenvalue problem \(\lambda Tx+Sx\)
- Vector Spaces of Linearizations for Matrix Polynomials
Cited in
(21)- Block Kronecker linearizations of matrix polynomials and their backward errors
- Block minimal bases \(\ell\)-ifications of matrix polynomials
- Linearizations of matrix polynomials in Newton bases
- Algebraic linearizations of matrix polynomials
- A simplified approach to Fiedler-like pencils via block minimal bases pencils
- Robustness and perturbations of minimal bases. II: The case with given row degrees
- Robustness and perturbations of minimal bases
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
- Linearizations of rational matrices from general representations
- On vector spaces of linearizations for matrix polynomials in orthogonal bases
- The infinite Lanczos method for symmetric nonlinear eigenvalue problems
- Factoring block Fiedler companion matrices
- A class of quasi-sparse companion pencils
- Strong Linearizations of Rational Matrices
- Structured backward error analysis of linearized structured polynomial eigenvalue problems
- Explicit block-structures for block-symmetric Fiedler-like pencils
- Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems
- scientific article; zbMATH DE number 7351224 (Why is no real title available?)
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- Generalized standard triples for algebraic linearizations of matrix polynomials
- Uniform Determinantal Representations
This page was built for publication: A framework for structured linearizations of matrix polynomials in various bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346749)
