【摘要】 给出了精化Ａｒｎｏｌｄｉ算法的截断版本精化不完全正交化方法，并分析了该算法的收敛性．分析结果表明：如果不完全正交化过程得到的基向量线性无关性较强，则截断算法具有计算量、存储量少，且收敛快的优点．更多还原

【Abstract】 The truncated version of the refined Arnoldi algorithm, which is referred as refined incomplete orthogonalization algorithm, is presented. A convergence analysis is made for the new algorithm. It is shown that if the basis vectors generated by the incomplete orthogonalization process are strongly linearly independent, the truncated algorithm would have the advantages of less amounts of computation and storage as well as fast convergence speed.更多还原