PARALLEL SOLUTION OF CERTAIN TOEPLITZ LINEAR-SYSTEMS

被引:51
作者
BINI, D
机构
关键词
D O I
10.1137/0213019
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:268 / 276
页数:9
相关论文
共 19 条
[1]  
Bini D., 1980, Calcolo, V17, P87, DOI 10.1007/BF02575865
[2]   O(N2.7799) COMPLEXITY FOR N BY N APPROXIMATE MATRIX MULTIPLICATION [J].
BINI, D ;
CAPOVANI, M ;
ROMANI, F ;
LOTTI, G .
INFORMATION PROCESSING LETTERS, 1979, 8 (05) :234-235
[3]  
BINI D, 1982, TRB8203 IEI CNR
[4]  
BINI D., 1980, LECT NOTES COMPUT SC, V85, P98
[5]  
BINI D, 1979, SIAM J COMP, V9, P692
[6]  
Borodin A., 1975, COMPUTATIONAL COMPLE
[7]   TIME AND PARALLEL PROCESSOR BOUNDS FOR LINEAR RECURRENCE SYSTEMS [J].
CHEN, SC ;
KUCK, DJ .
IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (07) :701-717
[8]  
CHEN SC, 1975, THESIS U ILLINOIS UR
[9]   ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATION [J].
COPPERSMITH, D ;
WINOGRAD, S .
SIAM JOURNAL ON COMPUTING, 1982, 11 (03) :472-492
[10]  
COPPERSMITH D, 1981, ASYMPTOTIC COMPLEXIT