简单移位策略的收敛速度到收缩
Convergence rates to deflation of simple shift strategies
AI总结:
本文研究了实对称三对角矩阵QR迭代中简单移位策略的收缩性质,证明了连续移位策略可能不收缩,而收缩时收敛速度至少二次,若移位函数光滑且谱无等差三项则三次。
摘要:
实对称三对角矩阵的特征值计算通常通过一系列带移位的QR步骤进行。我们引入简单移位策略,即满足自然条件的函数σ,将每个n×n矩阵T映射到实数σ(T)。该策略指定了在T处应用QR步骤时的移位。Rayleigh和Wilkinson策略是简单移位策略的例子。我们证明,如果σ连续,则存在初始条件使得收缩不发生,即次对角线元素不趋于零。在收缩的情况下,我们考虑(n, n-1)元素趋于零的收敛速度:对于简单移位策略,这总是至少二次的。如果函数σ在适当区域光滑且T的谱不包含三个等差连续特征值,则收敛是三次的。这意味着对于一般谱,Wilkinson移位的收缩收敛是三次的。算法在收缩附近的研究使用管状坐标,在此坐标下,带移位的QR步骤由简单公式给出。
英文摘要:
The computation of eigenvalues of real symmetric tridiagonal matrices frequently proceeds by a sequence of QR steps with shifts. We introduce simple shift strategies, functions sigma satisfying natural conditions, taking each n x n matrix T to a real number sigma(T). The strategy specifies the shift to be applied by the QR step at T. Rayleigh and Wilkinson's are examples of simple shift strategies. We show that if sigma is continuous then there exist initial conditions for which deflation does not occur, i.e., subdiagonal entries do not tend to zero. In case of deflation, we consider the rate of convergence to zero of the (n, n-1) entry: for simple shift strategies this is always at least quadratic. If the function sigma is smooth in a suitable region and the spectrum of T does not include three consecutive eigenvalues in arithmetic progression then convergence is cubic. This implies cubic convergence to deflation of Wilkinson's shift for generic spectra. The study of the algorithm near deflation uses tubular coordinates, under which QR steps with shifts are given by a simple formula.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。