Checkpointing Schemes for Adjoint Methods and Strongly Unsteady Flows

Segmented interpolation schemes are developed in order to reduce the severe storage requirements typical of adjoint runs involving strongly unsteady flows. It is shown that recursive equidistant spacing schemes already reduce storage requirements by two orders of magnitude. Scheduled binomial spacing schemes that offer the potential of even greater savings are also considered and tuned for minimal overhead. Theoretical results predict how the performance of these schemes will scale for ever larger cases. Comparisons of runtime and data storage are given for two realistic blast-structure interaction cases.