The efficient computation of sparse jacobian matrices using automatic differentiation

SIAM Journal on Scientific Computing

Volumn 19, Issue 4, 1998, Pages 1210-1233

  Coleman, Thomas F ^a   Verma, Arun ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

ADOL C; Automatic differentiation; Bicoloring; Computational differentiation; Graph coloring; Nonlinear least squares; Nonlinear systems of equations; NP complete problems; Partition problem; Sparse finite differencing; Sparse jacobian matrices

Indexed keywords

EID: 0005440938     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595295349     Document Type: Article

References (15)

1. B. M. AVERICK, J. J. MORÉ, AND C. H. BISCHOF, Computing Large Sparse Jacobian Matrices Using Automatic Differentiation, Preprint MCS-P348-0193, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, April 1993
2. C. H. BISCHOF, A. BOUARICHA, P. M. KHADEMI, AND J. J. MORÉ, Computing gradients in large-scale optimization using automatic differentiation, SIAM J. Alg. Discrete Methods, 7 (1986), pp. 221-235.
3. T. F. COLEMAN AND J.-Y. CAI, The cyclic coloring problem and estimation of sparse Hessian matrices, SIAM J. Alg. Discrete Methods, 7 (1986), pp. 221-235.
4. T. F. COLEMAN, B. S. GARBOW, AND J. J. MORÉ, Software for estimating sparse Jacobian matrices, ACM Trans. Math. Software, 10 (1984), pp. 329-345.
5. T. F. COLEMAN, B. S. GARBOW, AND J. J. MORÉ, Software for estimating sparse Hessian matrices, ACM Trans. Math. Software, 11 (1985), pp. 363-377.
6. T. F. COLEMAN AND J. J. MORE, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J. Numer. Anal., 20 (1983), pp. 187-209.
7. T. F. COLEMAN AND J. J. MORE, Estimation of sparse Hessian matrices and graph coloring problems, Math. Programming, 28 (1984), pp. 243-270.
8. A. R. CURTIS, M. J. D. POWELL, AND J. K. REID, On the estimation of sparse Jacobian matrices, J. Inst. Math. Appl., 13 (1974), pp. 117-119.
9. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, San Francisco, 1979.
10. P. E. GILL, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT, Computing forward-difference intervals for numerical optimization, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 310-321.
11. A. GRIEWANK, Some bounds on complexity of gradients, Jacobians and Hessians, in Complexity in Numerical Optimization, P. M. Pardalos, ed., World Scientific Publishing Co., River Edge, NJ, 1993.
12. A. GRIEWANK, D. JUEDES, AND J. UTKE, ADOL-C: A package for automatic differentiation of algorithms written in C/C++, ACM Trans. Math. Software, 22 (1996), pp. 131-167.
13. A. GRIEWANK, Direct calculation of Newton steps without accumulating Jacobians, in Large-Scale Numerical Optimization, T. F. Coleman and Y. Li, eds., SIAM, Philadelphia, 1990, pp. 115-137.
14. A. K. M. S. HOSSAIN AND T. STEIHAUG, Computing a Sparse Jacobian Matrix by Rows and Columns, Tech. Report 109, Department of Informatics, University of Bergen, Bergen, 1995.
15. M. J. D. POWELL AND PH. L. TOINT, On the estimation of sparse Hessian matrices, SIAM J. Numer. Anal., 16 (1979), pp. 1060-1074.