@article{
 title = {Expression templates for primal value taping in the reverse mode of algorithmic differentiation},
 type = {article},
 year = {2018},
 identifiers = {[object Object]},
 keywords = {AD by overloading,C++,algorithmic differentiation,automatic differentiation,implementation strategies,memory analysis},
 id = {e8e226b6-dc36-3b29-989c-754cad0d105f},
 created = {2018-05-29T08:01:14.601Z},
 file_attached = {false},
 profile_id = {ba7153b2-84b9-386e-944a-1dae7c8446db},
 last_modified = {2018-05-29T08:01:14.601Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {© 2018 Informa UK Limited, trading as Taylor  &  Francis Group The reverse mode of Algorithmic Differentiation (AD) can be implemented in several ways. The major choices are primal value taping vs. Jacobian taping, managed indices vs. unmanaged indices and operator level taping vs. statement level taping. Most of the current AD tools have implemented only one of the eight possible choices, and the data management of the implementation adds another complexity hierarchy. The focus in this paper is the implementation of primal value taping on a statement level. Statement level taping removes the need to create intermediate values on the AD tape which results in reduced memory compared to operator level taping. The implementation will be done for managed and unmanaged indices in the AD tool CoDiPack. Primal value taping with statement level taping has not yet been implemented in any other AD tool, thus we will analyse the properties of the taping approaches and highlight the important details for an efficient implementation. Furthermore, all existing taping approaches in CoDiPack will be compared with the new primal value taping approach. The comparison have been conducted on a simple toy problem and a fully featured computational fluid dynamics solver in the multi-physics suite SU2.},
 bibtype = {article},
 author = {Sagebaum, M. and Albring, T. and Gauger, N.R.},
 journal = {Optimization Methods and Software}
}

{"_id":"874zWN4ZrEk5kxeQJ","bibbaseid":"sagebaum-albring-gauger-expressiontemplatesforprimalvaluetapinginthereversemodeofalgorithmicdifferentiation-2018","downloads":0,"creationDate":"2019-04-08T09:46:14.369Z","title":"Expression templates for primal value taping in the reverse mode of algorithmic differentiation","author_short":["Sagebaum, M.","Albring, T.","Gauger, N."],"year":2018,"bibtype":"article","biburl":null,"bibdata":{"title":"Expression templates for primal value taping in the reverse mode of algorithmic differentiation","type":"article","year":"2018","identifiers":"[object Object]","keywords":"AD by overloading,C++,algorithmic differentiation,automatic differentiation,implementation strategies,memory analysis","id":"e8e226b6-dc36-3b29-989c-754cad0d105f","created":"2018-05-29T08:01:14.601Z","file_attached":false,"profile_id":"ba7153b2-84b9-386e-944a-1dae7c8446db","last_modified":"2018-05-29T08:01:14.601Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":false,"abstract":"© 2018 Informa UK Limited, trading as Taylor & Francis Group The reverse mode of Algorithmic Differentiation (AD) can be implemented in several ways. The major choices are primal value taping vs. Jacobian taping, managed indices vs. unmanaged indices and operator level taping vs. statement level taping. Most of the current AD tools have implemented only one of the eight possible choices, and the data management of the implementation adds another complexity hierarchy. The focus in this paper is the implementation of primal value taping on a statement level. Statement level taping removes the need to create intermediate values on the AD tape which results in reduced memory compared to operator level taping. The implementation will be done for managed and unmanaged indices in the AD tool CoDiPack. Primal value taping with statement level taping has not yet been implemented in any other AD tool, thus we will analyse the properties of the taping approaches and highlight the important details for an efficient implementation. Furthermore, all existing taping approaches in CoDiPack will be compared with the new primal value taping approach. The comparison have been conducted on a simple toy problem and a fully featured computational fluid dynamics solver in the multi-physics suite SU2.","bibtype":"article","author":"Sagebaum, M. and Albring, T. and Gauger, N.R.","journal":"Optimization Methods and Software","bibtex":"@article{\n title = {Expression templates for primal value taping in the reverse mode of algorithmic differentiation},\n type = {article},\n year = {2018},\n identifiers = {[object Object]},\n keywords = {AD by overloading,C++,algorithmic differentiation,automatic differentiation,implementation strategies,memory analysis},\n id = {e8e226b6-dc36-3b29-989c-754cad0d105f},\n created = {2018-05-29T08:01:14.601Z},\n file_attached = {false},\n profile_id = {ba7153b2-84b9-386e-944a-1dae7c8446db},\n last_modified = {2018-05-29T08:01:14.601Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {© 2018 Informa UK Limited, trading as Taylor & Francis Group The reverse mode of Algorithmic Differentiation (AD) can be implemented in several ways. The major choices are primal value taping vs. Jacobian taping, managed indices vs. unmanaged indices and operator level taping vs. statement level taping. Most of the current AD tools have implemented only one of the eight possible choices, and the data management of the implementation adds another complexity hierarchy. The focus in this paper is the implementation of primal value taping on a statement level. Statement level taping removes the need to create intermediate values on the AD tape which results in reduced memory compared to operator level taping. The implementation will be done for managed and unmanaged indices in the AD tool CoDiPack. Primal value taping with statement level taping has not yet been implemented in any other AD tool, thus we will analyse the properties of the taping approaches and highlight the important details for an efficient implementation. Furthermore, all existing taping approaches in CoDiPack will be compared with the new primal value taping approach. The comparison have been conducted on a simple toy problem and a fully featured computational fluid dynamics solver in the multi-physics suite SU2.},\n bibtype = {article},\n author = {Sagebaum, M. and Albring, T. and Gauger, N.R.},\n journal = {Optimization Methods and Software}\n}","author_short":["Sagebaum, M.","Albring, T.","Gauger, N."],"bibbaseid":"sagebaum-albring-gauger-expressiontemplatesforprimalvaluetapinginthereversemodeofalgorithmicdifferentiation-2018","role":"author","urls":{},"keyword":["AD by overloading","C++","algorithmic differentiation","automatic differentiation","implementation strategies","memory analysis"],"downloads":0},"search_terms":["expression","templates","primal","value","taping","reverse","mode","algorithmic","differentiation","sagebaum","albring","gauger"],"keywords":["ad by overloading","c++","algorithmic differentiation","automatic differentiation","implementation strategies","memory analysis"],"authorIDs":[]}