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

Lanczos 算法在具有规则谱分布的矩阵上的稳定性

Stability of the Lanczos algorithm on matrices with regular spectral distributions

Tyler Chen, Thomas Trogdon

AI总结:

本文证明当矩阵的经验谱分布接近具有良好正交多项式的规则参考测度时,Lanczos 算法可由后向稳定提升为前向稳定,揭示大型随机矩阵上的有限精度计算近乎确定性。

摘要:

我们研究了 Lanczos 算法在一类问题上的稳定性,这些问题的特征向量经验谱分布接近于一个具有良好正交多项式的参考测度。我们给出了一个后向稳定性结果;当参考测度的密度支撑在单个区间上,且在端点处具有平方根行为时,该结果可提升为前向稳定性结果。我们的分析表明,即使计算在有限精度算术下进行,Lanczos 算法在许多大型随机矩阵模型上运行时实际上也是前向稳定的,因而近乎确定性。由于 Lanczos 算法在一般情况下并非前向稳定,这又一次提供了例证,说明随机矩阵远非“任意普通矩阵”,因此在使用它们测试数值算法时必须谨慎。

英文摘要:

We study the stability of the Lanczos algorithm run on problems whose eigenvector empirical spectral distribution is near to a reference measure with well-behaved orthogonal polynomials. We give a backwards stability result which can be upgraded to a forward stability result when the reference measure has a density supported on a single interval with square root behavior at the endpoints. Our analysis implies the Lanczos algorithm run on many large random matrix models is in fact forward stable, and hence nearly deterministic, even when computations are carried out in finite precision arithmetic. Since the Lanczos algorithm is not forward stable in general, this provides yet another example of the fact that random matrices are far from "any old matrix", and care must be taken when using them to test numerical algorithms.

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

↑