Optimal Jacobian accumulation is NP-complete
- First Online:
- 168 Downloads
We show that the problem of accumulating Jacobian matrices by using a minimal number of floating-point operations is NP-complete by reduction from Ensemble Computation. The proof makes use of the fact that, deviating from the state-of-the-art assumption, algebraic dependences can exist between the local partial derivatives. It follows immediately that the same problem for directional derivatives, adjoints, and higher derivatives is NP-complete, too.
KeywordsAutomatic differentiation Complexity NP-completeness
Mathematics Subject Classification (2000)26B10 68Q17
Unable to display preview. Download preview PDF.