PARALLEL HOMOTOPY ALGORITHM FOR THE SYMMETRICAL TRIDIAGONAL EIGENVALUE PROBLEM

被引:13
|
作者
LI, TY
HONG, Z
SUN, XH
机构
[1] CLEMSON UNIV,DEPT MATH SCI,CLEMSON,SC 29634
[2] MICHIGAN STATE UNIV,DEPT COMP SCI,E LANSING,MI 48824
关键词
EIGENVALUES; MULTIPROCESSORS; TRIDIAGONAL MATRICES; HOMOTOPY CONTINUATION METHOD;
D O I
10.1137/0912026
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The parallel homotopy algorithm for finding few or all eigenvalues of a symmetric tridiagonal matrix is presented. The computations were executed on an NCUBE, a distributed memory multiprocessor. The numerical results show that the performance of our algorithm is strongly competitive with "divide and conquer" and bisection/multisection algorithms. The almost 100 percent efficiency seems to suggest that the natural parallelism of the homotopy method makes the algorithm an excellent candidate for a variety of architectures.
引用
收藏
页码:469 / 487
页数:19
相关论文
共 50 条