On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
E. Kokabifar, G.B. Loghmani, P.J. Psarrakos

TL;DR
This paper refines existing bounds on the spectral norm distance from a matrix polynomial to those with a specified multiple eigenvalue, focusing on weakly normal polynomials and demonstrating an effective modification method.
Contribution
It provides a refined upper bound for weakly normal matrix polynomials and introduces a modification method with verified efficiency.
Findings
Refined upper bound for weakly normal matrix polynomials.
Implementation of a modification method.
Efficiency verified through an illustrative example.
Abstract
Consider an matrix polynomial . An upper bound for a spectral norm distance from to the set of matrix polynomials that have a given scalar 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Spectral Theory in Mathematical Physics
