arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.05136math.OCcs.NAmath.NA
收藏

基于插值的全局证书快速计算Sep $_λ$

Fast Computation of Sep$_λ$ via Interpolation-based Globality Certificates

Tim Mitchell

摘要:

给定两个方阵$A$和$B$,我们提出了一种新的计算最小值$\varepsilon \geq 0$的方法,使得$A+E$和$A+F$共享一个特征值,其中$\|E\|=\|F\|=\varepsilon$ . 2006年,顾和奥弗顿提出了第一个计算这个量的算法,称为$\mathrm{sep}_λ(A,B)$(“sep-lambda”),使用的思想来自顾早期计算不可控距离的算法。然而,Gu和Overton的算法非常昂贵,这将其限制在最小的问题上,并且直到现在,还没有其他算法。我们的新算法可以快几个数量级,并可以解决$A$和$B$是中等大小的问题。此外,我们的方法由许多“并行”计算组成,因此可以在多核硬件上进一步加速。最后,我们还提出了第一个算法来计算一个早期版本的sep-lambda其中$\|E\| + \|F\|=\varepsilon$。

英文摘要:

Given two square matrices $A$ and $B$, we propose a new approach for computing the smallest value $\varepsilon \geq 0$ such that $A+E$ and $A+F$ share an eigenvalue, where $\|E\|=\|F\|=\varepsilon$. In 2006, Gu and Overton proposed the first algorithm for computing this quantity, called $\mathrm{sep}_λ(A,B)$ ("sep-lambda"), using ideas inspired from an earlier algorithm of Gu for computing the distance to uncontrollability. However, the algorithm of Gu and Overton is extremely expensive, which limits it to the tiniest of problems, and until now, no other algorithms have been known. Our new algorithm can be orders of magnitude faster and can solve problems where $A$ and $B$ are of moderate size. Moreover, our method consists of many "embarrassingly parallel" computations, and so it can be further accelerated on multi-core hardware. Finally, we also propose the first algorithm to compute an earlier version of sep-lambda where $\|E\| + \|F\|=\varepsilon$.

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

↑