[1] |
CARVER, M.B., AND MACEWEN, S.R. On the use of sparse matrix approximations to the Jacoblan m integrating large sets of ordinary differential equations. SIAM J. Sci. Star. Comput. (1981), 51-64. · Zbl 0477.65054 |
[2] |
COLEMAN, T.F., AND MORI , J.J. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer Anal. 20 (1983), 187-209. · Zbl 0527.65033 |
[3] |
CURTIS, A.R., AND REID, J.K. The choice of step lengths when using differences to approximate Jacoblan matrices. J Inst. Math AppL 13 (1974), 121-126. · Zbl 0273.65037 |
[4] |
CURTIS, A.R., POWELL, M.J.D., AND REID, J.K. On the estimatmn of sparse Jac’obian matrices. Inst Math. Appl. 13 (1974), 117-119. · Zbl 0273.65036 |
[5] |
EVERSTINE, G.C. A comparison of three resequencing algorithms for the reduction of matrix profile and wavefront. Int. J. Nurner Methods Eng. 14 (1979), 837-853. · Zbl 0401.73082 |
[6] |
GILL, P.E., MURRAY, W., AND WRIGHT, M.H. Practical Optimization. Academic Press, New York, 1981, 339-345. · Zbl 0503.90062 |
[7] |
GUSTAVSON, F.G. Finding the block lower triangular form of a sparse matrix. Sparse Matrix Computations, J.R. Bunch and D.J. Rose, Eds. Academic Press, New York, 1976, 275-289. · Zbl 0344.65012 |
[8] |
MATULA, D.W., AND BECK, L.L. Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30 3 (1983), 417-427. · Zbl 0628.68054 |