COMMUNICATION COMPLEXITY OF THE GAUSSIAN-ELIMINATION ALGORITHM ON MULTIPROCESSORS

被引:18
作者
SAAD, Y
机构
关键词
D O I
10.1016/0024-3795(86)90174-6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:315 / 340
页数:26
相关论文
共 13 条
[1]  
ADAMS LM, 1982, THESIS U VIRGINIA
[2]  
ADAMS LM, NASA166027 CONTR REP
[3]  
GANNON D, 1984, ICASE8441 TECHN REP
[4]   SOME COMPLEXITY RESULTS FOR MATRIX COMPUTATIONS ON PARALLEL PROCESSORS [J].
GENTLEMAN, WM .
JOURNAL OF THE ACM, 1978, 25 (01) :112-115
[5]   SURVEY OF PARALLEL ALGORITHMS IN NUMERICAL LINEAR ALGEBRA [J].
HELLER, D .
SIAM REVIEW, 1978, 20 (04) :740-777
[6]   COMPLEXITY OF DENSE-LINEAR-SYSTEM SOLUTION ON A MULTIPROCESSOR RING [J].
IPSEN, ICF ;
SAAD, Y ;
SCHULTZ, MH .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1986, 77 :205-239
[7]  
KAMATH C, 1984, ANLMCSTM28 TECHN REP
[8]   THE COMPUTATION AND COMMUNICATION COMPLEXITY OF A PARALLEL BANDED SYSTEM SOLVER [J].
LAWRIE, DH ;
SAMEH, AH .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1984, 10 (02) :185-195
[9]  
Mead C., 1980, INTRO VLSI SYSTEMS
[10]  
OLEARY DP, 1984, 1366 U MAR DEP COMP