Abstract
This article presents adjoint methods for the computation of the first- and higher-order derivatives of objective functions \(F\) used in optimization problems governed by the Navier–Stokes equations in aero/hydrodynamics. The first part of the chapter summarizes developments and findings related to the application of the continuous adjoint method to turbulence models, such as the Spalart-Allmaras and k-\(\varepsilon \) ones, in either their low- or high-Reynolds number (with wall functions) variants. Differentiating the turbulence model, over and above to the differentiation of the mean–flow equations, leads to the computation of the exact gradient of \(F\), by overcoming the frequently made assumption of neglecting turbulence variations. The second part deals with higher-order sensitivity analysis based on the combined use of the adjoint approach and the direct differentiation of the governing PDEs. In robust design problems, the so-called second-moment approach requires the computation of second-order derivatives of \(F\) with respect to (w.r.t.) the environmental or uncertain variables; in addition, any gradient-based optimization algorithm requires third-order mixed derivatives w.r.t. both the environmental and design variables; various ways to compute them are discussed and the most efficient is adopted. The equivalence of the continuous and discrete adjoint for this type of computations is demonstrated. In the last part, some other relevant recent achievements regarding the adjoint approach are discussed. Finally, using the aforementioned adjoint methods, industrial geometries are optimized. The application domain includes both incompressible or compressible fluid flow applications.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Flow Equations and Objective Function
In this section, the equations governing the state (i.e. flow) problem for incompressible fluid flows, using either the one-equation Spalart-Allmaras [1] or the two equation Launder-Sharma \(k\,{-}\,\varepsilon \) [2] turbulence models, are briefly presented. The mean–flow state equations are
where \(\upsilon _i\) are the velocity components, \(p\) the static pressure divided by the density, \(\nu \) and \(\nu _t\) the bulk and turbulent viscosities. The turbulence model (TM) equation(s) is/are
for the Spalart-Allmaras model (TM = SA) and
for the Launder-Sharma k-\(\varepsilon \) (TM = KE) one. \(\widetilde{\nu }\) is the turbulence state variable if TM=SA (\(\nu _t=\widetilde{\nu }f_{v_1}\)) and k, \(\varepsilon \) are the corresponding quantities (turbulent kinetic energy and turbulent energy dissipation) if TM = KE (\(\nu _t=c_\mu \frac{k^2}{\varepsilon }\)). In both cases, the boundary conditions and the model constant values are omitted in the interest of space; see [1] and [2].
In general, the objective function may comprise both surface (\(S\)) and volume (\(\varOmega \)) integrals, as follows
where \(n_i\) are the components of the normal to the boundary outward unit vector.
2 The Adjoint Method for Shape Optimization in Turbulent Flows
In discrete adjoint, the differentiation of the turbulence model equations is straightforward and can be found in several published works, [3, 4]. In contrast, the majority of existing continuous adjoint methods/codes rely on the so-called “frozen turbulence” assumption, in which the sensitivities of the turbulence quantities w.r.t. the design variables are neglected [5–9]. The first continuous adjoint to the Spalart-Allmaras model, for incompressible flows, was presented by the current group of authors in [10] and was extended to compressible flows in [11]. Regarding the adjoint approach to high-Reynolds turbulence models, the continuous adjoint to the k-\(\varepsilon \) model with wall functions has recently been published, [12], whereas the continuous adjoint to the low-Reynolds Launder-Sharma k - \(\varepsilon \) model can be found in [13]. All these adjoint approaches which rely upon the differentiated turbulence model will hereafter be referred to as “turbulent” adjoint, to distinguish it from the “frozen turbulence” approach.
2.1 Continuous Adjoint to Low-Re Turbulence Models
In the continuous adjoint approach for shape optimization problems, the total derivative (symbol \(\delta \)) of any function \(\varPhi \) w.r.t. the design variables \(b_n\) must be distinguished from the corresponding partial sensitivity (symbol \(\partial \)) since
where \(\frac{\delta x_l}{\delta b_n}\) are the sensitivities of nodal coordinates. In case \(\varPhi \) is defined along a surface, Eq. 6 becomes \(\frac{\delta _s \varPhi }{\delta b_n}= \frac{\partial \varPhi }{\partial b_n} \!+\! \frac{\partial \varPhi }{\partial x_k} n_k \frac{\delta x_m}{\delta b_n} n_m\). Since any sufficiently small surface deformation can be seen as a normal perturbation, only the normal part of the surface deformation velocity \(\delta x_m / \delta b_n n_m\) contributes to changes in \(\varPhi \).
In order to formulate the adjoint method, the augmented objective function \(F_{aug}\) is defined as the sum of \(F\) and the field integrals of the products of the adjoint variable fields and the state equations, as follows
where \(u_i\) are the adjoint velocity components, \(q\) the adjoint pressure and the extra terms \(E_{TM}\) depend on the turbulence model (\(TM\)). If \(TM\!=\!SA\),
whereas if \(TM\!=\!KE\),
where \(\widetilde{\nu _a}\), \(k_a\) and \(\varepsilon _a\) are the adjoints to \(\widetilde{\nu }\), \(k\) and \(\varepsilon \), respectively.
Based on the Leibniz theorem, the derivative of \(F_{aug}\) w.r.t. \(b_n\) is
where \(S_{W_p}\) is the parameterized (in terms of \(b_n\)) part of the solid wall. The development of the volume integrals in Eqs. 10a, b, based on the Green-Gauss theorem and the elimination of terms depending on the variations of the mean–flow and turbulence model variables, lead to the adjoint mean–flow equations
The extra terms \(AMS_i\) arise from the differentiation of the turbulence model, see [10, 13]. The adjoint turbulence model variables fields \(\widetilde{\nu _a}, k_a\) and \(\varepsilon _a\) are governed by the “turbulent” adjoint PDEs, which are
The detailed derivation of the adjoint PDEs, the various terms or constants in Eqs. 13a, b, c and the corresponding adjoint boundary conditions can be found in [10] or [13].
After satisfying the field adjoint equations, the sensitivity derivatives of \(F_{aug}\) are given by
where, depending on the turbulence model, terms \(BC^u_i\) and \(SD\) can be found in [10] or [13]. The gain from using the “turbulent” adjoint approach and overcoming the “frozen turbulence” assumption, at the expense of additionally solving the adjoint to the turbulence model PDEs, is demonstrated below in a few selected cases. The “frozen turbulence” assumption may lead to wrongly signed sensitivities, misleading or delaying the optimization process. As an example, the optimization of a \(90^{\circ }\) elbow duct, targeting minimum total pressure losses, \(minF \!=\!-\int _{S_{I}}\!\!\!\,\left( p +\frac{1}{2} \upsilon ^2 \right) \upsilon _i n_i dS -\int _{S_{O}}\!\!\!\,\left( p +\frac{1}{2} \upsilon ^2 \right) \upsilon _i n_i dS\), where \(S_{I}\) and \(S_{O}\) are the inlet to and outlet from the flow domain, with a Reynolds number equal to \(3.5 \times 10^4\), modeled using TM=SA model is demonstrated in Fig. 1, [10]. Comments can be found in the caption.
The shape optimization of an S-shaped duct, with the same target as before, is demonstrated in Fig. 2. The flow Reynolds number based on the inlet height is \(Re\!=\!1.2\times 10^5\) and TM=KE is used. The upper and lower duct contours are parameterized using Bézier–Bernstein polynomials with 12 control points each. The Fletcher-Reeves Conjugate Gradient (CG) method is used. The gradients used by each method to update the design variables are based on (a) “turbulent” adjoint and (b) adjoint with the “frozen turbulence” assumption. The starting duct shape along with the optimal ones computed by CG, based on the two variants of the adjoint formulation, are presented in Fig. 2. The shape resulting from (a) has an \(F\) value by about \(3\,\%\) lower than that of (b) and reaches the optimal solution after \({\sim }20\,\%\) less cycles.
2.2 Continuous Adjoint to High-Re Turbulence Models
In industrial projects, many analysis codes rely on the use of the wall function (WF) technique, due to the less stretched and generally coarser meshes required close to the walls and the resulting economy in the overall CPU cost. The development of the adjoint approach to the wall function model is, thus, necessary. This is briefly presented below for the k-\(\varepsilon \) and the Spalart-Allmaras models. The two developments differ since the first was based on the in-house GPU-enabled RANS solver, [14], with slip velocity at the wall, [15], while the second on the OpenFOAM code with a no-slip condition at the wall. Note that these differences in the primal boundary conditions at the wall cause differences in the corresponding adjoint boundary conditions.
Regarding the k-\(\varepsilon \) model, the development, which was carried out by the authors’ group [12] was based on vertex-centered finite volumes with non-zero slip velocity at the wall. The real solid wall is assumed to lie at a distance \(\varDelta \) underneath \(S_W\). Integrating the state equations over the finite volume of Fig. 3, the diffusive flux across segment \(\alpha \beta \) depends on the friction velocity \(\upsilon _\tau \),
and \(\upsilon _t=\upsilon _i t_i\); \(\upsilon _t\) computed via the local application of the law of the wall.
With known \(\upsilon _{\tau }\), the \(k\) and \(\varepsilon \) values at \(P\) are
where \(y^+\!=\!\frac{\upsilon _\tau \varDelta }{\nu }\), \(\upsilon ^+\!=\!\frac{\upsilon _t}{\upsilon _\tau }\), which result from the expressions \(\upsilon ^+ \!=\! \frac{1}{\kappa } lny^+ \!+\! B\), with \(\kappa =0.41\) and \(B=5.5\), if \(y^+ \!\ge \!y_c^+\) or \(\upsilon ^+ \!=\! y^+\) if \(y^+ \!<\! y_c^+\).
Similar to the definition of \(\upsilon _\tau \), Eq. 15, the development of the adjoint equations introduces the adjoint friction velocity \(u_\tau \) at each “wall” node (such as \(P\)) defined by, [12],
Attention should be paid to the close similarity of Eqs. 17 and 15. During the solution of the adjoint PDEs (TM=KE), the value of \(u_\tau \), which contributes to the adjoint viscous fluxes at the “wall” nodes, is expressed in terms of the gradients of \(k\), \(k_a\), \(\varepsilon \) and \(\varepsilon _a\), as follows
On the other hand, if TM=SA (based on a cell-centered finite-volume scheme with a no-slip condition at the solid wall boundary faces), the wall function technique is based on a single formula modeling both the viscous sublayer and the logarithmic region of the boundary layer
In this case, the adjoint friction velocity must be zeroed. This is the major difference between the two finite–volume approaches (cell– and vertex–centered); despite this difference and any difference in the interpretation of the adjoint friction velocity, both will be referred to as “adjoint wall function” technique. Here, also, the role of (zero) \(u_\tau \) is to complete the adjoint momentum equilibrium at the first cell adjacent to the wall. The development is omitted in the interest of space. Applications, including validation, of the “adjoint wall function” technique are shown in Figs. 4 and 5, with comments in the caption.
Recently, the “turbulent adjoint” method for the \(k-\omega \) \(SST\) turbulence model with wall functions was published by the same group, [16].
2.3 Other Applications of the Continuous Adjoint Methods
The continuous adjoint method is a low-cost tool to derive information regarding the optimal location and type of steady suction/blowing jets, used to control flow separation, [13]. In unsteady flows, the adjoint method, [17], can also be used to compute the optimal characteristics of unsteady jets, such as pulsating or oscillating ones. Such an application, where the optimal amplitudes of pulsating jets have been computed using the unsteady continuous adjoint method is presented in Fig. 6.
An inherent difficulty of the adjoint method, applied to unsteady flows, is the need of having the primal solution field available for the solution of the adjoint equations in each time-step. Since the adjoint solution evolves backwards in time, the need to store every primal solution arises. Since storing everything is expensive memory-wise, some turnaround is often used instead. A very common approach is the checkpointing technique, [18], where selected primal flow fields are stored (checkpoints) and the rest are recomputed starting from the checkpoints. Checkpointing is much cheaper memory-wise, at the expense of extra CPU time, needed for the re-computations of the primal fields.
Another way to overcome this is to use an approximation to the time evolution of the primal fields, such as the proper orthogonal decomposition (POD) technique, [19]. Approximating the primal field of each iteration bears no extra CPU cost.
On the other hand, topology optimization in fluid mechanics exclusively relies upon the adjoint method. In these problems, a real-valued porosity (\(\alpha \)) dependent term is introduced into the flow equations. Based on the local porosity values, domain areas corresponding to the fluid flow are identified as those with nodal values \(\alpha \!\le \! \varepsilon \), where \(\varepsilon \) is a user-defined infinitesimally small positive number. All the remaining areas where \(\alpha \!>\! \varepsilon \) define the part of the domain to be solidified. The goal of topology optimization is to compute the optimal \(\alpha \) field in order to minimize the objective function under consideration. Since the number of the design variables is equal to the number of mesh cells (and thus, very high), the adjoint method is the perfect choice for computing \(\delta F / \delta \alpha \), as its cost is independent of the number of design variables. Continuous adjoint methods for solving topology optimization problems for laminar and turbulent ducted flows, with or without heat transfer, are described in [20]. For turbulent flows, the adjoint approach is exact, i.e. includes the differentiation of the turbulence model (“turbulent” adjoint), (Fig. 7).
3 Robust Design Using High-Order Sensitivity Analysis
In aerodynamics, robust design methods aim at optimizing a shape in a range of possible operating conditions or by considering environmental uncertainties, such as manufacturing imprecisions or fluctuations of flow conditions, etc. The latter depend on the so-called environmental variables \(\mathbf{c} \left( c_i,i\in [1,M]\right) \). In robust design problems, the function to be minimized can be expressed as \(\widehat{F}\!=\!\widehat{F}\left( \mathbf{b},\mathbf{c},\mathbf{U( b, c})\right) \), to denote the dependency of \(\widehat{F}\) on the flow variables \(\mathbf{U}\), the design variables \(\mathbf{b} \left( b_l,l\in [1,N]\right) \) which parameterize the aerodynamic shape and the uncertain environmental variables \(\mathbf{c}\). A probability density function \(g(\mathbf{c})\) can be associated with \(\mathbf{c}\). In the so-called Second-Order Second-Moment (SOSM) approach, \(\widehat{F}\) combines the mean value \(\mu _F\) and variance \({\sigma _F}^2\) of \(F\)
where the gradients are evaluated at the mean values \(\overline{\mathbf{c}}\) of the environmental variables.
Based on the previous definitions, in robust design, \(\widehat{F}\) becomes
where \(w\) is a user-defined weight. To compute \(\widehat{F}\), efficient and accurate methods for first- and second-order derivatives of \(F\) w.r.t. the environmental variables are needed.
3.1 Computation of Second-Order Moments
In aerodynamic optimization, the computation of the Hessian of \(F\), subject to the constraint of satisfying the flow equations, can be conducted in at least four different ways. All of them can be set up in either discrete or continuous form [21–23]. The presentation is always much more synoptic in the discrete sense. In this case, the first-order variation rate of \(F\) w.r.t. \(c_i, i\!=\! 1,\dots ,M\) is given by
whereas the sensitivities of the discretized residuals \(R_m\) of the flow equations w.r.t. \(c_i\) are given by
where \(U_k\) are the discretized field of the flow variables. Solving Eq. 24 for \(\frac{dU_k}{dc_i}\), at the cost of \(M\) equivalent flow solutions (EFS; this is approximately the cost of solving the primal equations) and, then, computing \(\frac{dF}{dc_i}\) from Eq. 23 is straightforward but costly and will be referred to as Direct Differentiation (DD). Since the cost to compute the gradient of \(F\) using DD scales with \(M\), the Adjoint Variable (AV) method can be used instead. The adjoint equations to be solved for the adjoint variables \({\varPsi _m}\) are
and \(\frac{dF}{dc_i}\) are computed as
To compute the Hessian of \(F\), starting from Eq. 23, the so-called DD-DD approach is set up, so that
where \(\frac{d^2 U_k}{dc_i dc_j}\) is computed by first solving the following DD equations
Note that \(\frac{dU_k}{dc_i}\) are already known from the solution of Eq. 24.
The DD-DD approach requires upon the computation of \(\frac{dU_k}{dc_i}\) and \(\frac{d^2U_k}{dc_i dc_j}\) and its CPU cost is \(M\!+\!\frac{M\!(M\!+\!1)}{2}\) EFS in total (excluding the cost of solving the flow equations). So, the overall CPU cost scales with \(M^2\) and becomes too expensive for use in real–world optimization.
Two less expensive approaches to compute the Hessian of \(F\) are the AV-DD (AV for the gradient and DD for the Hessian) and AV-AV ones. As shown in [23], both cost an many as \(2M\!+\!1\) EFS. It can be shown that the fourth alternative way, i.e. the DD-AV approach (DD for the gradient and AV for the Hessian), is the most efficient one to compute the Hessian matrix. In DD-AV, the Hessian matrix is computed by
where \(\frac{d U_k}{d c_i}\) result from Eq. 24 and \({\varPsi }_m\) is computed by solving the adjoint equation, Eq. 25 (same as before). The total CPU cost of DD-AV is equal to \(M\!+\!1\) EFS being, thus, the most economical approach.
3.2 Robust Shape Optimization Using Third-Order Sensitivities
If the problem of minimizing the combination of the two first statistical moments is to be solved using a stochastic method such as an evolutionary algorithm, the methods presented in Sect. 3.1 serve to provide \(\mu _F\) and \({\sigma _F}^2\); no other derivation is required. However, if a gradient-based method is used, the gradient of \(\widehat{F}\) Eq. 22 must be differentiated w.r.t. \(b_q\),
From Eq. 30, the computation of \(\frac{\delta \widehat{F}}{\delta b_q}\) involves up to third-order mixed sensitivities w.r.t. \(c_i\) and \(b_q\), such as \(\frac{\delta ^3 F}{\delta c_i \delta c_j \delta b_q}\). The computation of the second and third-order sensitivity derivatives is presented in detail in [24–26]. For instance, in the discrete sense, the highest-order derivative \(\frac{d^2 F}{dc_i dc_j db_q}\) is computed using the expression
where the adjoint variables \(\fancyscript{N}_{n}\) satisfy the equation
and the equations to be solved for \(\fancyscript{L}^{j}_{n}\) and \(\fancyscript{M}^{i}_{n}\) can be found in [24].
According to Eq. 31, \(\frac{dU_{k}}{dc_j}\) and \(\frac{d^2 U_{k}}{dc_idc_j}\) must be available. These are computed by twice applying the DD technique, practically by solving Eqs. 24 and 28. This is the costly part of the algorithm, since it costs as many as \(M \!+\! \frac{M(M+1)}{2}\) EFS. However, in the majority of cases, the environmental variables are much less than the design ones, \(M\ll N\). The computation of \(\fancyscript{K}_N^{i,j}, i,j\in [1,M]\) costs \(M \!+\! \frac{M(M+1)}{2}\) EFS and that of \(\fancyscript{M}_n^i, i\in [1,M]\) \(M\) EFS. The overall cost per optimization cycle becomes \(M^2\!+\!3M\!+\!2\) EFS; where the last two EFS correspond to the solution of the primal and adjoint (i.e. Eq. 32 for \(\fancyscript{N}\)) equations. The aforementioned technique, which is referred to as DD\(_c\)-DD\(_c\)-AV\(_b\) (subscripts denote whether the differentiation is made w.r.t. \(\mathbf {c}\) or \(\mathbf {b}\)) has the minimum computational cost, provided that \(M < N\).
3.3 Robust Design Using Continuous Adjoint
This section aims at briefly demonstrating that the material presented in Sects. 3.1 and 3.2 can also be based on the continuous, rather that the discrete, adjoint. Without loss in generality, this will be demonstrated in an inverse design problem, by assuming inviscid flow of a compressible fluid.
The steady–state 2D Euler equations of a compressible fluid are given by
where \(k=1,2\) (for the Cartesian components) and \(n=1,\ldots ,4\) (four equations in 2D). The inviscid fluxes \(f_{nk}\) are
where \(\rho \), \(p\), \(\upsilon _k\) and \(E\) stand for the density, pressure, Cartesian velocity components and total energy per unit volume, respectively. The array of conservative flow variables is \(\left[ U_1 , U_2 , U_3 , U_4 \right] = \left[ \rho , \rho \upsilon _1 , \rho \upsilon _2 , E \right] \). For the inverse design problem, the objective function is
where \(p_{tar}\) is the target pressure distribution along the solid wall.
In this problem, it is straightforward to derive the continuous adjoint PDEs which take the form
where \(A_{nmk}=\frac{\partial f_{nk}}{\partial U_m}\) (\(n=1,4, ~~m=1,4, ~~k=1,2\)) are the Jacobian matrices of the inviscid fluxes. Eq. 35 is equivalent to Eq. 32 in the continuous sense, considering that, in continuous adjoint, \(\frac{\partial F}{\partial U_{k}}\) appears in the application of boundary conditions.
In the continuous approach, the DD\(_c\)-DD\(_c\) approach can also be formulated by setting up, discretizing and numerically solving PDEs for \(\frac{\delta U_m}{\delta c_i}\) and \(\frac{\delta ^2 U_m}{\delta c_i \delta c_j}\). The \(M\) systems of PDEs, to be solved for \(\frac{\delta U_m}{\delta c_i}\), result from the first-order sensitivities of the Euler equations w.r.t. the environmental variables,
along with appropriate boundary conditions. For the \(\frac{M(M+1)}{2}\) systems of equations, to be solved for \(\frac{\delta ^2 U_m}{\delta c_i \delta c_j}\), \(i=1,M\), \(j=1,M\), Eq. 36 are differentiated once more to give
With known \(\frac{\delta U_m}{\delta c_i}\) and \(\frac{\delta ^2U_m}{\delta c_i \delta c_j}\) fields, the first- and second-order sensitivities of \(F\) w.r.t. the environmental variables are given by
and
where \(\frac{\delta p}{\delta c_i}\) and \(\frac{\delta ^2 p}{\delta c_i \delta c_j}\) can be expressed in terms of the corresponding derivatives of the conservative flow variables \(U_m\).
The highest-order mixed derivatives are computed through the solution of additional adjoint PDEs, similar to the corresponding discrete equations. For instance, the third-order mixed sensitivity derivatives of \(F\), required in Eq. 30, are given by
where the additional adjoint fields \(\fancyscript{L}^i_{n}=\frac{\delta \fancyscript{N}_{n}}{\delta c_i}\) and \(\fancyscript{K}^{i,j}_{n}=\frac{\delta \fancyscript{L}^i_{n}}{\delta c_j}\) are computed by solving the adjoint equations
and
as explained in [25]. Similarities between the discrete and continuous variants of the DD\(_c\)-DD\(_c\)-AV\(_b\) method can easily be identified.
An application of the robust design algorithm is illustrated in Fig. 8; it is related to the inverse design of a 2D cascade, [25, 26]. The airfoil shape controlling parameters are the design variables and the inlet/outlet flow conditions are the environmental ones.
3.4 Other Usage of the DD and AV Method
Apart from robust design applications, the developed methods for the computation of higher-order derivatives of \(F\) can also be used to support more efficient optimization methods, such as the (exact) Newton method. In such a case, however, the cost per optimization cycle depends on \(N\) and this may seriously hinder the use of such a method in industry. To cope with large scale optimization problems, the Newton equations can be solved through the CG method with truncation. By doing so, the Hessian matrix itself is not needed anymore, [27]. The adjoint approach followed by the DD of both the flow and adjoint equations (AV-DD) is the most efficient way to compute the product of the Hessian matrix with any vector required by the truncated Newton algorithm. The cost per Newton iteration scales linearly with the number of CG steps, rather than the much higher number of the design variables (if the Hessian itself was computed in the “exact” Newton method). The efficiency of the truncated Newton method is demonstrated in Fig. 9, in a problem with 42 design variables.
4 Industrial Applications
In Fig. 10, the application of the developed adjoint-based software to four industrial problems is presented. The first case deals with the blade optimization of a \(3D\) peripheral compressor cascade in which the objective is the minimization of entropy losses within the flow passage, [28]. The second case is concerned with the shape optimization of a Francis turbine runner targeting cavitation suppression, [29], the third one with an air-conditioning duct targeting minimum total pressure losses and the last one with the shape optimization of a Volkswagen concept car, targeting minimum drag force, [30]. More comments can be found in the caption [31].
References
P. Spalart and S. Allmaras: A one-equation turbulence model for aerodynamic flows. AIAA Paper, 04(39), 1992
Launder BE, Sharma BI (1974) Application of the energy-dissipation model of turbulence to the calculation of flow near a spinning disc. Lett Heat Mass Transf 1:131–137
Lee BJ, Kim C (2007) Automated design methodology of turbulent internal flow using discrete adjoint formulation. Aerosp Sci Technol 11:163–173
Mavriplis DJ (2007) Discrete adjoint-based approach for optimization problems on three-dimensional unstructured meshes. AIAA J 45:740–750
Pironneau O (1974) On optimum design in fluid mechanics. J Fluid Mech 64:97–110
Jameson A (1988) Aerodynamic design via control theory. J Sci Comput 3:233–260
Anderson WK, Venkatakrishnan V (1997) Aerodynamic design optimization on unstructured grids with a continuous adjoint formulation. AIAA Paper 97–0643
Papadimitriou DI, Giannakoglou KC (2007) A continuous adjoint method with objective function derivatives based on boundary integrals for inviscid and viscous flows. J Comput Fluids 36:325–341
Othmer C (2008) A continuous adjoint formulation for the computation of topological and surface sensitivities of ducted flows. Int J Numer Meth Fluids 58:861–877
Zymaris AS, Papadimitriou DI, Giannakoglou KC, Othmer C (2009) Continuous adjoint approach to the Spalart-Allmaras turbulence model for incompressible flows. Comput Fluids 38:1528–1538
Bueno-Orovio A, Castro C, Palacios F, Zuazua E (2012) Continuous adjoint approach for the SpalartAllmaras model in aerodynamic optimization. AIAA J 50:631–646
Zymaris AS, Papadimitriou DI, Giannakoglou KC, Othmer C (2010) Adjoint wall functions: a new concept for use in aerodynamic shape optimization. J Comput Phys 229:5228–5245
Papoutsis-Kiachagias EM, Zymaris AS, Kavvadias IS, Papadimitriou DI, Giannakoglou KC (2014) The continuous adjoint approach to the k-\(\epsilon \) turbulence model for shape optimization and optimal active control of turbulent flows. Eng Optim. doi:10.1080/0305215X.2014.892595
Asouti VG, Trompoukis XS, Kampolis IC, Giannakoglou C (2011) Unsteady CFD computations using vertex-centered finite volumes for unstructured grids on graphics processing units. Int J Numer Meth Fluids 67(2):232–246
Trompoukis XS, Tsiakas KT, Ghavami Nejad M, Asouti VG Giannakoglou KC (2014) The continuous adjoint method on graphics processing units for compressible flows. In: OPT-i, international conference on engineering and applied sciences optimization, Kos Island, Greece, 4–6 June 2014
Kavvadias IS, Papoutsis-Kiachagias EM, Dimitrakopoulos G, Giannakoglou KC (2014) The continuous adjoint approach to the k\(\omega \) SST turbulence model with applications in shape optimization. Eng Optim. doi:10.1080/0305215X.2014.979816
Kavvadias IS, Karpouzas GK, Papoutsis-Kiachagias EM, Papadimitriou DI, Giannakoglou KC (2013) Optimal flow control and topology optimization using the continuous adjoint method in unsteady flows. In: EUROGEN conference 2013, Las Palmas de Gran Canaria, Spain
Griewank A, Walther A (2000) Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation. ACM Trans Math Softw 26(1):19–45
Vezyris CK, Kavvadias IS, Papoutsis-Kiachagias EM, Giannakoglou KC (2014) Unsteady continuous adjoint method using POD for jet-based flow control. In: ECCOMAS conference 2014, Barcelona, Spain
Papoutsis-Kiachagias EM, Kontoleontos EA, Zymaris AS, Papadimitriou DI, Giannakoglou KC (2011) Constrained topology optimization for laminar and turbulent flows, including heat transfer. In: EUROGEN Conference 2011, Capua, Italy
Papadimitriou DI, Giannakoglou KC (2008) Computation of the Hessian matrix in aerodynamic inverse design using continuous adjoint formulations. Comput Fluids 37:1029–1039
Papadimitriou DI, Giannakoglou KC (2008) The continuous direct-adjoint approach for second-order sensitivities in viscous aerodynamic inverse design problems. Comput Fluids 38:1539–1548
Papadimitriou DI, Giannakoglou KC (2008) Aerodynamic shape optimization using adjoint and direct approaches. Arch Comput Meth Eng 15:447–488
Papoutsis-Kiachagias EM, Papadimitriou DI, Giannakoglou KC (2012) Robust design in aerodynamics using third-order sensitivity analysis based on discrete adjoint. Application to quasi-1D flows. Int J Numer Meth Fluids 69:691–709
Papadimitriou DI, Giannakoglou KC (2013) Third-order sensitivity analysis for robust aerodynamic design using continuous adjoint. Int J Numer Meth Fluids 71:652–670
Papoutsis-Kiachagias EM, Papadimitriou DI, Giannakoglou KC (2011) On the optimal use of adjoint methods in aerodynamic robust design problems. In: CFD and OPTIMIZATION, (2011) ECCOMAS thematic conference. Antalya, Turkey 2011
Papadimitriou DI, Giannakoglou KC (2012) Aerodynamic design using the truncated Newton algorithm and the continuous adjoint approach. Int J NumerMeth Fluids 68:724–739
Papadimitriou DI, Giannakoglou KC (2006) Compressor blade optimization using a continuous adjoint formulation. In: ASME TURBO EXPO, GT2006/90466, Barcelona, Spain, 8–11 May 2006
Papoutsis-Kiachagias EM, Kyriacou SA, Giannakoglou KC (2014) The continuous adjoint method for the design of hydraulic turbomachines. Comput Meth Appl Mech Eng 276:621–639
Othmer C, Papoutsis-Kiachagias E, Haliskos K (2011) CFD Optimization via sensitivity-based shape morphing. In: 4th ANSA & \(\mu \)ETA international conference, Thessaloniki, Greece, 2011
Menter FR (1994) Two-equation eddy-viscosity turbulence models for engineering applications. AIAA 32(8):269–289
Acknowledgments
Parts of the research related to the exact differentiation of the turbulence models were funded by Volkswagen AG (Group Research, K-EFFG/V, Wolfsburg, Germany) and Icon Technology and Process Consulting Ltd. The support of Volkswagen AG for the development of the adjoint method for flow control applications is also acknowledged.
Research related to topology optimization was partially supported by a Basic Research Project funded by the National Technical University of Athens.
The authors would like to acknowledge contributions to topology optimization from Dr. E Kontoleontos and to “turbulent” adjoint by Dr. A. Zymaris. They are also indebted to Dr. Carsten Othmer, Volkswagen AG (Group Research, K-EFFG/V), for his support, some interesting discussions on the continuous adjoint method and his contributions in several parts of this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Giannakoglou, K.C., Papadimitriou, D.I., Papoutsis-Kiachagias, E.M., Kavvadias, I.S. (2015). Aerodynamic Shape Optimization Using “Turbulent” Adjoint And Robust Design in Fluid Mechanics. In: Lagaros, N., Papadrakakis, M. (eds) Engineering and Applied Sciences Optimization. Computational Methods in Applied Sciences, vol 38. Springer, Cham. https://doi.org/10.1007/978-3-319-18320-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-18320-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18319-0
Online ISBN: 978-3-319-18320-6
eBook Packages: EngineeringEngineering (R0)