Markowitz-type heuristics for computing Jacobian matrices efficiently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2658, Issue , 2003, Pages 575-584

  Albrecht, Andreas ^c   Gottschling, Peter ^a   Naumann, Uwe ^b  

^a UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

^b ARGONNE NATIONAL LABORATORY   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA;

ARITHMETIC OPERATIONS; COMPUTATIONAL GRAPH; EDGE-ELIMINATION; MARKOWITZ; NONLINEAR VECTOR FUNCTION; TIE-BREAKING; VERTEX ELIMINATION;

JACOBIAN MATRICES;

EID: 35248871225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44862-4_61     Document Type: Article

References (18)

1. Griewank, A., Reese, S.: On the calculation of Jacobian matrices by the Markovitz rule. In: [5]. (1991) 126-135
2. Naumann, U.: Optimal accumulation of Jacobians by elimination methods on the dual computational graph. Mathematical Programming (2002) to appear.
3. Berz, M., Bischof, C., Corliss, G., Griewank, A., eds.: Computational Differentiation: Techniques, Applications, and Tools, Philadelphia, SIAM (1996)
4. Corliss, G., Faure, C., Griewank, A., Hascoet, L., Naumann, U., eds.: Automatic Differentiation of Algorithms - from Simulation to Optimization, New York, Springer (2002)
5. Corliss, G., Griewank, A., eds.: Automatic Differentiation: Theory, Implementation, and Application, Philadelphia, SIAM (1991)
6. Griewank, A.: Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation. Number 19 in Frontiers in Applied Mathematics. SIAM, Philadelphia (2000)
7. Naumann, U.: Efficient Calculation of Jacobian Matrices by Optimized Application of the Chain Rule to Computational Graphs. PhD thesis, Technical University Dresden (1999)
8. Bischof, C., Haghighat, M.: Hierarchical approaches to automatic differentiation. In: [3]. (1996) 82-94
9. Herley, K.: A note on the NP-completeness of optimum Jacobian accumulation by vertex elimination. Presentation at: Theory Institute on Combinatorial Challenges in Computational Differentiation (1993)
10. Gilbert, J.: A note on the NP-completeness of vertex elimination on directed graphs. J. Alg. Disc. Meth. 1 (1980) 292-294
11. Rose, D., Tarjan, R.: Algorithmic aspects of vertex elimination on directed graphs. J. Appl. Math. 34 (1978) 176-197
12. Naumann, U.: An enhanced Markowitz rule for accumulating Jacobians efficiently. In Mikula, K., ed.: ALGORITHMY'2000 Conference on Scientific Computing, Slovak University of Technology, Bratislava, Slovakia (2000) 320-329
13. Tadjouddine, M., Forth, S., Pryce, J., Reid, J.: Performance issues for vertex elimination methods in computing Jacobians using Automatic Differentiation. In: Proceedings of the ICCS 2000 Conference. Volume 2330 of Springer LNCS. (2002) 1077-1086
14. Roe, P.: Approximating Riemann solvers, parameter vectors, and difference schemes. J. Comp. Physics (1981) 357-372
15. Averik, B., Carter, R., Moré, J.: The MINPACK-2 test problem collection (preliminary version). Technical Report 150, Mathematical and Computer Science Division, Argonne National Laboratory (1991)
16. Albrecht, A., Gottschling, P., Naumann, U.: Logarithmic simulated annealing for optimal derivative code. Technical Report 372, University of Hertfordshire (2002)
17. Naumann, U., Gottschling, P.: Prospects for simulated annealing in automatic differentiation. In Steinhofel, K., ed.: SAGA 2002 - Stochastic Algorithms, Foundations and Applications. Volume 2264 of LNCS., Springer, Berlin (2001) 131-144
18. Albrecht, A., Wong, C.: On logarithmic simulated annealing. In van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P., eds.: Proc. IFIP International Conference on Theoretical Computer Science. LNCS, Springer (2000)