Elimination techniques for cheap Jacobians

  • Authors:

  • Uwe Naumann

  • Affiliations:

  • Univ. of Hertfordshire, Hatfield, Hertfordshire, UK

  • Venue:
  • Automatic differentiation of algorithms
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.