Abstract
The reverse mode of automatic differentiation allows the computation of gradients at a temporal complexity that is only a small multiple of the temporal complexity to evaluate the function itself. However, the memory requirement of the reverse mode in its basic form is proportional to the operation count of the function to be differentiated. For iterative processes consisting of iterations with uniform complexity this means that the memory requirement of the reverse mode grows linearly with the number of iterations. For fixed point iterations this is not efficient, since any structure of the problem is neglected.
The method of reverse accumulation proposes for linear converging iterations an alternative, iterative computation of the gradient. The iteration of the gradient converges with the same rate as the fixed point iteration itself. The memory requirement for this method is independent of the number of iterations. Hence, it is also independent of the desired accuracy. We integrate the concept of reverse accumulation within the AD-tool ADOL-C to compute gradients of fixed point iterations.This approach decreases the memory requirement of the gradient calculation considerably yielding an increased range of applications. Runtime results based on the CFD code TAUij are presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. Christianson. Reverse accumulation and attractive fixed points. Optimization Methods and Software, 3:311–326, 1994.
R. Giering, T. Kaminski, and T. Slawig. Applying TAF to a Navier-Stokes solver that simulates an Euler flow around an airfoil. Future Generation Computer Systems, 21:1345–1355, 2005.
A. Griewank. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Number 19 in Frontiers in Appl. Math. SIAM, Philadelphia, 2000.
A. Griewank and C. Faure. Piggyback differentiation and optimization. In L. Biegler, O. Ghattas, M. Heinkenschloss, and B. van Bloemen Waanders, editors, Large-scale PDE-constrained optimization, volume 30 of Lect. Notes Comput. Sci. Eng., pages 148–164, Berlin, 2003. Springer.
A. Griewank, D. Juedes, and J. Utke. ADOL-C: A package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Softw., 22: 131–167, 1996.
R. Heinrich. Implementation and usage of structured algorithms within an unstructured CFD-code. Notes on Numerical Fluid Mechanics and Multidisciplinary Design, 92, 2006.
C.-C. Rossow. A flux splitting scheme for compressible and incompressible flows. Journal of Computational Physics, 164:104–122, 2000.
M. Widhalm and C.-C. Rossow. Improvement of upwind schemes with the least square method in the DLR TAU code. Notes on Numerical Fluid Mechanics, 87, 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schlenkrich, S., Walther, A., Gauger, N.R., Heinrich, R. (2008). Differentiating Fixed Point Iterations with ADOL-C: Gradient Calculation for Fluid Dynamics. In: Bock, H.G., Kostina, E., Phu, H.X., Rannacher, R. (eds) Modeling, Simulation and Optimization of Complex Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79409-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-79409-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79408-0
Online ISBN: 978-3-540-79409-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)