| 精化Arnoldi算法的截断版本 |
| |
| 引用本文： | 廉庆荣,张勇.精化Arnoldi算法的截断版本[J].大连理工大学学报,1997,37(5):508-511. |
| |
| 作者姓名： | 廉庆荣 张勇 |
| |
| 作者单位： | 大连理工大学应用数学系 |
| |
| 基金项目： | 国家自然科学基金,辽宁省自然科学基金 |
| |
| 摘 要： | 给出了精化Ａｒｎｏｌｄｉ算法的截断版本－精化不完全正交化方法，并分析了该算法敛性。分析结果表明：分析结果表明：如果不完全正交化过程得到的基向量线性无关性较强，则截断算法具有计算量，存储量少，且收敛快的优点。
|
| 关 键 词： | 特征值 Arnoldi算法 截断算法 矩阵 |
Truncated version of refined Arnoldi algorithm |
| |
| Lian Qingrong,Zhang Yong.Truncated version of refined Arnoldi algorithm[J].Journal of Dalian University of Technology,1997,37(5):508-511. |
| |
| Authors: | Lian Qingrong Zhang Yong |
| |
| 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. |
| |
| Keywords: | characteristic value problems algorithm convergence(mathematics)/refined Arnoldi algorithm refined incomplete orthogonalization algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
