| 解非对称矩阵特征值问题的一种并行分治算法 |
| |
| 引用本文： | 罗晓广,李晓梅.解非对称矩阵特征值问题的一种并行分治算法[J].高等学校计算数学学报,1999,21(2):140-149. |
| |
| 作者姓名： | 罗晓广 李晓梅 |
| |
| 作者单位： | 国防科技大学计算机系!长沙410073 |
| |
| 基金项目： | 自然科学基金，国防预研基金 |
| |
| 摘 要： | １引言考虑矩阵特征值问题其中Ａ是非对称矩阵．通过正交变换（如Ｈｏｕｓｅｈｏｌｄｅｒ变换或Ｇｉｖｅｎｓ变换），Ａ可化为上Ｈｅｓｓｅｎｂｅｒｇ形．因而，本文假设Ａ为上Ｈｅｓｓｅｎｂｅｒｇ矩阵，表示如下：不失一般性，进一步假设所有的（ｊ＝２，…，ｎ），即认为Ａ是不可约的关于如何求解上述问题，人们进行了不懈的努力，提出了许多行之有效的算法［１－８］．其中分治算法因具有良好的并行性而引人注目．分治算法的典型代表是基于同伦连续的分治算法［２，３，４］和基于Ｎｅｗｔｏｎ迭代的分治算法［１］．本文提出一种新的分…
|
| 关 键 词： | 非对称矩阵 特征值 并行分治算法 |
A PARALLEL DIVIDE-AND-CONQUER ALGORITHM FOR SOLVING EIGENVALUE PROBLEM OF NONSYMMETRIC MATRICES |
| |
| Luo Xiaoguang,Li Xiaomei.A PARALLEL DIVIDE-AND-CONQUER ALGORITHM FOR SOLVING EIGENVALUE PROBLEM OF NONSYMMETRIC MATRICES[J].Numerical Mathematics A Journal of Chinese Universities,1999,21(2):140-149. |
| |
| Authors: | Luo Xiaoguang Li Xiaomei |
| |
| Affiliation: | National University of Defense Technology |
| |
| Abstract: | This paper presents a divide-and-conquer algorithm for solving eigenvalue problem of nonsymmetric matrices. The new algorithm bases on Languerre iteration. Theoretical analysis and Numerical results show that our algorithm is faster, and able to obtain more different eigenvalues than J. J. Dengarra's algorithm presented in 1]. Above all, our afeorithm is well suitable to parallel implementation. Numerical results of parallel computing are also presented in this paper. The parallel efficiency is encouraging. |
| |
| Keywords: | Divide-and-conquer languerre iteration eigenvalue problem parallel computing |
| 本文献已被 CNKI 维普 等数据库收录！ |
