矩阵扰动后不同特征值数量的改进上界
An improved upper bound for the number of distinct eigenvalues of a matrix after perturbation
Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）
AI总结：
本文改进了矩阵扰动后不同特征值数量的上界，提出了新的估计方法，并展示了基于该估计的结果。
摘要：
本文改进了扰动矩阵不同特征值数量的上界，提出了新的估计方法，并展示了基于该估计的结果。
英文摘要：
An upper bound for the number of distinct eigenvalues of a perturbed matrix has been recently established by P. E. Farrell [1, Theorem 1.3]. The estimate is the central result in Farrell's work and can be applied to estimate the number of Krylov iterations required for solving a perturbed linear system. In this paper, we present an improved upper bound for the number of distinct eigenvalues of a matrix after perturbation. Furthermore, some results based on the improved estimate are presented.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
