Elimination Techniques for Cheap Jacobians

  • Uwe Naumann


The generation of optimized code for evaluating the Jacobian matrix of a vector function is known to result in a remarkable speedup of three and more compared to standard methods of Automatic Differentiation in most cases. So far, this optimization has been built on the elimination of vertices in the computational graph. We show that vertex elimination in general does not lead to optimal Jacobian code. We introduce two new elimination methods and demonstrate their superiority over the vertex elimination approach.


Vector Function Scalar Multiplication Computational Graph Edge Label Automatic Differentiation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Uwe Naumann

There are no affiliations available

Personalised recommendations