Generic symmetric matrix polynomials with bounded rank and fixed odd grade

11/04/2019
by   Fernando De Terán, et al.
0

We determine the generic complete eigenstructures for n × n complex symmetric matrix polynomials of odd grade d and rank at most r. More precisely, we show that the set of n × n complex symmetric matrix polynomials of odd grade d, i.e., of degree at most d, and rank at most r is the union of the closures of the rd/2+1 sets of symmetric matrix polynomials having certain, explicitly described, complete eigenstructures. Then, we prove that these sets are open in the set of n × n complex symmetric matrix polynomials of odd grade d and rank at most r. In order to prove the previous results, we need to derive necessary and sufficient conditions for the existence of symmetric matrix polynomials with prescribed grade, rank, and complete eigenstructure, in the case where all their elementary divisors are different from each other and of degree 1. An important remark on the results of this paper is that the generic eigenstructures identified in this work are completely different from the ones identified in previous works for unstructured and skew-symmetric matrix polynomials with bounded rank and fixed grade larger than one, because the symmetric ones include eigenvalues while the others not. This difference requires to use new techniques.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/12/2020

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

In the framework of Polynomial Eigenvalue Problems, most of the matrix p...
11/25/2019

The distribution of the L_4 norm of Littlewood polynomials

Classical conjectures due to Littlewood, Erdős and Golay concern the asy...
11/04/2019

Nearest matrix polynomials with a specified elementary divisor

The problem of finding the distance from a given n × n matrix polynomial...
06/24/2021

The leading coefficient of Lascoux polynomials

Lascoux polynomials have been recently introduced to prove polynomiality...
09/03/2019

Inverse problems for symmetric doubly stochastic matrices whose Suleĭmanova spectra are to be bounded below by 1/2

A new sufficient condition for a list of real numbers to be the spectrum...
05/22/2020

Polynomial traces and elementary symmetric functions in the latent roots of a non-central Wishart matrix

Hypergeometric functions and zonal polynomials are the tools usually add...
09/30/2019

Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues

Recently, Ogita and Aishima proposed an efficient eigendecomposition ref...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.