Optimization and Computational Fluid Dynamics - Department of ...
Optimization and Computational Fluid Dynamics - Department of ...
Optimization and Computational Fluid Dynamics - Department of ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
80 Kyriakos C. Giannakoglou <strong>and</strong> Dimitrios I. Papadimitriou<br />
flow solutions per optimization cycle. The computation <strong>of</strong> the exact Hessian<br />
is demonstrated using both discrete <strong>and</strong> continuous approaches.<br />
Test problems are solved using the proposed methods. They are used to<br />
compare the so-computed first <strong>and</strong> second derivatives with those resulting<br />
from the use <strong>of</strong> finite difference schemes. On the other h<strong>and</strong>, the efficiency <strong>of</strong><br />
the proposed methods is demonstrated by presenting <strong>and</strong> comparing convergence<br />
plots for each test problem.<br />
4.1 Introduction<br />
Gradient-based methods, <strong>of</strong>ten used in aerodynamic optimization, must be<br />
supported by a tool to compute the gradient <strong>of</strong> an objective function which<br />
quantifies the efficiency <strong>of</strong> c<strong>and</strong>idate solutions to the problem. Since this<br />
text focuses on aerodynamic shape optimization only, c<strong>and</strong>idate solutions<br />
are considered to be 2D or 3D aerodynamic shapes (airfoils, blades, wings,<br />
air inlets, etc.). The objective function is expressed in terms <strong>of</strong> flow variables<br />
computed by numerically solving the flow equations in the corresponding<br />
domains, with problem-specific boundary conditions. The adjoint approach,<br />
based on control theory, is a means to compute the gradient required by a<br />
gradient-based optimization method.<br />
Generally, deterministic algorithms driven by the gradient <strong>of</strong> the objective<br />
function converge to the global optimal solution much faster than evolutionary<br />
algorithms, provided that the starting solution does not mislead them by<br />
trapping the search around local optima. The reason for the superiority <strong>of</strong> the<br />
adjoint method (despite the aforementioned risk) is that the gradient points<br />
towards a better solution whereas the evolutionary algorithms are, generally,<br />
unable to exploit local information during the solution refinement. On the<br />
other h<strong>and</strong>, evolutionary algorithms have some other advantages [8, 20]. However,<br />
the analysis <strong>of</strong> these algorithms <strong>and</strong> their performance is beyond the<br />
scope <strong>of</strong> this chapter which is exclusively concerned with adjoint methods.<br />
Aerodynamic problems usually involve a great number <strong>of</strong> design variables,<br />
so the computation <strong>of</strong> gradients by means <strong>of</strong> finite difference schemes renders<br />
deterministic algorithms very time-consuming. Compared to other methods,<br />
such as the complex-variable approach [48], or the direct sensitivity analysis<br />
(as it will become clear as this chapter develops, the direct approach is based<br />
on the computation <strong>and</strong> use <strong>of</strong> the gradient <strong>of</strong> flow variables with respect to<br />
the design variables as intermediate quantities), the adjoint approach is more<br />
efficient to compute the gradient <strong>of</strong> the objective function. The total cost for<br />
the gradient computation does not depend on the number <strong>of</strong> design variables<br />
<strong>and</strong> is approximately equal to that <strong>of</strong> solving the flow equations.<br />
Two adjoint approaches, namely the continuous <strong>and</strong> discrete, have been<br />
developed. In continuous adjoint, the adjoint Partial Differential Equations<br />
(PDE) are formed starting from the corresponding flow PDE’s <strong>and</strong> are then