Adjoint‐based airfoil optimization with discretization error control

In this article, we develop a new airfoil shape optimization algorithm based on higher‐order adaptive DG methods with control of the discretization error. Each flow solution in the optimization loop is computed on a sequence of goal‐oriented h‐refined or hp‐refined meshes until the error estimation of the discretization error in a flow‐related target quantity (including the drag and lift coefficients) is below a prescribed tolerance. Discrete adjoint solutions are computed and employed for the multi‐target error estimation and adaptive mesh refinement. Furthermore, discrete adjoint solutions are employed for evaluating the gradients of the objective function used in the CGs optimization algorithm. Furthermore, an extension of the adjoint‐based gradient evaluation to the case of target lift flow computations is employed. The proposed algorithm is demonstrated on an inviscid transonic flow around the RAE2822, where the shape is optimized to minimize the drag at a given constant lift and airfoil thickness. The effect of the accuracy of the underlying flow solutions on the quality of the optimized airfoil shapes is investigated. Copyright © 2014 John Wiley & Sons, Ltd.     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

A gas‐kinetic scheme for the simulation of turbulent flows on unstructured meshes

This paper presents a numerical method for simulating turbulent flows via coupling the Boltzmann BGK equation with Spalart–Allmaras one equation turbulence model. Both the Boltzmann BGK equation and the turbulence model equation are carried out using the finite volume method on unstructured meshes, which is different from previous works on structured grid. The application of the gas‐kinetic scheme is extended to the simulation of turbulent flows with arbitrary geometries. The adaptive mesh refinement technique is also adopted to reduce the computational cost and improve the efficiency of meshes. To organize the unstructured mesh data structure efficiently, a non‐manifold hybrid mesh data structure is extended for polygonal cells. Numerical experiments are performed on incompressible flow over a smooth flat plate and compressible turbulent flows around a NACA 0012 airfoil using unstructured hybrid meshes. These numerical results are found to be in good agreement with experimental data and/or other numerical solutions, demonstrating the applicability of the proposed method to simulate both subsonic and transonic turbulent flows. Copyright © 2016 John Wiley & Sons, Ltd.     

An h-adaptive solution of the spherical blast wave problem

Shock waves and contact discontinuities usually appear in compressible flows, requiring a fine mesh in order to achieve an acceptable accuracy of the numerical solution. The usage of a mesh adaptation strategy is convenient as uniform refinement of the whole mesh becomes prohibitive in three-dimensional (3D) problems. An unsteady h-adaptive strategy for unstructured finite element meshes is introduced. Non-conformity of the refined mesh and a bounded decrease in the geometrical quality of the elements are some features of the refinement algorithm. A 3D extension of the well-known refinement constraint for 2D meshes is used to enforce a smooth size transition among neighbour elements with different levels of refinement. A density-based gradient indicator is used to track discontinuities. The solution procedure is partially parallelised, i.e. the inviscid flow equations are solved in parallel with a finite element SUPG formulation with shock capturing terms while the adaptation of the mesh is sequentially performed. Results are presented for a spherical blast wave driven by a point-like explosion with an initial pressure jump of 10⁵ atmospheres. The adapted solution is compared to that computed on a fixed mesh. Also, the results provided by the theory of self-similar solutions are considered for the analysis. In this particular problem, adapting the mesh to the solution accounts for approximately 4% of the total simulation time and the refinement algorithm scales almost linearly with the size of the problem.     

Anisotropic mesh adaptation: towards user‐independent,mesh‐independent and solver‐independent CFD. Part III. Unstructured meshes

The present paper is the third article in a three‐part series on anisotropic mesh adaptation and its application to two‐ and three‐dimensional, structured and unstructured meshes. This third paper concerns the application of the full adaptation methodology to 2‐D unstructured meshes, including all four mesh modification strategies presented in Part I, i.e. refinement/coarsening, edge swapping and node movement. The mesh adaptation procedure is validated through a careful monitoring of a single adaptation step and of the solution–adaptation loop. Independence from the initial mesh and from the flow solver is illustrated. The efficiency of the overall methodology is investigated on relevant laminar and turbulent flow benchmarks. Copyright © 2002 John Wiley & Sons, Ltd.     

A parallel unstructured dynamic mesh adaptation algorithm for 3‐D unsteady flows

