On Symbolic Jacobian Accumulation

Derivatives are essential ingredients of a wide range of numerical algorithms. We focus on the accumulation of Jacobian matrices by Gaussian elimination on a sparse implementation of the extended Jacobian. A symbolic algorithm is proposed to determine the ll-in. Its runtime undercuts that of the original accumulation algorithm by a factor of ten. On the given computer architecture we are able to handle problems with roughly four times the original size.