References
- Bauer , F. L. 1974 . Computational graphs and rounding errors . SIAM J. Numer. Anal , 11 : 87 – 96 .
- Berz , M. , Bischof , C. , Corliss , G. and Griewank , A. Computational Differentiation: Techniques, Applications, and Tools . Proceedings Series . Edited by: Berz , M. , Bischof , C. , Corliss , G. and Griewank , A. SIAM .
- Bischof , C. , Bücker , M. , Hovland , P. , Naumann , U. and Utke , J. 2008 . “ Advances in Automatic Differentiation ” . In Lecture Notes in Computational Science and Engineering , Edited by: Bischof , C. , Bücker , M. , Hovland , P. , Naumann , U. and Utke , J. Vol. 64 , Berlin : Springer .
- Bücker , M. , Corliss , G. , Hovland , P. , Naumann , U. and Norris , B. 2005 . “ Automatic Differentiation: Applications, Theory, and Tools ” . In Lecture Notes in Computational Science and Engineering , Edited by: Bücker , M. , Corliss , G. , Hovland , P. , Naumann , U. and Norris , B. Vol. 50 , Berlin : Springer .
- Corliss , G. , Faure , C. , Griewank , A. , Hascoët , L. and Naumann , U. 2002 . Automatic Differentiation of Algorithms – From Simulation to Optimization , Edited by: Corliss , G. , Faure , C. , Griewank , A. , Hascoët , L. and Naumann , U. New York , NY : Springer .
- Corliss , G. and Griewank , A. Automatic Differentiation: Theory, Implementation, and Application . Proceedings Series . Edited by: Corliss , G. and Griewank , A. SIAM .
- Gilbert , J. 1980 . A note on the NP-completeness of vertex elimination on directed graphs . J. Algebr. Discret. Methods , 1 : 292 – 294 .
- Griewank , A. and Vogel , O. 2004 . “ Analysis and exploitation of Jacobian scarcity ” . In Modelling, Simulation and Optimization of Complex Processes , Edited by: Bock , H. , Kostina , E. , Phu , H. and Rannacher , R. 149 – 164 . New York , NY : Springer .
- Griewank , A. and Walther , A. 2008 . Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation , 2 , SIAM .
- Lyons , A. and Utke , J. 2008 . “ On the practical exploitation of scarsity ” . In Advances in Automatic Differentiation , 103 – 114 . Springer .
- Naumann , U. 2004 . Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph . Math. Program , 3 : 399 – 421 .
- Naumann , U. 2006 . Optimal Jacobian accumulation is NP-complete . Math. Program , 112 : 427 – 441 .
- Rose , D. and Tarjan , R. 1978 . Algorithmic aspects of vertex elimination on directed graphs . J. Appl. Math , 34 : 176 – 197 .