An unstructured dynamic mesh adaptation and load balancing algorithm has been developed for the efficient simulation of three‐dimensional unsteady inviscid flows on parallel machines. The numerical scheme was based on a cell‐centred finite‐volume method and the Roe's flux‐difference splitting. Second‐order accuracy was achieved in time by using an implicit Jacobi/Gauss–Seidel iteration. The resolution of time‐dependent solutions was enhanced by adopting an h‐refinement/coarsening algorithm. Parallelization and load balancing were concurrently achieved on the adaptive dynamic meshes for computational speed‐up and efficient memory redistribution. A new tree data structure for boundary faces was developed for the continuous transfer of the communication data across the parallel subdomain boundary. The parallel efficiency was validated by applying the present method to an unsteady shock‐tube problem. The flows around oscillating NACA0012 wing and F‐5 wing were also calculated for the numerical verification of the present dynamic mesh adaptation and load balancing algorithm. Copyright © 2005 John Wiley & Sons, Ltd.     

The direct simulation Monte Carlo method using unstructured adaptive mesh and its application

The implementation of an adaptive mesh‐embedding (h‐refinement) scheme using unstructured grid in two‐dimensional direct simulation Monte Carlo (DSMC) method is reported. In this technique, local isotropic refinement is used to introduce new mesh where the local cell Knudsen number is less than some preset value. This simple scheme, however, has several severe consequences affecting the performance of the DSMC method. Thus, we have applied a technique to remove the hanging node, by introducing the an‐isotropic refinement in the interfacial cells between refined and non‐refined cells. Not only does this remedy increase a negligible amount of work, but it also removes all the difficulties presented in the originals scheme. We have tested the proposed scheme for argon gas in a high‐speed driven cavity flow. The results show an improved flow resolution as compared with that of un‐adaptive mesh. Finally, we have used triangular adaptive mesh to compute a near‐continuum gas flow, a hypersonic flow over a cylinder. The results show fairly good agreement with previous studies. In summary, the proposed simple mesh adaptation is very useful in computing rarefied gas flows, which involve both complicated geometry and highly non‐uniform density variations throughout the flow field. Copyright © 2002 John Wiley & Sons, Ltd.     

A high‐order element based adaptive mesh refinement strategy for three‐dimensional unstructured grid

Adaptive mesh refinement (AMR) shows attractive properties in automatically refining the flow region of interest, and with AMR, better prediction can be obtained with much less labor work and cost compared to manually remeshing or the global mesh refinement. Cartesian AMR is well established; however, AMR on hybrid unstructured mesh, which is heavily used in the high‐Reynolds number flow simulation, is less matured and existing methods may result in degraded mesh quality, which mostly happens in the boundary layer or near the sharp geometric features. User intervention or additional constraints, such as freezing all boundary layer elements or refining the whole boundary layer, are required to assist the refinement process. In this work, a novel AMR strategy is developed to handle existing difficulties. In the new method, high‐order unstructured elements are first generated based on the baseline mesh; then the refinement is conducted in the parametric space; at last, the mesh suitable for the solver is output. Generating refined elements in the parametric space with high‐order elements is the key of this method and this helps to guarantee both the accuracy and robustness. With the current method, 3‐dimensional hybrid unstructured mesh of huge size and complex geometry can be automatically refined, without user intervention nor additional constraints. With test cases including the 2‐dimensional airfoil and 3‐dimensional full aircraft, the current AMR method proves to be accurate, simple, and robust.     

An Assessment of Detached-Eddy Simulations of Unsteady Crosswind Aerodynamics of Road Vehicles

In this paper, the availability of Detached-Eddy Simulations (DES) for simulating unsteady crosswind aerodynamics in industrial applications is explored and reported. The flow around a simple car geometry under headwind, steady crosswind and time-dependent wind gust respectively, is analysed for two different types of mesh using a commercial software, STAR-CD. The typical Reynolds number of the flow cases studied is 2.0 · 10⁶ based on the vehicle length. The performances of polyhedral meshes together with a comparable hexahedral mesh are evaluated for capturing the time development of the flow structures during a gust. From the results presented, it can be concluded that the aerodynamic coefficients can be reliably calculated using both polyhedral and hexahedral meshes, although the fine turbulent structures in the wake are better captured with the hexahedral mesh. Using turbulence methods like DES in order to resolve the flow scales provides a significant insight for designing a ground vehicle and, due to the reasonable computational times involved, can hence be foreseen to be incorporated in a design process in a near future.     

A high‐precision unstructured adaptive mesh technique for gas–liquid two‐phase flows

