解非对称矩阵特征值问题的一种并行分治算法  

A PARALLEL DIVIDE-AND-CONQUER ALGORITHM FOR SOLVING EIGENVALUE PROBLEM OF NONSYMMETRIC MATRICES

作　　者：罗晓广[1] 李晓梅[1] 

机构地区：[1]国防科技大学计算机系,长沙410073

出　　处：《高等学校计算数学学报》1999年第2期140-149,共10页Numerical Mathematics A Journal of Chinese Universities

基　　金：自然科学基金;国防预研基金

摘　　要：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.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.

关 键 词：非对称矩阵 特征值 并行分治算法 

分 类 号：O241.6[理学—计算数学]