Output details
11 - Computer Science and Informatics
University of Hertfordshire
Return to search
Output 0 of 0 in the submission
Output title
A Leibniz notation for automatic differentiation
Type
E - Conference contribution
Name of conference/published proceedings
Recent Advances in Algorithmic Differentiation
Volume number
87
Issue number
-
First page of article
1
ISSN of proceedings
-
Year of publication
2012
URL
-
Number of additional authors
0
Additional information
<13>This paper gives the first general proof that the three second-order adjoint approaches to Automatic Differentiation are step-wise numerically bit-equivalent. This surprising negative result implies that no FLOPs can be saved by a varied approach. On the plus side, implementors are freed to use whatever approach makes most sense from a software engineering perspective. Various special cases of this result were previously known or suspected: this paper gives a conceptually simple universal proof based on a notational advance. The paper was placed first in the proceedings by the editors so that "as many people as possible will read it".
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
