We treat the problem of the Frobenius distance evaluation from a given matrix with distinct eigenvalues to the manifold of matrices with multiple eigenvalues. On restricting considerations to the rank real perturbation matrices, we prove that the distance in question equals where is a positive (generically, the least positive) zero of the algebraic equation and stands for the discriminant of the polynomial treated with respect to . In the framework of this approach we also provide the procedure for finding the nearest to 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本