07.02.2013 Views

Optimization and Computational Fluid Dynamics - Department of ...

Optimization and Computational Fluid Dynamics - Department of ...

Optimization and Computational Fluid Dynamics - Department of ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

5 Efficient Deterministic Approaches for Aerodynamic Shape <strong>Optimization</strong> 127<br />

design vector (X) initial surface (xs)<br />

ց ւ<br />

defgeo initial surface (xs)<br />

↓ (x) ւ<br />

difgeo initial computational grid (ms)<br />

↓ (dx) ւ<br />

meshdefo<br />

↓ (m)<br />

TAUij<br />

↓ (CD)<br />

Fig. 5.4 Chain to compute the cost function value<br />

∂CD<br />

∂X<br />

= ∂CD<br />

∂m<br />

∂m ∂x<br />

· ·<br />

∂dx ∂X<br />

. (5.32)<br />

The optimization strategy in the following computations is a steepest descent<br />

method which was implemented as an optimizer into the optimization<br />

framework Synaps Pointer Pro. This framework has the possibility to read<br />

in user-defined gradients. Therefore, the gradients are calculated by separate<br />

routines <strong>and</strong> are then submitted to the optimizer.<br />

5.6.1 Test Case Definition<br />

As test case for the validation <strong>and</strong> application <strong>of</strong> AD generated adjoint sensitivity<br />

calculations an RAE 2822 airfoil is chosen with a Mach number <strong>of</strong> 0.73<br />

<strong>and</strong> an angle <strong>of</strong> attack <strong>of</strong> 2 ◦ . The drag coefficient for this test case has been<br />

optimized with both parameterizations, Hicks-Henne <strong>and</strong> cosine function parameterizations<br />

(see Sect. 5.2.1). In both optimizations, 20 design parameters<br />

have been used. The computational grid has 161 × 33 grid points.<br />

5.6.2 Finite Differences<br />

To compute the finite differences in order to have a validation framework<br />

for the AD sensitivities, the first task was to tune the stepsize h for the<br />

approximation<br />

∂I<br />

∂xi<br />

(X) ≈ I(X + hei) − I(X)<br />

h<br />

(1 ≤ i ≤ n) (5.33)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!