COMPLEXITY OF PARALLEL QR FACTORIZATION

被引：17

作者：

COSNARD, M

ROBERT, Y

机构：

[1] Univ de Grenoble, Fr, Univ de Grenoble, Fr

来源：

关键词：

All Open Access; Bronze;

D O I：

10.1145/6490.214102

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

MATHEMATICAL TECHNIQUES

引用

页码：712 / 723

页数：12

共 10 条

[1]

AHMED HM, 1982, COMPUTER, V15, P65, DOI 10.1109/MC.1982.1653828

[2] VERY HIGH-SPEED COMPUTING SYSTEMS [J].

FLYNN, MJ .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (12) :1901-&

[3]

GENTLEMAN WM, 1981, P SOC PHOTO-OPT INST, V298, P19

[4] SURVEY OF PARALLEL ALGORITHMS IN NUMERICAL LINEAR ALGEBRA [J].

HELLER, D .

[5]

HELLER DE, 1982, 1982 P C ADV RES VLS, P113

[6]

KUNG HT, 1979, 1978 SPARS MATR P, P256

[7]

Riordan J., 1958, INTRO COMBINATORIAL

[8]

SAMEH A, 1983, B EDF C, V1, P129

[9]

Sameh A. H., 1977, High Speed Computer and Algorithm Organization, P207

[10] STABLE PARALLEL LINEAR-SYSTEM SOLVERS [J].

SAMEH, AH ;

KUCK, DJ .