Fiedler-comrade and Fiedler--Chebyshev pencils

Fiedler pencils are a family of strong linearizations for polynomials expressed in the monomial basis, that include the classical Frobenius companion pencils as special cases. We generalize the definition of a Fiedler pencil from monomials to a larger class of orthogonal polynomial bases. In particular, we derive Fiedler-comrade pencils for two bases that are extremely important in practical applications: the Chebyshev polynomials of the first and second kind. The new approach allows one to construct linearizations having limited bandwidth: a Chebyshev analogue of the pentadiagonal Fiedler pencils in the monomial basis. Moreover, our theory allows for linearizations of square matrix polynomials expressed in the Chebyshev basis (and in other bases), regardless of whether the matrix polynomial is regular or singular, and for recovery formulas for eigenvectors, and minimal indices and bases

Eigenvectors and minimal bases for some families of Fiedler-like linearizations

In this paper, we obtain formulas for the left and right eigenvectors and minimal bases of some families of Fiedler-like linearizations of square matrix polynomials. In particular, for the families of Fiedler pencils, generalized Fiedler pencils and Fiedler pencils with repetition. These formulas allow us to relate the eigenvectors and minimal bases of the linearizations with the ones of the polynomial. Since the eigenvectors appear in the standard formula of the condition number of eigenvalues of matrix polynomials, our results may be used to compare the condition numbers of eigenvalues of the linearizations within these families and the corresponding condition number of the polynomial eigenvalue problem.Publicad

Duality of matrix pencils, Wong chains and linearizations

We consider two theoretical tools that have been introduced decades ago but whose usage is not widespread in modern literature on matrix pencils. One is dual pencils, a pair of pencils with the same regular part and related singular structures. They were introduced by V. Kublanovskaya in the 1980s. The other is Wong chains, families of subspaces, associated with (possibly singular) matrix pencils, that generalize Jordan chains. They were introduced by K.T. Wong in the 1970s. Together, dual pencils and Wong chains form a powerful theoretical framework to treat elegantly singular pencils in applications, especially in the context of linearizations of matrix polynomials. We first give a self-contained introduction to these two concepts, using modern language and extending them to a more general form; we describe the relation between them and show how they act on the Kronecker form of a pencil and on spectral and singular structures (eigenvalues, eigenvectors and minimal bases). Then we present several new applications of these results to more recent topics in matrix pencil theory, including: constraints on the minimal indices of singular Hamiltonian and symplectic pencils, new sufficient conditions under which pencils in L1, L2 linearization spaces are strong linearizations, a new perspective on Fiedler pencils, and a link between the Möller-Stetter theorem and some linearizations of matrix polynomials