A framework for structured linearizations of matrix polynomials in various bases

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 nonmonomial bases and allows us to represent polynomials expressed in product families, that is, as a linear combination of elements of the form φi(λ) ψj (λ), where φi(λ) andψj (λ) 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 us 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 extension of these constructions to ∗-odd and ∗-antipalindromic of odd degree is discussed and follows immediately from the previous results.