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 Introduction

Compared to direct computational fluid dynamics (CFD) problems, inverse problems [15] have been of ongoing interest to aerodynamic researchers. The position reconstruction is one of the important problems in high lift devices using multi element airfoils configurations. The goal of our present study is to implement efficiently on the computer a simple reconstruction problem with Genetic Algorithms (GAs) [10] and/or Nash GAs [11, 15] to reconstruct the target position of oscillating airfoils based on prescribed conditions.

Meshless methods (see, e.g., [29]) do not use the concept of mesh topology and provide more geometrical flexibility for computing flow fields. In addition, they are also useful in design optimization problems around complex configurations without constraints required by mesh quality and topology. A fast meshless method coupled with artificial dissipation (AD) using second and fourth order derivatives is employed for solving two-dimensional (2D) Euler equations. Spatial derivatives of the governing equations are approximated by a weighted least square (WLS) method discretizing the computational domain into clouds of points (see, e.g., [14]). An explicit five-stage Runge-Kutta scheme is utilized to reach the steady-state solution. A local time-stepping method and a residual averaging [3] are employed to accelerate the rate of convergence. Dynamic clouds of points based on the Delaunay graph mapping [8] are selected to ensure the flow field points following the movements of body boundaries.

The proposed approach is validated by comparing our numerical results against a finite volume method presented in [6] for a single oscillating NACA0012 airfoil. In this paper, we have tested the position reconstructions of oscillating airfoils operating in transonic regimes for aerodynamic design. Position reconstruction of a single airfoil has been tested using GAs optimizer. Position reconstruction of two airfoils has been tested with Nash GAs using both the fast meshless method coupled with AD and the finite volume method on the same computational nodes. Comparisons of prescribed and computed parameters are presented to show the efficacy of the fast meshless method coupled with AD and Nash game strategy in the position reconstruction problems in aerodynamic design.

The rest of the paper is organized as follows. Section 2 describes the methodology of the dynamic cloud method based on the Delaunay graph mapping strategy and the meshless method coupled with AD. Section 3 shows the validation of the proposed meshless method. Section 4 conducts two practical optimization applications and conclusions are presented in Sect. 5.

2 Methodology

2.1 Dynamic Cloud Method Based on the Delaunay Graph Mapping Strategy

In order to simulate the relative movement of boundaries in the position reconstruction, it is required that a cloud of points has the ability to move with the rigid body boundaries. Hence, a fast and efficient dynamic cloud method based on the Delaunay graph mapping strategy [8] is introduced here.

Firstly, as shown in Fig. 5.1, a Delaunay triangulation of the computational field is set up by using the given points located on the boundaries for BI-NACA0012 airfoils. Then, the triangulation is contained for every point P(x,y) in the computational field. Notate the points of every element E(x 1,y 1), E(x 2,y 2) and E(x 3,y 3), then the coordinates of the point can be expressed as

