Matrix pencils with coefficients that have positive semidefinite Hermitian part

08/12/2021
by   Christian Mehl, et al.
0

We analyze when an arbitrary matrix pencil is equivalent to a dissipative Hamiltonian pencil and show that this heavily restricts the spectral properties. In order to relax the spectral properties, we introduce matrix pencils with coefficients that have positive semidefinite Hermitian parts. We will make a detailed analysis of their spectral properties and their numerical range. In particular, we relate the Kronecker structure of these pencils to that of an underlying skew-Hermitian pencil and discuss their regularity, index, numerical range, and location of eigenvalues. Further, we study matrix polynomials with positive semidefinite Hermitian coefficients and use linearizations with positive semidefinite Hermitian parts to derive sufficient conditions for a spectrum in the left half plane and derive bounds on the index.

READ FULL TEXT
research
09/25/2019

A variant of Schur's product theorem and its applications

We show the following version of the Schur's product theorem. If M=(M_j,...
research
08/05/2019

Accuracy of approximate projection to the semidefinite cone

When a projection of a symmetric or Hermitian matrix to the positive sem...
research
07/03/2023

Sufficient Conditions on Bipartite Consensus of Weakly Connected Matrix-weighted Networks

The positive/negative definite matrices are strong in the multi-agent pr...
research
02/14/2022

Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients

Certifying the positivity of trigonometric polynomials is of first impor...
research
05/19/2017

A lower bound on the positive semidefinite rank of convex bodies

The positive semidefinite rank of a convex body C is the size of its sma...
research
06/06/2022

New lower bounds on crossing numbers of K_m,n from permutation modules and semidefinite programming

In this paper, we use semidefinite programming and representation theory...
research
10/13/2009

Positive Semidefinite Metric Learning with Boosting

The learning of appropriate distance metrics is a critical problem in im...

Please sign up or login with your details

Forgot password? Click here to reset