Drag Minimization of the Cylinder Wake by Trust-Region Proper Orthogonal Decomposition

Abstract

In this paper we investigate the optimal control approach for the active control of the circular cylinder wake flow considered in the laminar regime (Re = 200). The objective is the minimization of the mean total drag where the control function is the time harmonic angular velocity of the rotating cylinder. When the Navier-Stokes equations are used as state equations, the discretization of the optimality system leads to large scale discretized optimization problems that represent a tremendous computational task. In order to reduce the number of state variables during the optimization process, a Proper Orthogonal Decomposition (POD) Reduced-Order Model (ROM) is then derived to be used as state equation. Since the range of validity of the POD ROM is generally limited to the vicinity of the design parameters in the control parameter space, we propose to use the Trust-Region Proper Orthogonal Decomposition (TRPOD) approach, originally introduced by Fahl (2000), to update the reduced-order models during the optimization process. Benefiting from the trust-region philosophy, rigorous convergence results guarantee that the iterates produced by the TRPOD algorithm will converge to the solution of the original optimization problem defined with the Navier-Stokes equations. A lot of computational work is indeed saved because the optimization process is now based only on low-fidelity models. The key enablers to an accurate and robust POD ROM for the pressure and velocity fields are the extension of the POD basis functions to the pressure data, the introduction of a time-dependent eddy-viscosity estimated for each POD mode as the solution of an auxiliary optimization problem, and the inclusion in the POD ROM of different non-equilibrium modes. When the TRPOD algorithm is applied to the wake flow configuration, this approach converges to the minimum predicted by an open-loop control approach and leads to a relative mean drag reduction of 30% for reduced numerical costs (a cost reduction factor of 1600 is obtained for the memory and the optimization problem is solved approximately 4 times more quickly).