Structured strong ℓ-ifications for structured matrix polynomials in the monomial basis

10/12/2020
by   Fernando De Terán, et al.
0

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 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 companion ℓ-ifications. In this paper, we present, for the first time, a family of (generalized) companion ℓ-ifications that preserve any of these structures, for matrix polynomials of degree k=(2d+1)ℓ. We also show how to construct sparse ℓ-ifications within this family. Finally, we prove that there are no structured companion quadratifications for quartic matrix polynomials.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2022

Linearizations of matrix polynomials viewed as Rosenbrock's system matrices

A well known method to solve the Polynomial Eigenvalue Problem (PEP) is ...
research
06/14/2021

Optimizing Rayleigh quotient with symmetric constraints and their applications to perturbations of the structured polynomial eigenvalue problem

For a Hermitian matrix H ∈ℂ^n,n and symmetric matrices S_0, S_1,…,S_k ∈ℂ...
research
05/21/2023

Unified framework for Fiedler-like strong linearizations of polynomial and rational matrices

Linearization is a widely used method for solving polynomial eigenvalue ...
research
04/22/2021

Eigenvalue embedding problem for quadratic regular matrix polynomials with symmetry structures

In this paper, we propose a unified approach for solving structure-prese...
research
11/04/2019

Generic symmetric matrix polynomials with bounded rank and fixed odd grade

We determine the generic complete eigenstructures for n × n complex symm...
research
11/07/2020

Hypothesis testing with low-degree polynomials in the Morris class of exponential families

Analysis of low-degree polynomial algorithms is a powerful, newly-popula...
research
02/08/2023

Beating binary powering for polynomial matrices

The Nth power of a polynomial matrix of fixed size and degree can be com...

Please sign up or login with your details

Forgot password? Click here to reset