ESTIMATION OF SPARSE HESSIAN MATRICES AND GRAPH-COLORING PROBLEMS

被引:94
作者
COLEMAN, TF [1 ]
MORE, JJ [1 ]
机构
[1] ARGONNE NATL LAB,DIV MATH & COMP SCI,ARGONNE,IL 60439
关键词
D O I
10.1007/BF02612334
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:243 / 270
页数:28
相关论文
共 13 条
[1]  
[Anonymous], 1968, J COMBIN THEORY
[2]   ESTIMATION OF SPARSE JACOBIAN MATRICES AND GRAPH-COLORING PROBLEMS [J].
COLEMAN, TF ;
MORE, JJ .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1983, 20 (01) :187-209
[3]  
COLEMAN TF, 1982, ANL8237 TECHN REP
[4]  
Curtis A. R., 1974, Journal of the Institute of Mathematics and Its Applications, V13, P117
[5]  
EISENSTAT S, 1980, COMMUNICATION
[6]   COMPARISON OF 3 RESEQUENCING ALGORITHMS FOR THE REDUCTION OF MATRIX PROFILE AND WAVEFRONT [J].
EVERSTINE, GC .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1979, 14 (06) :837-853
[7]  
Garey Michael R., 1979, COMPUTERS INTRACTABI
[8]  
Matula D., 1972, GRAPH THEORY COMPUTI, P104
[9]   SMALLEST-LAST ORDERING AND CLUSTERING AND GRAPH-COLORING ALGORITHMS [J].
MATULA, DW ;
BECK, LL .
JOURNAL OF THE ACM, 1983, 30 (03) :417-427
[10]   OPTIMAL APPROXIMATION OF SPARSE HESSIANS AND ITS EQUIVALENCE TO A GRAPH-COLORING PROBLEM [J].
MCCORMICK, ST .
MATHEMATICAL PROGRAMMING, 1983, 26 (02) :153-171