A Fully Discrete Adjoint Method for Optimization of Flow Problems on Deforming Domains with Time-Periodicity Constraints
Matthew J. Zahr, Per-Olof Persson, Jon Wilkening

TL;DR
This paper develops a fully discrete adjoint method for optimizing flow problems with time-periodicity constraints, demonstrating efficient convergence and significant energy reduction in a 2D airfoil flapping simulation.
Contribution
It derives the adjoint equations for fully discrete, time-periodic PDEs and applies them to optimize flapping motion in viscous, compressible flow.
Findings
Newton-Krylov method outperforms other solvers in convergence
Gradients computed via the adjoint method are accurate and efficient
Energy of flapping motion reduced nearly tenfold in few optimization steps
Abstract
A variety of shooting methods for computing fully discrete time-periodic solutions of partial differential equations, including Newton-Krylov and optimization-based methods, are discussed and used to determine the periodic, compressible, viscous flow around a 2D flapping airfoil. The Newton-Krylov method uses matrix-free GMRES to solve the linear systems of equations that arise in the nonlinear iterations, with matrix-vector products computed via the linearized sensitivity evolution equations. The adjoint method is used to compute gradients for the gradient-based optimization shooting methods. The Newton-Krylov method is shown to exhibit superior convergence to the optimal solution for these fluid problems, and fully leverages quality starting data. The central contribution of this work is the derivation of the adjoint equations and the corresponding adjoint method for fully discrete,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
