DagSemProc.09061.7.pdf
- Filesize: 231 kB
- 12 pages
Document
Combinatorial Problems in OpenAD
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9061
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-07-24
Cite As Get BibTex
Jean Utke and Uwe Naumann. Combinatorial Problems in OpenAD. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09061.7
Abstract
Computing derivatives using automatic differentiation methods entails a variety of combinatorial problems. The OpenAD tool implements automatic differentiation as source transformation of a program that represents a numerical model. We select three combinatorial problems and discuss the solutions implemented in OpenAD. Our intention is to explain the specific parts of the implementation so that readers can easily use OpenAD to investigate and develop their own solutions to these problems.
Subject Classification
Keywords
- Automatic differentiation
- combinatorial problem
- tool tutorial
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads