Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
Authors:
- Parviz MoinPMParviz Moin
- Gianluca IaccarinoGIGianluca Iaccarino
- 1 January 2009
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 31 (4) , 2549-2567
Abstract
Adjoint equations of differential equations have seen widespread applications in optimization, inverse problems, and uncertainty quantification. A major challenge in solving adjoint equations for time dependent systems has been the need to use the solution of the original system in the adjoint calculation and the associated memory requirement. In applications where storing the entire solution history is impractical, checkpointing methods have frequently been used. However, traditional checkpointing algorithms such as revolve require a priori knowledge of the number of time steps, making these methods incompatible with adaptive time stepping. We propose a dynamic checkpointing algorithm applicable when the number of time steps is a priori unknown. Our algorithm maintains a specified number of checkpoints on the fly as time integration proceeds for an arbitrary number of time steps. The resulting checkpoints at any snapshot during the time integration have the optimal repetition number. The efficiency of our algorithm is demonstrated both analytically and experimentally in solving adjoint equations. This algorithm also has significant advantage in automatic differentiation when the length of execution is variable.Keywords
This publication has 13 references indexed in Scilit:
- A Monte Carlo method for solving unsteady adjoint equationsJournal of Computational Physics, 2008
- Optimal Checkpointing for Time-Stepping Procedures in ADOL-C2006
- A-revolve: an adaptive memory-reduced procedure for calculating adjoints; with an application to computing adjoints of the instationary Navier–Stokes systemOptimization Methods and Software, 2005
- Adjoint methods for PDEs: a posteriori error analysis and postprocessing by dualityActa Numerica, 2002
- DNS-based predictive control of turbulence: an optimal benchmark for feedback algorithmsJournal of Fluid Mechanics, 2001
- Checkpointing Schemes for Adjoint Codes: Application to the Meteorological Model Meso-NHSIAM Journal on Scientific Computing, 2001
- Algorithm 799: revolveACM Transactions on Mathematical Software, 2000
- Adjoint Recovery of Superconvergent Functionals from PDE ApproximationsSIAM Review, 2000
- Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiationOptimization Methods and Software, 1992
- Aerodynamic design via control theoryJournal of Scientific Computing, 1988