Ogita-Aishima重特征值对称特征分解精化算法的不动点分析
Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues
摘要:
最近,Ogita和Aishima提出了一个有效的特征分解细化算法的对称特征值问题。他们的基本算法包括除以两个近似特征值的差,并且当存在多个特征值时可能变得不稳定。为了解决这个问题,他们提出用不同的方程代替那些导致不稳定的方程,并给出了所得算法的收敛性证明。然而,这是不直观地理解为什么修改后的算法的作品,因为它删除了一些充要条件获得的特征分解。我们利用Banach不动点定理给出了这个问题的答案。
英文摘要:
Recently, Ogita and Aishima proposed an efficient eigendecomposition refinement algorithm for the symmetric eigenproblem. Their basic algorithm involves division by the difference of two approximate eigenvalues, and can become unstable when there are multiple eigenvalues. To resolve this problem, they proposed to replace those equations that casue instability with different equations and gave a convergence proof of the resulting algorithm. However, it is not straightforward to understand intuitively why the modified algorithm works, because it removes some of the necessary and sufficient conditions for obtaining the eigendecomposition. We give an answer to this question using Banach's fixed-point theorem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。