On the distance from a matrix polynomial to matrix polynomials with k prescribed distinct eigenvalues
Abstract
Consider an n× n matrix polynomial P(λ) and a set Σ consisting of k n distinct complex numbers. In this paper, a (weighted) spectral norm distance from P(λ) to the matrix polynomials whose spectra include the specified set Σ, is defined and studied. An upper and a lower bounds for this distance are obtained, and an optimal perturbation of P(λ) associated to the upper bound is constructed. Numerical examples are given to illustrate the efficiency of the proposed bounds.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.