arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.3592math.NAcs.NA
收藏

关于实结构(和无结构)缺陷性度量的微分方程

Differential equations for real-structured (and unstructured) defectivity measures

SAPIENZA Università di Roma(罗马大学);Università degli studi di L’Aquila(拉奎拉大学)

Paolo Buttà, Nicola Guglielmi, Manuela Manetta, Silvia Noschese

AI总结:

本文提出了一种新的方法,用于计算矩阵到缺陷矩阵集的距离,该方法结合了低秩(可能带结构)流形上的微分方程系统和快速牛顿迭代法,以确定最小的ε值,使得ε-伪特征值变为缺陷值。

摘要:

设A是一个具有所有不同特征值的复数或实数矩阵。我们提出了一种新的方法,用于计算矩阵A到缺陷矩阵集的距离w_ℚ(A)(其中ℚ=C如果考虑一般的复数矩阵,ℚ=R如果仅考虑实数矩阵)。对于0 < ε ≤ w_ℚ(A),该问题与计算A的最病态的ε-伪特征值密切相关,即那些具有最高条件数的ε-伪谱点。我们提出的方法结合了一个在低秩(可能带结构)流形上的微分方程系统,该系统计算A中最接近共合的ε-伪特征值,以及一个快速牛顿迭代法,旨在确定最小的ε值,使得这样的ε-伪特征值变为缺陷值。该方法具有局部行为;这意味着通常我们找到w_ℚ(A)的上界。然而,这些通常在那些(简单)情况下提供良好的近似值,其中我们可以检查这一点。该方法可以扩展到结构矩阵,其中要求距离在某些定义矩阵结构的流形上计算。在本文中,我们详细研究了实数矩阵的情况,但也考虑了模式结构。据我们所知,文献中尚不存在能够计算此类距离的方法。

英文摘要:

Let $A$ be either a complex or real matrix with all distinct eigenvalues. We propose a new method for the computation of both the unstructured and the real-structured (if the matrix is real) distance $w_{\mathbb K}(A)$ (where ${\mathbb K}=\mathbb C$ if general complex matrices are considered and ${\mathbb K} ={\mathbb R}$ if only real matrices are allowed) of the matrix $A$ from the set of defective matrices, that is the set of those matrices with at least a multiple eigenvalue with algebraic multiplicity larger than its geometric multiplicity. For $0 < \varepsilon \le w_{\mathbb K}(A)$, this problem is closely related to the computation of the most ill-conditioned $\varepsilon$-pseudoeigenvalues of $A$, that is points in the $\varepsilon$-pseudospectrum of $A$ characterized by the highest condition number. The method we propose couples a system of differential equations on a low rank (possibly structured) manifold which computes the $\varepsilon$-pseudoeigenvalue of $A$ which is closest to coalesce, with a fast Newton-like iteration aiming to determine the minimal value $\varepsilon$ such that such an $\varepsilon$-pseudoeigenvalue becomes defective. The method has a local behaviour; this means that in general we find upper bounds for $w_{\mathbb K}(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 but we also consider pattern structures. As far as we know there do not exist methods in the literature able to compute such distance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