Distance Evaluation to the Set of Defective Matrices
Abstract
We treat the problem of the Frobenius distance evaluation from a given matrix A ∈ Rn× n with distinct eigenvalues to the manifold of matrices with multiple eigenvalues. On restricting considerations to the rank 1 real perturbation matrices, we prove that the distance in question equals z where z is a positive (generically, the least positive) zero of the algebraic equation F(z) = 0, \ where \ F(z):= Dλ ( [ (λ I - A)(λ I - A)-z In ] )/zn and Dλ 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 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.
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.