Adaptive mesh techniques are used widely in the numerical simulations of fluid flows, and the simulation results with high accuracies are obtained by appropriate mesh adaptations. However, gas–liquid two‐phase flows are still difficult to be simulated on adaptive meshes, especially on unstructured adaptive meshes, because the physical phenomena near gas–liquid interfaces are highly complicated and in general, not modeled appropriately on adaptive meshes. In this paper, a high‐precision unstructured adaptive mesh technique for gas–liquid two‐phase flows is developed and verified/validated. In the unstructured adaptive mesh technique, the PLIC algorithm is employed to simulate interfacial dynamic behaviors and, therefore, the reconstruction method for the interfaces in refined cells is developed, which satisfies the gas and liquid volume conservations and geometrical conservations of interfaces. In addition, the physics‐based consideration is performed on the momentum calculations near interfaces, and the calculation method with gas and liquid momentum conservations is developed. For verification, the slotted‐disk revolution problem is solved. As a result, the unstructured adaptive mesh technique succeeds in reproducing the slotted‐disk shape accurately and well maintaining the shape after one full‐revolution. The dam‐break problem is also simulated and the momentum conservative calculation method succeeds in providing physically appropriate results, which show good agreements with experimental data. Therefore, it is confirmed that the developed unstructured adaptive mesh technique is very efficient to simulate gas–liquid two‐phase flows accurately. Copyright © 2010 John Wiley & Sons, Ltd.     

Computation of free‐surface flows with local mesh adaptation

This paper describes a modern free‐surface capturing strategy implemented in an unstructured finite‐volume viscous flow solver that can handle moving grids composed of arbitrary‐shaped control volumes. An adaptive mesh strategy is fully integrated in the code making it a single tool for dynamically maintaining a prescribed density of grid points around the steady or unsteady interface between air and water. The whole adaptive procedure is described in detail. The efficiency of the overall approach is examined on two‐ and three‐dimensional hydrodynamic applications. The adaptive strategy achieves interesting gains in terms of computational and human efforts compared to single‐mesh computations. Copyright © 2005 John Wiley & Sons, Ltd.     

Experimental and numerical investigation on sound generation from airfoil-flow interaction

Aerodynamic noise due to interaction between incoming turbulence and rotating blades is an important component in the wind turbine noise. The rod-airfoil configuration is used to investigate the interactive phenomenon experimentally and numerically. Distribution of unsteady pressure on the airfoil surface is measured for different rod positions and airfoil attack angles. Two National Advisory Committee for Aeronatics (NACA) airfoils, NACA0012 and NACA0018, and two wind turbine airfoils, S809 and S825 are investigated. In addition, for low angles of attack, the flow field around the airfoil's leading edge is investigated with the particle image velocimetry (PIV). The experimental results indicate that unsteady pressure disturbances on the airfoil surface are related to the rod vortex shedding. Meanwhile, the interaction flow field of the rod and NACA0012 airfoil is simulated with the unsteady Reynolds averaged Navier-Stokes method (URANS), and the obtained pressure spectra are compared with the experimental results.     

Mesh adaptation for simulation of unsteady flow with moving immersed boundaries

In this work, an approach for performing mesh adaptation in the numerical simulation of two‐dimensional unsteady flow with moving immersed boundaries is presented. In each adaptation period, the mesh is refined in the regions where the solution evolves or the moving bodies pass and is unrefined in the regions where the phenomena or the bodies deviate. The flow field and the fluid–solid interface are recomputed on the adapted mesh. The adaptation indicator is defined according to the magnitude of the vorticity in the flow field. There is no lag between the adapted mesh and the computed solution, and the adaptation frequency can be controlled to reduce the errors due to the solution transferring between the old mesh and the new one. The preservation of conservation property is mandatory in long‐time scale simulations, so a P1‐conservative interpolation is used in the solution transferring. A nonboundary‐conforming method is employed to solve the flow equations. Therefore, the moving‐boundary flows can be simulated on a fixed mesh, and there is no need to update the mesh at each time step to follow the motion or the deformation of the solid boundary. To validate the present mesh adaptation method, we have simulated several unsteady flows over a circular cylinder stationary or with forced oscillation, a single self‐propelled swimming fish, and two fish swimming in the same or different directions. Copyright © 2012 John Wiley & Sons, Ltd.     

ADAPTIVE MESH REFINEMENT METHODS FOR THREE-DIMENSIONAL INVISCID FLOW PROBLEMS

SUMMARY

