DATA COMPRESSION ALGORITHMS FOR ADJOINT BASED SENSITIVITY STUDIES OF UNSTEADY FLOWS

Adjoint based sensitivity studies are effective means to understand how flow quantities of interest and grid quality could affect the flow simulations. However; applying an unsteady ad joint method to three-dimensional complex flows remains a challenging topic. One of the challenges is that the flow variables at all previous time steps will be needed when solving the unsteady adjoint equation backwards in time. The straightforward treatment of storing all the previoris flow solutions could be prohibitive for simulations with a large number of grid points and time steps. To avoid storing the full trajectory, the checkpointing method only stores the flow solutions at some carefully selected time steps called checkpoints, and re-computes the flow solutions between checkpoints when they are needed by the adjoint solver. However, the re-computation increases the computational cost by multiple times of the cost of solving the flow equations, which may be unacceptable for some applications. Alternatively, in this study, several data compression algorithms with much less extra cost were considered for alleviating the storage problem. In these data compression algorithms, the full flow solutions were projected onto a small set of bases which were either generated by the proper orthogonal decomposition (POD) method or by the Gram-Schmidt orthogonalization. Only a small set of bases and corresponding expansion coefficients need to be stored and they could recover the flow solutions at every time step with reasonable accuracy. The data compression algorithms were implemented in the numerical test cases, and the computed adjoint solutions were compared with that obtained by using full flow solutions. The comparisons demonstrated that the data compression algorithms were able to greatly reduce the storage requirements while maintaining sufficient accuracy.