Author
Listed:
- Sebastian Schlenkrich
(Technische Universität Dresden, Institute for Scientific Computing)
- Andrea Walther
(Technische Universität Dresden, Institute for Scientific Computing)
- Nicolas R. Gauger
(German Aerospace Center (DLR), Institute of Aerodynamics and Flow Technology
Humboldt University Berlin, Department of Mathematics)
- Ralf Heinrich
(German Aerospace Center (DLR), Institute of Aerodynamics and Flow Technology)
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.
Suggested Citation
Sebastian Schlenkrich & Andrea Walther & Nicolas R. Gauger & Ralf Heinrich, 2008.
"Differentiating Fixed Point Iterations with ADOL-C: Gradient Calculation for Fluid Dynamics,"
Springer Books, in: Hans Georg Bock & Ekaterina Kostina & Hoang Xuan Phu & Rolf Rannacher (ed.), Modeling, Simulation and Optimization of Complex Processes, pages 499-508,
Springer.
Handle:
RePEc:spr:sprchp:978-3-540-79409-7_36
DOI: 10.1007/978-3-540-79409-7_36
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-79409-7_36. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.