Optimality-preserving elimination of linearities in Jacobian accumulation

zbMATH Open1120.65315MaRDI QIDQ871161FDOQ871161

Uwe Naumann, Jean Utke

Publication date: 16 March 2007

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127935

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Accumulating Jacobians as chained sparse matrix products
• scientific article; zbMATH DE number 1269473
• Cheaper Jacobians by Simulated Annealing
• Optimal Jacobian accumulation is NP-complete
• An enhanced Markowitz rule for accumulating Jacobian matrices efficiently

zbMATH Keywords

partial derivativesalgorithmautomatic differentiationconstant foldingJacobian accumulationlinearities

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27) Numerical differentiation (65D25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (3)

• DAG reversal is NP-complete
• Title not available (Why is that?)
• Optimal Jacobian accumulation is NP-complete

Uses Software

• MINPACK-2

This page was built for publication: Optimality-preserving elimination of linearities in Jacobian accumulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871161)