PREDICTING FILL FOR SPARSE ORTHOGONAL FACTORIZATION

被引：43

作者：

COLEMAN, TF

EDENBRANDT, A

GILBERT, JR

机构：

[1] Cornell Univ, Ithaca, NY, USA, Cornell Univ, Ithaca, NY, USA

来源：

JOURNAL OF THE ACM | 1986年 / 33卷 / 03期

关键词：

All Open Access; Bronze;

D O I：

10.1145/5925.5932

中图分类号：

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

学科分类号：

0812 ;

摘要：

MATHEMATICAL TECHNIQUES

引用

页码：517 / 532

页数：16

共 25 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] SOME RESULTS ON SPARSE MATRICES [J].

BRAYTON, RK ;

GUSTAVSO.FG ;

WILLOUGH.RA .

MATHEMATICS OF COMPUTATION, 1970, 24 (112) :937-&

[3]

Bunch J. R., 1976, SPARSE MATRIX COMPUT

[4] ON ALGORITHMS FOR OBTAINING A MAXIMUM TRANSVERSAL [J].

DUFF, IS .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1981, 7 (03) :315-330

[5]

Dulmage A. L., 1958, CAN J MATH, V10, P517, DOI DOI 10.4153/CJM-1958-052-0

[6] 2 ALGORITHMS FOR BIPARTITE GRAPHS [J].

DULMAGE, AL ;

MENDELSOHN, NS .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1963, 11 (01) :183-194

[7]

Dulmage AL, 1959, T ROY SOC CAN, V3, P1

[8]

Federer H., 1969, GRUNDLEHREN MATH WIS

[9]

Ford L., 1962, FLOWS NETWORKS

[10]

GENTLEMAN WM, 1975, P DUNDEE C NUMERICAL, V506, P122

← 1 2 3 →