Term Graphs for Computing Derivatives in Imperative Languages

DOI10.1016/j.entcs.2006.10.029zbMath1278.68042OpenAlexW2056629639WikidataQ126261863 ScholiaQ126261863MaRDI QIDQ2867901

Michelle Mills Strout, Jean Utke, Boyana Norris, Paul D. Hovland

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.029

zbMATH Keywords

automatic differentiationcomputational graphterm graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of programming languages (68N15) Numerical differentiation (65D25) Grammars and rewriting systems (68Q42)

Uses Software

• ADOL-C
• ADIC
• OpenAD/F
• OpenAD

Cites Work

• The complexity of partial derivatives
• Bisimilarity in term graph rewriting.
• Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
• Algorithm 755: ADOL-C
• Stochastic Algorithms: Foundations and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Term Graphs for Computing Derivatives in Imperative Languages