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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

3 Mathematical Aspects <strong>of</strong> CFD-based <strong>Optimization</strong> 73<br />

for optimization problems together with strategies for the adaptation <strong>of</strong><br />

the POD-bases can be found in [1, 22, 25].<br />

• If the dimension <strong>of</strong> the optimization variables is comparatively low, it is<br />

possible to apply the boundary value problem techniques described below<br />

in a forward sensitivity driven manner as described in [19, 31, 32, 33]. The<br />

resulting storage space required is then equivalent to the dimension <strong>of</strong> the<br />

optimization variables times the dimension <strong>of</strong> one space discretization <strong>of</strong> y.<br />

• The direct usage <strong>of</strong> the reduced formulation (3.20) can be considered as an<br />

ultima ratio, if the available main memory is not large enough to exploit all<br />

other options. Nevertheless, one has to be careful in evaluating derivatives<br />

<strong>and</strong> also be aware that the resulting unconstrained optimization problem is<br />

typically much more nonlinear than the original, constrained formulation<br />

(3.18,3.19).<br />

Furthermore, an inconsistent adjoint time integration scheme becomes a<br />

major <strong>and</strong> frequent pitfall in CFD-optimization. It is important that the adjoint<br />

discretization scheme is indeed adjoint to the discretized primal CFD<br />

time integration scheme, according to the principle <strong>of</strong> internal numerical differentiation<br />

(IND). A deviation from this requirement may lead to gradient<br />

approximations which are not descent directions <strong>and</strong> would thus lead to<br />

premature stopping <strong>of</strong> gradient-based algorithms. The requirement <strong>of</strong> consistency<br />

<strong>of</strong> the adjoint scheme with the forward scheme leads typically to<br />

adjoint schemes which cannot be interpreted as integration schemes for the<br />

(infinite) adjoint CFD problem. More details can be found in [11].<br />

3.3.1 Time-domain Decomposition by Multiple<br />

Shooting<br />

The direct multiple shooting method for optimization <strong>of</strong> unsteady processes<br />

as described below was introduced by Bock <strong>and</strong> Plitt for optimal control in<br />

[10, 30], <strong>and</strong> for parameter estimation problems in [5]. The basic idea is to<br />

decompose the time history <strong>of</strong> the problem into subdomains, in which the<br />

unsteady PDE solutions are uniquely parameterized by their initial data <strong>and</strong><br />

by the unknown parameters. For this purpose, one divides the time interval<br />

[0,T] into subintervals [ti,ti+1]with<br />

0=t0

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

Saved successfully!

Ooh no, something went wrong!