Efficient calculation of sparse Jacobians

SIAM Journal of Scientific Computing

Volumn 20, Issue 6, 1999, Pages 2282-2296

  Tolsma, John E ^a   Barton, Paul I ^a  

^a USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; LINEAR EQUATIONS; MATHEMATICAL OPERATORS; VECTORS;

AUTOMATIC DIFFERENTIATION; COMMON SUBEXPRESSIONS; JACOBIAN CALCULATION; SUBGRAPH REDUCTION;

DIFFERENTIATION (CALCULUS);

EID: 0033293993     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827597316552     Document Type: Article

References (5)

1. B. M. AVERICK, J. J. MORÉ, C. H. BISCHOF, A. CARLE, AND A. GRIEWANK, Computing large sparse Jacobian matrices using automatic differentiation, SIAM J. Sci. Comput., 15 (1994), pp. 285-294.
2. P. I. BARTON AND C. C. PANTELIDES, Modeling of combined discrete/continuous processes, AIChE J., 40 (1994), pp. 966-979.
3. C. H. BISCHOF, P. KHADEMI, A. BOUARICHA, AND A. CARLE, Efficient computation of gradients and Jacobians by transparent exploitation of sparsity in automatic differentiation, Optim. Methods Software, 7 (1996), pp. 1-39.
4. A. GRIEWANK, On automatic differentiation, in Mathematical Programming: Recent Developments and Applications, M. Iri and K. Tanabe, eds., Kluwer Academic Publishers, Norwell, MA, 1989, pp. 83 108.
5. J. A. VAN HULZEN, B. J. A. HULSHOF, B. L. GATES, AND M. C. VAN HEERWAARDEN, A code optimization package for REDUCE, in Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, G. H. Gonnet, ed., ACM Press, New York, 1989, pp. 163-170.