| 一种求解大型稀疏对称矩阵(极端)特征值问题的有效算法 |
| |
| 引用本文： | 杜玉越.一种求解大型稀疏对称矩阵(极端)特征值问题的有效算法[J].计算物理,1996,13(3):359-365. |
| |
| 作者姓名： | 杜玉越 |
| |
| 作者单位： | 聊城师范学院计算中心, 山东聊城 252059 |
| |
| 摘 要： | 提出一种求解大型稀疏对称矩阵几个最大(最小)特征值和相应特征向量的迭代块DL(即Davidson-Lanczos)算法并且讨论了迭代块DL算法的收敛率
|
| 关 键 词： | 对称矩阵 特征值和特征向量 DL算法 迭代块DL算法 |
| 收稿时间： | 1995-01-02 |
AN EFFECTIVE ALGORITHM FOR SOLVING (THE LARGEST OR LOWEST) EIGENPROBLEMS OF LARGE SPARSE SYMMETRIC MATRICES |
| |
| Du Yuyue.AN EFFECTIVE ALGORITHM FOR SOLVING (THE LARGEST OR LOWEST) EIGENPROBLEMS OF LARGE SPARSE SYMMETRIC MATRICES[J].Chinese Journal of Computational Physics,1996,13(3):359-365. |
| |
| Authors: | Du Yuyue |
| |
| Institution: | Computing Center, Liaocheng Teachers College, Shandong Liaocheng 252059 |
| |
| Abstract: | An iterative block DL (i.e. Davidson-Lanczos) algorithm is presented for computing a few of the largest (or lowest) eigenvalues and corresponding eigenvectors of very large sparse symmetric matrices. It's convergence rate is also discussed. it overcomes the disadvantages of the DL method which cann't find multiple or clustered eigenvalues, and the convergence speed of the mesent method is far faster than the DL method. Numerical results are compared whith those by the DL algorithm in a few experiments which exhibit a sharp-superiority of the new approach. |
| |
| Keywords: | Symmetric matrix eigenvalue and eigenvector DL algorithm iterative block DL algorithm |
| 本文献已被 维普 等数据库收录！ |
| 点击此处可从《计算物理》浏览原始摘要信息 |
| 点击此处可从《计算物理》下载免费的PDF全文 |