The local grid refinement technique is incorporated into a finite volume program that solves the three-dimensional compressible Euler equations. The underlying idea is to improve the solution accuracy in domains of dominating physical flow features, thus avoiding a global fine mesh to resolve most of the smooth flow. An unstructured data system is introduced to manage point enrichment on multiple refinement levels for structured meshes of hexahedral cells. Grid adaption is utilized to cluster points automatically in domains of interest. The multi-block formulation permits the application of the refinement method to various external flow configurations.     

Parallel adaptive refinement for unsteady flow calculations on 3D unstructured grids

A parallel adaptive refinement algorithm for three‐dimensional unstructured grids is presented. The algorithm is based on an hierarchical h‐refinement/derefinement scheme for tetrahedral elements.The algorithm has been fully parallelized for shared‐memory platforms via a domain decomposition of the mesh at the algebraic level. The effectiveness of the procedure is demonstrated with applications which involve unsteady compressible fluid flow. A parallel speedup study of the algorithm also is included. Published in 2004 by John Wiley & Sons, Ltd.     

Anisotropic mesh adaptation: towards user‐independent,mesh‐independent and solver‐independent CFD. Part II. Structured grids

The present paper is the second article in a three‐part series on anisotropic mesh adaptation and its application to (2‐D) structured and unstructured meshes. In the first article, the theory was presented, the methodology detailed and brief examples given of the application of the method to both types of grids. The second part details the application of the mesh adaptation method to structured grids. The adaptation operations are restricted to mesh movement in order to avoid the creation of hanging nodes. Being based on a spring analogy with no restrictive orthogonality constraint, a wide grid motion is allowed. The adaptation process is first validated on analytical test cases and its high efficiency is shown on relevant transonic and supersonic benchmarks. These latter test cases are also solved on adapted unstructured grids to provide a reference for comparison studies. The third part of the series will demonstrate the capability of the methodology on 2‐D unstructured test cases. Copyright © 2002 John Wiley & Sons, Ltd.     

An hp‐adaptive unstructured finite volume solver for compressible flows

The idea of hp‐adaptation, which has originally been developed for compact schemes (such as finite element methods), suggests an adaptation scheme using a mixture of mesh refinement and order enrichment based on the smoothness of the solution to obtain an accurate solution efficiently. In this paper, we develop an hp‐adaptation framework for unstructured finite volume methods using residual‐based and adjoint‐based error indicators. For the residual‐based error indicator, we use a higher‐order discrete operator to estimate the truncation error, whereas this estimate is weighted by the solution of the discrete adjoint problem for an output of interest to form the adaptation indicator for adjoint‐based adaptations. We perform our adaptation by local subdivision of cells with nonconforming interfaces allowed and local reconstruction of higher‐order polynomials for solution approximations. We present our results for two‐dimensional compressible flow problems including subsonic inviscid, transonic inviscid, and subsonic laminar flow around the NACA 0012 airfoil and also turbulent flow over a flat plate. Our numerical results suggest the efficiency and accuracy advantages of adjoint‐based hp‐adaptations over uniform refinement and also over residual‐based adaptation for flows with and without singularities.     

Numerical investigation of BB-AMR scheme using entropy production as refinement criterion

In this work, a parallel finite volume scheme on unstructured meshes is applied to fluid flow for multidimensional hyperbolic system of conservation laws. It is based on a block-based adaptive mesh refinement strategy which allows quick meshing and easy parallelisation. As a continuation and as an extension of a previous work, the useful numerical density of entropy production is used as mesh refinement criterion combined with a local time-stepping method to preserve the computational time. Then, we numerically investigate its efficiency through several test cases with a confrontation with exact solution or experimental data.     

A well‐balanced stable generalized Riemann problem scheme for shallow water equations using adaptive moving unstructured triangular meshes

We propose a well‐balanced stable generalized Riemann problem (GRP) scheme for the shallow water equations with irregular bottom topography based on moving, adaptive, unstructured, triangular meshes. In order to stabilize the computations near equilibria, we use the Rankine–Hugoniot condition to remove a singularity from the GRP solver. Moreover, we develop a remapping onto the new mesh (after grid movement) based on equilibrium variables. This, together with the already established techniques, guarantees the well‐balancing. Numerical tests show the accuracy, efficiency, and robustness of the GRP moving mesh method: lake at rest solutions are preserved even when the underlying mesh is moving (e.g., mesh points are moved to regions of steep gradients), and various comparisons with fixed coarse and fine meshes demonstrate high resolution at relatively low cost. Copyright © 2013 John Wiley & Sons, Ltd.