求解实对称带状矩阵特征值问题的一种分治算法  

A DIVIDE AND CONQUER ALGORITHM FOR SOLVING THE EIGENVALUE PROBLEM OF REAL SYMMETRIC BAND MATRICES

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

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

出　　处：《数值计算与计算机应用》1998年第3期218-226,共9页Journal on Numerical Methods and Computer Applications

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

摘　　要：This paper presents a divide and conquer algorithm for solving the eigenvalue prob-lem of real symmetric band matrices. The new algorithm bases on homotopy con-tinuation, including inverse power iteration and inverse subspace iteration with shift.Numerical results show that our algorithm is strongly competitive with the known algo-rithms in speed. Above all, our algorithm is well suitable for parallel implementation.Numerical results of parallel computing are also presented in this paper.This paper presents a divide and conquer algorithm for solving the eigenvalue prob-lem of real symmetric band matrices. The new algorithm bases on homotopy con-tinuation, including inverse power iteration and inverse subspace iteration with shift.Numerical results show that our algorithm is strongly competitive with the known algo-rithms in speed. Above all, our algorithm is well suitable for parallel implementation.Numerical results of parallel computing are also presented in this paper.

关 键 词：特征值 矩阵 分治算法 解 

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