Let $A$ be a real matrix with all distinct eigenvalues. We propose a new method for the computation of the distance $w_\R(A)$ of the matrix $A$ from the set of real defective matrices, i.e., the set of those real matrices with at least one multiple eigenvalue with algebraic multiplicity larger than its geometric multiplicity. For $0 < \eps \le w_\R(A)$, this problem is closely related to the computation of the most ill-conditioned $\eps$-pseudoeigenvalues of $A$, that is points in the $\eps$-pseudospectrum of $A$ characterized by the highest condition number. The method we propose couples a system of differential equations on a low rank manifold which determines the $\eps$-pseudoeigenvalue closest to coalesce, with a fast Newton-like iteration aiming to determine the minimal value $\eps$ such that an $\eps$-pseudoeigenvalue becomes defective. The method has a local behaviour; this means that in general we find upper bounds for $w_\R(A)$. However, they usually provide good approximations, in those (simple) cases where we can check this. % The methodology can be extended to a structured matrix, where it is required that the distance is computed within some manifold defining the structure of the matrix. In this paper we extensively examine the case of real matrices. As far as we know, there do not exist methods in the literature able to compute such distance.
Differential equations for real-structured defectivity measures.
GUGLIELMI, NICOLA;
2015-01-01
Abstract
Let $A$ be a real matrix with all distinct eigenvalues. We propose a new method for the computation of the distance $w_\R(A)$ of the matrix $A$ from the set of real defective matrices, i.e., the set of those real matrices with at least one multiple eigenvalue with algebraic multiplicity larger than its geometric multiplicity. For $0 < \eps \le w_\R(A)$, this problem is closely related to the computation of the most ill-conditioned $\eps$-pseudoeigenvalues of $A$, that is points in the $\eps$-pseudospectrum of $A$ characterized by the highest condition number. The method we propose couples a system of differential equations on a low rank manifold which determines the $\eps$-pseudoeigenvalue closest to coalesce, with a fast Newton-like iteration aiming to determine the minimal value $\eps$ such that an $\eps$-pseudoeigenvalue becomes defective. The method has a local behaviour; this means that in general we find upper bounds for $w_\R(A)$. However, they usually provide good approximations, in those (simple) cases where we can check this. % The methodology can be extended to a structured matrix, where it is required that the distance is computed within some manifold defining the structure of the matrix. In this paper we extensively examine the case of real matrices. As far as we know, there do not exist methods in the literature able to compute such distance.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.