A CASE AGAINST A DIVIDE-AND-CONQUER APPROACH TO THE NONSYMMETRIC EIGENVALUE PROBLEM

被引:10
作者
JESSUP, ER
机构
[1] Department of Computer Science, University of Colorado, Boulder
基金
美国国家科学基金会;
关键词
D O I
10.1016/0168-9274(93)90101-V
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Divide and conquer techniques based on rank-one updating have proven fast, accurate, and efficient in parallel for the real symmetric tridiagonal and unitary eigenvalue problems and for the bidiagonal singular value problem. Although the divide and conquer mechanism can also be adapted to the real nonsymmetric eigenproblem in a straightforward way, most of the desirable characteristics of the other algorithms are lost. In this paper, we examine the problems of accuracy and efficiency that can stand in the way of a nonsymmetric divide and conquer eigensolver based on low-rank updating.
引用
收藏
页码:403 / 420
页数:18
相关论文
共 34 条
[1]  
ADAMS L, 1991, 918 U WASH DEP APPL
[2]   EXPONENTIAL INTERPOLATION - THEORY AND NUMERICAL ALGORITHMS [J].
AMMAR, G ;
DAYAWANSA, W ;
MARTIN, C .
APPLIED MATHEMATICS AND COMPUTATION, 1991, 41 (03) :189-232
[3]  
Ammar G., 1990, Robust Control of Linear Systems and Nonlinear Control. Proceedings of the International Symposium MTNS-89. Vol.II, P483
[4]   AN IMPLEMENTATION OF A DIVIDE-AND-CONQUER ALGORITHM FOR THE UNITARY EIGENPROBLEM [J].
AMMAR, GS ;
REICHEL, L ;
SORENSEN, DC .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1992, 18 (03) :292-307
[5]  
BARLOW J, 1991, CS9121 PENNS STAT U
[6]   ERROR ANALYSIS OF UPDATE METHODS FOR THE SYMMETRICAL EIGENVALUE PROBLEM [J].
BARLOW, JL .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1993, 14 (02) :598-618
[7]   RANK-ONE MODIFICATION OF SYMMETRIC EIGENPROBLEM [J].
BUNCH, JR ;
NIELSEN, CP ;
SORENSEN, DC .
NUMERISCHE MATHEMATIK, 1978, 31 (01) :31-48
[8]  
CUPPEN JJM, 1981, NUMER MATH, V36, P177, DOI 10.1007/BF01396757
[9]  
DONGARRA J, 1991, CS91130 U TENN DEP C
[10]  
DONGARRA J, 1990, ORNLTM11669 TECH REP