English

Distance Evaluation to the Set of Defective Matrices

Symbolic Computation 2023-03-14 v1

Abstract

We treat the problem of the Frobenius distance evaluation from a given matrix ARn×n A \in \mathbb R^{n\times n} with distinct eigenvalues to the manifold of matrices with multiple eigenvalues. On restricting considerations to the rank 1 1 real perturbation matrices, we prove that the distance in question equals z \sqrt{z_{\ast}} where z z_{\ast} is a positive (generically, the least positive) zero of the algebraic equation F(z)=0, \mboxwhere F(z):=Dλ(det[(λIA)(λIA)zIn])/zn \mathcal F(z) = 0, \ \mbox{where} \ \mathcal F(z):= \mathcal D_{\lambda} \left( \det \left[ (\lambda I - A)(\lambda I - A^{\top})-z I_n \right] \right)/z^n and Dλ \mathcal D_{\lambda} stands for the discriminant of the polynomial treated with respect to λ\lambda . In the framework of this approach we also provide the procedure for finding the nearest to A A matrix with multiple eigenvalue. Generalization of the problem to the case of complex perturbations is also discussed. Several examples are presented clarifying the computational aspects of the approach.

Keywords

Cite

@article{arxiv.2303.07235,
  title  = {Distance Evaluation to the Set of Defective Matrices},
  author = {Alexei Yu. Uteshev and Elizaveta A. Kalinina and Marina V. Goncharova},
  journal= {arXiv preprint arXiv:2303.07235},
  year   = {2023}
}

Comments

28 pages, 1 figure