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

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

Numerical Analysis 2014-10-14 v1

Authors: E. Kokabifar , G. B. Loghmani , P. J. Psarrakos

Abstract

Consider an $n \times n$ matrix polynomial $P(\lambda)$ . An upper bound for a spectral norm distance from $P(\lambda)$ to the set of $n \times n$ matrix polynomials that have a given scalar $\mu\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.

Keywords

random matrix theory distance sets upper bounds

Cite

@article{arxiv.1410.3082,
  title  = {On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue},
  author = {E. Kokabifar and G. B. Loghmani and P. J. Psarrakos},
  journal= {arXiv preprint arXiv:1410.3082},
  year   = {2014}
}

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

Abstract

Keywords

Cite

Related papers