An optimal memory‐reduced procedure for calculating adjoints of the instationary Navier‐Stokes equations

This paper discusses approximation schemes for adjoints in control of the instationary Navier–Stokes system. It tackles the storage problem arising in the numerical calculation of the appearing adjoint equations by proposing a low‐storage approach which utilizes optimal checkpointing. For this purpose, a new proof of optimality is given. This new approach gives so far unknown properties of the optimal checkpointing strategies and thus provides new insights. The optimal checkpointing allows a remarkable memory reduction by accepting a slight increase in run‐time caused by repeated forward integrations as illustrated by means of the Navier–Stokes equations. In particular, a memory reduction of two orders of magnitude causes only a slow down factor of 2–3 in run‐time. Copyright © 2005 John Wiley & Sons, Ltd.

[1]  R. Rannacher,et al.  Finite element approximation of the nonstationary Navier-Stokes problem. I : Regularity of solutions and second-order error estimates for spatial discretization , 1982 .

[2]  R. Temam,et al.  On some control problems in fluid mechanics , 1990 .

[3]  Andreas Griewank,et al.  Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation , 1992 .

[4]  R. Glowinski,et al.  A Computational Approach to Controllability Issues for Flow-Related Models. (I): Pointwise Control of the Viscous Burgers Equation , 1996 .

[5]  Martin Berggren,et al.  Numerical Solution of a Flow-Control Problem: Vorticity Reduction by Dynamic Boundary Action , 1998, SIAM J. Sci. Comput..

[6]  Andreas Griewank,et al.  Applying the Checkpointing Routine treeverse to Discretizations of Burgers’ Equation* , 1999 .

[7]  Andrea Walther,et al.  Program reversal schedules for single and multi-processor machines , 1999 .

[8]  Max D. Gunzburger,et al.  Analysis and Approximation of the Velocity Tracking Problem for Navier-Stokes Flows with Distributed Control , 2000, SIAM J. Numer. Anal..

[9]  Andreas Griewank,et al.  Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation , 2000, TOMS.

[10]  Andreas Griewank,et al.  Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition , 2000, Frontiers in applied mathematics.

[11]  Karl Kunisch,et al.  Second Order Methods for Optimal Control of Time-Dependent Fluid Flow , 2001, SIAM J. Control. Optim..

[12]  Andreas Griewank,et al.  Advantages of Binomial Checkpointing for Memory-reduced Adjoint Calculations , 2004 .

[13]  Patrick Heimbach,et al.  An efficient exact adjoint of the parallel MIT General Circulation Model, generated via automatic differentiation , 2005, Future Gener. Comput. Syst..

[14]  Julia Sternberg,et al.  A-revolve: an adaptive memory-reduced procedure for calculating adjoints; with an application to computing adjoints of the instationary Navier–Stokes system , 2005, Optim. Methods Softw..