摘要
讨论以牛顿与二阶拟牛顿混合迭代法计算位移的QL算法的收敛性及收敛速度。并提出了以威克逊[Wilkinson]位移复合混合迭代法计算位移。理论分析及数值计算表明与Wilkinson位移复合牛顿位移的情形相同,但减少了计算工作量。
The article gives a discussion about the convergence and the rate of convergence for the QL algorithm calculating shift with Newton and second order quasi-Newton mixed itera- tive method. Also it puts forward a method to calculate shift with Wilkinson's shift compound mixed iterative method. The theoretical analysis and numerical computation show that it is iden- tical with the case of Wilkinson's shift compound Newton's shift, while the computational load is reduced.
