COMPUTATIONAL COMPLEXITY OF OPERATIONS INVOLVING PERFECT ELIMINATION SPARSE MATRICES

被引：3

作者：

ALVARADO, FL ^{[1
]}

机构：

[1] UNIV WISCONSIN,MADISON,WI 53706

来源：

关键词：

D O I：

10.1080/00207167708803127

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：69 / 82

页数：14

共 9 条

[1] COMPUTATIONAL COMPLEXITY IN POWER-SYSTEMS
ALVARADO, FL
[J]. IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1976, 95 (04): : 1028 - 1037
[2] ALVARADO FL, 1976, JUL IEEE SUMM POW M
[3] BUNCH JR, 1973, COMPLEXITY SEQUENTIA
[4] COMPUTING CERTAIN ELEMENTS OF INVERSE OF A SPARSE MATRIX
ERISMAN, AM
TINNEY, WF
[J]. COMMUNICATIONS OF THE ACM, 1975, 18 (03) : 177 - 179
[5] GAUSSIAN ELIMINATION IS NOT OPTIMAL
STRASSEN, V
[J]. NUMERISCHE MATHEMATIK, 1969, 13 (04) : 354 - &
[6] TAKAHASHI K, 1973, 1973 PICA C P MINN M, P63
[7] Tewarson R. P., 1973, SPARSE MATRICES
[8] DIRECT SOLUTIONS OF SPARSE NETWORK EQUATIONS BY OPTIMALLY ORDERED TRAINGULAR FACTORIZATION
TINNEY, WF
WALKER, JW
[J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (11): : 1801 - &
[9] TINNEY WF, 1974, JUN P JOINT NSF NCS