Papers
Topics
Authors
Recent
Search
2000 character limit reached

Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis

Published 12 Oct 2020 in math.NA and cs.NA | (2010.06033v1)

Abstract: In the framework of Polynomial Eigenvalue Problems, most of the matrix polynomials arising in applications are structured polynomials (namely (skew-)symmetric, (skew-)Hermitian, (anti-)palindromic, or alternating). The standard way to solve Polynomial Eigenvalue Problems is by means of linearizations. The most frequently used linearizations belong to general constructions, valid for all matrix polynomials of a fixed degree, known as {\em companion linearizations}. It is well known, however, that is not possible to construct companion linearizations that preserve any of the previous structures for matrix polynomials of even degree. This motivates the search for more general companion forms, in particular {\em companion $\ell$-ifications}. In this paper, we present, for the first time, a family of (generalized) companion $\ell$-ifications that preserve any of these structures, for matrix polynomials of degree $k=(2d+1)\ell$. We also show how to construct sparse $\ell$-ifications within this family. Finally, we prove that there are no structured companion quadratifications for quartic matrix polynomials.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.