A NONDETERMINISTIC PARALLEL ALGORITHM FOR GENERAL UNSYMMETRIC SPARSE LU FACTORIZATION

被引:17
作者
DAVIS, TA [1 ]
YEW, PC [1 ]
机构
[1] EUROPEAN CTR RES & ADV TRAINING SCI COMPUTAT,F-31057 TOULOUSE,FRANCE
关键词
D O I
10.1137/0611028
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:383 / 402
页数:20
相关论文
共 43 条
[1]   SPARSE GAUSSIAN-ELIMINATION WITH CONTROLLED FILL-IN ON A SHARED MEMORY MULTIPROCESSOR [J].
ALAGHBAND, G ;
JORDAN, HF .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) :1539-1557
[2]  
AMESTOY PR, 1989, HIGH PERFORMANCE COMPUTING /, P19
[3]   VECTORIZATION OF A MULTIPROCESSOR MULTIFRONTAL CODE [J].
AMESTOY, PR ;
DUFF, IS .
INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1989, 3 (03) :41-59
[4]  
CALAHAN DA, 1973, 11TH P ANN ALL C CIR, P729
[5]  
Curtis A. R., 1972, Journal of the Institute of Mathematics and Its Applications, V10, P118
[6]   PAIRWISE REDUCTION FOR THE DIRECT, PARALLEL SOLUTION OF SPARSE, UNSYMMETRIC SETS OF LINEAR-EQUATIONS [J].
DAVIS, TA ;
DAVIDSON, ES .
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (12) :1648-1654
[7]  
DAVIS TA, 1989, SIAM S SPARSE MATRIC
[8]  
DAVIS TA, 1989, 907 U ILL CTR SUP RE
[9]  
DONGARRA JJ, IN PRESS ACM T MATH
[10]  
DONGARRA JJ, 1988, ANL TM88 REP