The performance of TAMC generated adjoint code is comparable to hand written code. The quotient of the time to compute the gradient and the function to the time to compute the function only is in the range of 2-4. It depends on the non linearity, the fortran compiler, the platform the code is run on, and other variables.
If the full history of intermediate results can not be stored checkpointing might be necessary. One additional level of checkpointing increases the ratio by about 1.
- Using TAMC to generate efficient adjoint code: Comparison of automatically generated code for evaluation of first and second order derivatives to hand written code from the Minpack-2 collection,
Ralf Giering, Thomas Kaminski,
Extended abstracts of the Session Automatic Differentiation for adjoint code generation at the IMAC Conference on Applications of Computer Algebra, Prag, 1998.
- Performance of large scale adjoint models on various computers (postscript)
Last changes August 18th 1999.