$$ \left\{ \begin{aligned} x & = a_{1}x_{1}+a_{2}x_{2}+a_{3}x_{3}, \\ y & = a_{1}y_{1}+a_{2}y_{2}+a_{3}y_{3}, \end{aligned} \right. $$
(5.1)

where a 1=S 1/S, a 2=S 2/S, a 3=S 3/S; S, S 1, S 2, S 3 are the relevant triangle’s areas [8]. Then, all the background points by the movement of the boundary’s points are adjusted. The coordinates of the relevant triangle become \(E(x'_{1},y'_{1})\), \(E(x'_{2},y'_{2})\) and \(E(x'_{3},y'_{3})\), and the new coordinates of point can be denoted as

$$ \left\{ \begin{aligned} x' & = a_{1}x'_{1}+a_{2}x'_{2}+a_{3}x'_{3}, \\ y' & = a_{1}y'_{1}+a_{2}y'_{2}+a_{3}y'_{3}. \end{aligned} \right. $$
(5.2)
Fig. 5.1
figure 1

Global and close-up views of a Delaunay graph in the case of NACA0012 airfoils

In [14] it is shown that better results can be obtained by using the Delaunay graph mapping strategy to ensure the flow field points following the movements of the body boundaries without any iteration. And compared to the spring analogy method described in [5].

2.2 Governing Equations

The so-called Euler equations represent the conservation principle for mass, momentum, and energy for inviscid fluids. In a 2D Cartesian coordinate system, Euler equations are expressed in the following form:

$$ \frac{\partial{ \mathbf {W}}}{\partial{t}} +\frac{\partial{ \mathbf {E}}}{\partial{x}} +\frac{\partial{ \mathbf {F}}}{\partial{y}} = 0, $$
(5.3)

where t denotes time and (x,y) the Cartesian coordinates. The expressions of conservative variables W and convective fluxes E, F are introduced as

$$ \mathbf {W} = \begin{bmatrix} \rho\\ \rho u\\ \rho v\\ e \end{bmatrix} , \qquad \mathbf {E} = \begin{bmatrix} \rho u\\ \rho u^2+p\\ \rho uv\\ (e+p)u \end{bmatrix} , \qquad \mathbf {F} = \begin{bmatrix} \rho v\\ \rho uv\\ \rho v^2+p\\ (e+p)v \end{bmatrix} , $$
(5.4)

where ρ denotes the density, u is the x-velocity component, v is the y-velocity component, p is the pressure, and e is the total energy per unit volume. For an ideal gas, e can be written as

$$e=\frac{p}{\gamma-1}+\frac{1}{2}\rho\bigl(u^2+v^2 \bigr), $$

where γ is the ratio of specific heat. Additionally, the equation of state is given by

$$p=\rho\bar{{R}} {T}, $$

where T is the static temperature and \(\bar{{R}}\) is the ideal gas constant.

2.3 Spatial Discretization

The WLS method [4] is used to approximate the spatial first-order derivatives, and in the cloud C(i) as shown in Fig. 5.2, (5.3) becomes

$$ \frac{\partial{ \mathbf {W}}}{\partial{t}}\bigg|_{i}+ \biggl(\frac{\partial{ \mathbf {E}}}{\partial{x}} + \frac{\partial{ \mathbf {F}}}{\partial{y}} \biggr)_{i}=0. $$
(5.5)

For the convective fluxes, let

$$ \mathbf {Q}_{i}= \biggl(\frac{\partial{ \mathbf {E}}}{\partial{x}} + \frac{\partial{ \mathbf {F}}}{\partial{y}} \biggr)_{i}. $$
(5.6)

According to the WLS method [4], (5.6) could be written as

$$ \mathbf {Q}_{i}=\sum\alpha_{ik} \mathbf {E}_{ik}+\sum\beta_{ik}\mathbf {F}_{ik}. $$
(5.7)

Then the governing equation can be written as

$$ \frac{d\mathbf {W}_{i}}{dt}={-} \Biggl(\mathbf {Q}_{i}- \sum ^{{N}}_{k=1}d_{ik} \Biggr), $$
(5.8)

where [3]

$$\begin{aligned} d_{ik}& = \epsilon^{(2)}_{ik} (\mathbf {W}_{k}-\mathbf {W}_{i} ) -\epsilon^{(4)}_{ik} \bigl(\nabla^{2}\mathbf {W}_{k}-\nabla^{2} \mathbf {W}_{i} \bigr), \\ \epsilon^{(2)}_{ik} & = {K}^{(2)}\lambda_{ik} \max(\upsilon_{i}, \upsilon_{k}), \\ \epsilon^{(4)}_{ik} & = \lambda_{ik}\max \bigl[0,{K}^{(4)}-\epsilon^{(2)}_{ik} \bigr], \\ \upsilon_{i} & = \frac{\vert \nabla^{2}{P}_{i}\vert }{\sum^{{N}}_{k=1} ({P}_{i}+{P}_{k} )}, \\ \nabla^{2}\mathbf {W}_{i} & = \sum ^{{N}}_{k=1}\mathbf {W}_{k}-{N}\mathbf {W}_{i}, \\ \lambda_{ik} & = \vert \alpha_{ik}u+\beta_{ik}v \vert +c\sqrt{\alpha_{ik}^{2}+\beta_{ik}^{2}}. \end{aligned} $$

Here \(c=\sqrt{\gamma p/\rho}\) is the local speed of sound.

Fig. 5.2
figure 2

A typical structure of the cloud C(i)

2.4 Temporal Discretization

Within the cloud C(i), the semi-discretisation Euler equations are rewritten as

$$ \frac{\partial{ \mathbf {W}}}{\partial{t}}\bigg \vert _i= \mathbf {R}_i, $$
(5.9)

where R i means the residual value. An explicit scheme is used for time discretisation in (5.9), and we get

$$ \frac{\mathbf {W}^{n+1}_{i}-\mathbf {W}^{n}_{i}}{\Delta t}=\mathbf {R}_{i}. $$
(5.10)

The superscripts n and (n+1) denote the time levels. Hence, W n means the flow solution at the present time t, and W n+1 represents the solution at the time (tt). An explicit five-stage Runge-Kutta time integration scheme is used

$$ \left\{ \begin{aligned} \mathbf {W}^{(0)}_{i} & =\mathbf {W}^{n}_{i}, \\ \mathbf {W}^{(1)}_{i} & =\mathbf {W}^{(0)}_{i}+ \alpha_{1}\Delta t_{i}\mathbf {R}^{(0)}_{i}, \\ \mathbf {W}^{(2)}_{i} & =\mathbf {W}^{(0)}_{i}+ \alpha_{2}\Delta t_{i}\mathbf {R}^{(1)}_{i}, \\ \mathbf {W}^{(3)}_{i} & =\mathbf {W}^{(0)}_{i}+ \alpha_{3}\Delta t_{i}\mathbf {R}^{(2)}_{i}, \\ \mathbf {W}^{(4)}_{i} & =\mathbf {W}^{(0)}_{i}+ \alpha_{4}\Delta t_{i}\mathbf {R}^{(3)}_{i}, \\ \mathbf {W}^{(5)}_{i} & =\mathbf {W}^{(0)}_{i}+ \alpha_{5}\Delta t_{i}\mathbf {R}^{(4)}_{i}, \\ \mathbf {W}^{n+1}_{i} & =\mathbf {W}^{(5)}_{i}, \end{aligned} \right. $$
(5.11)

where α k , k=1,2,3,4,5, represents the stage coefficients, and we have \(\alpha_{1}=\frac{1}{4}\), \(\alpha_{2}=\frac{1}{6}\), \(\alpha_{3}=\frac{3}{8}\), \(\alpha_{4}=\frac{1}{2}\), α 5=1.

The major disadvantage of the explicit scheme is that the time step is restricted by the Courant-Friedrichs-Lewy (CFL) stability condition [3].

2.5 Acceleration Techniques

In order to accelerate the convergence, a local time stepping method and an implicit residual averaging method are employed in our present work. The local time step Δt i of a discrete point is given by the equation [3, 12, 13]

$$ \Delta t=\frac{C_{\mathrm{CFL}}}{\sum^{N}_{k=1}\vert \alpha_{ik}u +\beta_{ik}v\vert +c\sqrt{\alpha_{ik}^{2}+\beta_{ik}^{2}}}, $$
(5.12)

where C CFL denotes the coefficient of CFL.

In the meshless method for the time marching equation, let R i represent the residual at node i. The new residual [3] can be given as

$$ \mathbf {R}'_{i} = \frac{\mathbf {R}_{i} +\epsilon \sum^{M}_{k=1}\mathbf {R}'_{k}}{1+\epsilon M}, $$
(5.13)

where ϵ=[0.2,0.5] and it can be obtained by performing two Jacobi iterations. The above technique allows the CFL number to be increased twofold or threefold when compared to the unsmoothed value, and consequently the CFL number is increased from \(2\sqrt{2}\) to 5 in the present study.

3 Validation of the Fast Meshless Method Implemented with Artificial Dissipation (AD)

In order to validate the proposed fast meshless method coupled with AD, a single NACA0012 airfoil operating with flow conditions at a 3.0° angle of attack and a Mach number 0.5 is tested. Figure 5.3 provides both the global view and the close-up view of the cloud of points distributed around one single NACA0012 airfoil, and Fig. 5.4 shows both the global view and the close-up view of the mesh distributed for the same airfoil. There are 5047 nodes in the whole computational domain in the meshless method and 9762 elements in the mesh method. Figure 5.5 shows the comparison of surface pressure coefficients for this test case using the fast meshless method coupled with AD and the finite volume method in [6].

Fig. 5.3
figure 3

Global and close-up views of the cloud of points for the NACA0012 airfoil

Fig. 5.4
figure 4

Global and close-up views of the mesh for the NACA0012 airfoil

Fig. 5.5
figure 5

Comparisons of surface pressure coefficients for the NACA0012 airfoil

Figure 5.6 shows the comparison of the convergence history for this case using the fast meshless method coupled with AD and the referenced mesh method [6]. As shown in the histogram in Figs. 5.7 and 5.8, the meshless method coupled with AD in this test case saves 71.5 % in the iteration costs compared to the finite volume method described in [6]. In terms of the CPU time needed in this test case, the meshless method coupled with AD saves 65.7 % compared to the finite volume method in [6]. The computer hardware used in this paper is an Intel(R) Core(TM) with 2 Quad CPU Q9650 with frequency 2.00 GHz/2.99 GHz and 3.00 GB of RAM.

Fig. 5.6
figure 6

Comparisons of the convergence history for the NACA0012 airfoil

Fig. 5.7
figure 7

Comparisons of the convergence history in terms of the number of iterations for the NACA0012 airfoil

Fig. 5.8
figure 8

Comparisons of the convergence history in terms of the CPU cost for the NACA0012 airfoil

4 Practical Optimization Applications

In this section, both the fast meshless method coupled with AD and the finite volume method referenced in [6] are used to test two inverse position reconstruction problems: a single pitching NACA0012 airfoil and BI-NACA0012 airfoils.

4.1 A Single Pitching NACA0012 Airfoil

Let one airfoil oscillate in pitch about its quarter chord, and the rotating angle α is selected as the design parameter. The objective function is defined according to the surface pressure coefficients as

$$ \min f(\alpha)=\sum_{i=1}^{M} \bigl \vert C_p(\alpha)-C_p\bigl(\alpha^{*}\bigr)\bigr \vert _i^2, $$
(5.14)

where M is the total number of points distributed on the surface of an airfoil, the search space is α∈[−10.0,10.0], and α is the prescribed design variable. Parameters of the GAs optimizer are chosen as: the size of population is 20, the probability of crossover is 0.85, and the probability of mutation is 0.01.

The flow conditions of the reconstruction test case are as follows: the Mach number is 0.8 and the target angle of attack is 0.0°. Figure 5.9 shows the convergence history of fitness value during the reconstruction process using the fast meshless method coupled with AD and the finite volume method in [6] separately. As shown on the histogram of Fig. 5.10, the meshless method coupled with AD saves 69.7 % compared to the finite volume method referenced in [6] in terms of the CPU time cost.

Fig. 5.9
figure 9

Comparisons of the convergence history in terms of fitness value for a single NACA0012 airfoil

Fig. 5.10
figure 10

Comparisons of the convergence history in terms of the CPU cost for the NACA0012 airfoil

4.2 BI-NACA0012 Airfoil’s Configuration

Let two airfoils oscillate in pitch about their quarter chords, and rotating angles α 1, α 2 are selected as design parameters. The two objective functions defined in a reconstruction problem solved by the Nash-GAs optimizer are

(5.15)
(5.16)

where M 1 is the total number of points distributed on the surface of the upper airfoil while M 2 is the total number of points distributed on the surface of the lower airfoil, the search spaces are α 1∈[−10.0,10.0], α 2∈[−10.0,10.0], and \(\alpha_{1}^{*}\), \(\alpha_{2}^{*}\) are prescribed parameters. The parameters in Nash GAs are chosen as follows: the size of the population is 10, the probability of crossover is 0.85, and the probability of mutation is 0.02.

The Euler flow conditions around the BINACA0012 configuration are the following: the Mach number is 0.5 and the prescribed parameters are 0.0° and 0.0°. Figure 5.11 shows the convergence history of the objective function during the reconstruction process using Nash GAs based on the meshless method coupled with AD and the finite volume method in [6]. As shown in the histogram in Fig. 5.12, the meshless method coupled with AD saves 75.8 % compared to the finite volume method in [6] in terms of the CPU time cost.

Fig. 5.11
figure 11

Comparisons of the convergence history for BINACA0012 airfoils in terms of the objective function using the fast meshless method coupled with AD and the standard mesh method

Fig. 5.12
figure 12

Comparisons of the convergence history in terms of the CPU cost for the BI-NACA0012 airfoils

5 Conclusions and Future

A fast Euler meshless method using artificial dissipations is used in this paper. Dynamic clouds of points based on a Delaunay graph mapping strategy have been introduced to ensure that flow field points can easily follow the movements of solid body boundaries. Position reconstructions of oscillating airfoils operating in transonic regimes have been tested for future aerodynamic design like high lift devices. First a single airfoil position reconstruction has been tested successfully with a simple GAs optimizer. Then, position reconstruction of two airfoils has been tested with Nash GAs using both the fast meshless method coupled with AD and the finite volume method referenced in [6] using the same number of computational nodes. Comparisons of target geometries and computed parameters are presented to prove the superiority of the meshless Euler flow analyzer methods implemented with AD coupled with the Nash evolutionary optimizer for position reconstruction inverse problems in aerodynamic design. This study is a roadmap to more complex design optimization problems which can benefit of game coalitions [7] in terms of accuracy and efficiency.