NANAOct 12, 2014

On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue

arXiv:1410.3082
Originality Synthesis-oriented
AI Analysis

For researchers in matrix polynomial theory, this provides a tighter bound for a specific class of polynomials, but the improvement is incremental.

The paper refines an upper bound for the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue, improving on a prior result by Papathanasiou and Psarrakos (2008). The method is demonstrated with an example.

Consider an $n \times n$ matrix polynomial $P(λ)$. An upper bound for a spectral norm distance from $P(λ)$ to the set of $n \times n$ matrix polynomials that have a given scalar $μ\in\mathbb{C}$ as a multiple eigenvalue was recently obtained by Papathanasiou and Psarrakos (2008). This paper concerns a refinement of this result for the case of weakly normal matrix polynomials. A modification method is implemented and its efficiency is verified by an illustrative example.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes