Recipes for adjoint code construction

被引:552
作者
Giering, R [1 ]
Kaminski, T [1 ]
机构
[1] Max Planck Inst Meteorol, D-20146 Hamburg, Germany
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1998年 / 24卷 / 04期
关键词
adjoint model; adjoint operator; automatic differentiation; computational differentiation; data assimilation; differentiation of algorithms; implicit functions; inverse modeling; optimization; reverse mode;
D O I
10.1145/293686.293695
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Adjoint models are increasingly being developed for use in meteorology and oceanography. Typical applications are data assimilation, model tuning, sensitivity analysis, and determination of singular vectors. The adjoint model computes the gradient of a cost function with respect to control variables. Generation of adjoint code may be seen as the special case of differentiation of algorithms in reverse mode, where the dependent function is a scalar. The described method for adjoint code generation is based on a few basic principles, which permits the establishment of simple construction rules for adjoint statements and complete adjoint subprograms. These rules are presented and illustrated with some examples. Conflicts that occur due to loops and redefinition of variables are also discussed. Direct coding of the adjoint of a more sophisticated model is extremely time consuming and subject to errors. Hence, automatic generation of adjoint code represents a distinct advantage. An implementation of the method, described in this article, is the tangent linear and adjoint model compiler (TAMC).
引用
收藏
页码:437 / 474
页数:38
相关论文
共 42 条