The Tapenade automatic differentiation tool: Principles, model, and specification
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Tapenade is an Automatic Differentiation (AD) tool which, given a Fortran or C code that computes a function, creates a new code that computes its tangent or adjoint derivatives. Tapenade puts particular emphasis on adjoint differentiation, which computes gradients at a remarkably low cost. This article describes the principles of Tapenade, a subset of the general principles of AD. We motivate and illustrate with examples the AD model of Tapenade, that is, the structure of differentiated codes and the strategies used to make them more efficient. Along with this informal description, we formally specify this model by means of data-flow equations and rules of Operational Semantics, making this the reference specification of the tangent and adjoint modes of Tapenade. One benefit we expect from this formal specification is the capacity to formally study the AD model itself, especially for the adjoint mode and its sophisticated strategies. This article also describes the architectural choices of the implementation of Tapenade. We describe the current performance of Tapenade on a set of codes that include industrial-size applications. We present the extensions of the tool that are planned in a foreseeable future, deriving from our ongoing research on AD.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,453
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Griewank, A., & Walther, A. (1987) · Cited by 2,166
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, Second Edition
Griewank, A., & Walther, A. (2008) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717761 · Cited by 1,529
OPA 8.1 Ocean General Circulation Model reference manual
Madec, G., Delécluse, P., Imbard, M., & Lévy, C. (1998) · HAL · Cited by 919
Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
Griewank, A. (1992) · Optimization Methods and Software · doi:10.1080/10556789208805505 · Cited by 360
The Art of Differentiating Computer Programs: An Introduction to Algorithmic Differentiation
Naumann, U. (2011) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972078 · Cited by 251
Walther, A., & Griewank, A. (2012) · Chapman & Hall/CRC computational science series/Chapman & Hall/CRC computational science · doi:10.1201/b11644-8 · Cited by 228
Automatic Differentiation: Applications, Theory, and Implementations
(2006) · Lecture Notes in Computational Science and Engineering · doi:10.1007/3-540-28438-9 · Cited by 182
Automatic differentiation in Odyssée
Rostaing, N., Dalmas, S., & Galligo, A. (1993) · Tellus A Dynamic Meteorology and Oceanography · doi:10.3402/tellusa.v45i5.15060 · Cited by 103
An efficient overloaded implementation of forward mode automatic differentiation in MATLAB
Forth, S. A. (2006) · ACM Transactions on Mathematical Software · doi:10.1145/1141885.1141888 · Cited by 94
Cited by
Forget, G., Campin, J.-M., Heimbach, P., Hill, C. N., Ponte, R. M., & Wunsch, C. (2015) · Geoscientific Model Development · doi:10.5194/gmd-8-3071-2015 · Cited by 790
Universal Differential Equations for Scientific Machine Learning
Rackauckas, C., Ma, Y., Martensen, J., Warner, C., Zubov, K., Supekar, R., Skinner, D., Ramadhan, A., & Edelman, A. (2020) · doi:10.21203/rs.3.rs-55125/v1 · Cited by 643
Machine-Learning-Augmented Predictive Modeling of Turbulent Separated Flows over Airfoils
Singh, A. P., Medida, S., & Duraisamy, K. (2017) · AIAA Journal · doi:10.2514/1.j055595 · Cited by 435
Effective adjoint approaches for computational fluid dynamics
Kenway, G. K. W., Mader, C. A., He, P., & Martins, J. R. R. A. (2019) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2019.05.002 · Cited by 331
A review of automatic differentiation and its efficient implementation
Margossian, C. C. (2019) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1305 · Cited by 321
Topology optimization of turbulent flows
Dilgen, C. B., Dilgen, S. B., Fuhrman, D. R., Sigmund, O., & Lazarov, B. S. (2018) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2017.11.029 · Cited by 270
Huynh, N. N. T., Garambois, P.-A., Renard, B., Colleoni, F., Monnier, J., & Roux, H. (2025) · Hydrology and Earth System Sciences · doi:10.5194/hess-29-3589-2025 · Cited by 38
Differentiable programming for Earth system modeling
Gelbrecht, M., White, A., Bathiany, S., & Boers, N. (2023) · Geoscientific Model Development · doi:10.5194/gmd-16-3123-2023 · Cited by 31
“…spent on frameworks such as dolfin-adjoint for finite-element models (Mitusch et al., 2019) as well as the source-to-source AD tools Transforms of Algorithms in Fortran (TAF) (Giering and Kaminski, 1998) and Tapenade (Hascoët and Pascual, 2013) that already enabled differentiable ESM components.”
MethodInfluential
Metadata
- Authors
- Hascoet, L., & Pascual, V.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2013-04
- Volume
- 39
- Issue
- 3
- Pages
- 1-43
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2031070741
- Cited by
- 498
- References
- 10
- FWCI
- 24.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.