Sequential feature‐based mesh movement and adjoint error‐based mesh refinement

Nowadays, aerodynamic computational modeling is carried out on a daily basis in an industrial setting. This is done with the aim of predicting the performance and flow characteristics of new components. However, limited resources in terms of time and hardware force the engineer to employ relatively coarse computational grids, thus achieving results with variable degree of inaccuracy. In this article, a novel combination of feature and adjoint‐based mesh adaptation methods is investigated and applied to typical three‐dimensional turbomachinery cases, such as compressor and fan blades. The proposed process starts by employing feature‐based mesh movement to improve the global flow solution and then adjoint refinement to tune the mesh for each quantity of interest. Comparison of this process with one utilizing only the adjoint refinement procedure shows significant benefits in terms of accuracy of the performance quantity.     

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.     

Mono‐block and non‐matching multi‐block structured mesh adaptation based on aerodynamic functional total derivatives for RANS flow

An enhanced goal‐oriented mesh adaptation method is presented based on aerodynamic functional total derivatives with respect to mesh nodes in a Reynolds‐Averaged Navier‐Stokes (RANS) finite‐volume mono‐block and non‐matching multi‐block‐structured grid framework. This method falls under the category of methods involving the adjoint vector of the function of interest. The contribution of a Spalart–Allmaras turbulence model is taken into account through its linearization. Meshes are adapted accordingly to the proposed indicator. Applications to 2D RANS flow about a RAE2822 airfoil in transonic, and detached subsonic conditions are presented for the drag coefficient estimation. The asset of the proposed method is patent. The obtained 2D anisotropic mono‐block mesh well captures flow features as well as global aerodynamic functionals. Interestingly, the constraints imposed by structured grids may be relaxed by the use of non‐matching multi‐block approach that limits the outward propagation of local mesh refinement through all of the computational domain. The proposed method also leads to accurate results for these multi‐block meshes but at a fraction of the cost. Finally, the method is also successfully applied to a more complex geometry, namely, a mono‐block mesh in a 3D RANS transonic flow about an M6 wing. Copyright © 2016 John Wiley & Sons, Ltd.     

Adjoint‐based error estimation and mesh adaptation for hybridized discontinuous Galerkin methods

We present a robust and efficient target‐based mesh adaptation methodology, building on hybridized discontinuous Galerkin schemes for (nonlinear) convection–diffusion problems, including the compressible Euler and Navier–Stokes equations. The hybridization of finite element discretizations has the main advantage that the resulting set of algebraic equations has globally coupled degrees of freedom (DOFs) only on the skeleton of the computational mesh. Consequently, solving for these DOFs involves the solution of a potentially much smaller system. This not only reduces storage requirements but also allows for a faster solution with iterative solvers. The mesh adaptation is driven by an error estimate obtained via a discrete adjoint approach. Furthermore, the computed target functional can be corrected with this error estimate to obtain an even more accurate value. The aim of this paper is twofold: Firstly, to show the superiority of adjoint‐based mesh adaptation over uniform and residual‐based mesh refinement and secondly, to investigate the efficiency of the global error estimate. Copyright © 2014 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.     

基于Voronoi cells的二维不规则自适应网格的生成及其应用

基于Voronoi cells的数据结构和算法，给出了一种二维不规则自适应网格的生成方法，用VisualC＋＋语言在微机上开发了Windows环境下网格自动生成的可视化软件。既可以得到Voronoi cells网格，也可得到相应的Delaunay triangles网格，网格生成的实例表明，本文方法所得到的网格非常适合于多尺度系统的流动问题的计算，具有较好的应用前景。     

Mesh adaptation using C1 interpolation of the solution in an unstructured finite volume solver

The goal of this paper is to show the effectiveness of a newly developed estimate of the truncation error calculated based on C¹ interpolation of the solution weighted by the adjoint solution as the adaptation indicator for an unstructured finite volume solver. We will show that adjoint‐based mesh adaptation based on the corrected functional using the new developed truncation error estimate is capable of adapting the mesh to improve the accuracy of the functional and the convergence rate. Both discrete and continuous adjoint solutions are used for adaptation. Results are significantly better with new truncation error estimate than with previously used estimates.     

A pressure‐based unstructured grid method for all‐speed flows

An all‐speed algorithm based on the SIMPLE pressure‐correction scheme and the ‘retarded‐density’ approach has been formulated and implemented within an unstructured grid, finite volume (FV) scheme for both incompressible and compressible flows, the latter involving interaction of shock waves. The collocated storage arrangement for all variables is adopted, and the checkerboard oscillations are eliminated by using a pressure‐weighted interpolation method, similar to that of Rhie and Chow [Numerical study of the turbulent flow past an airfoil with trailing edge separation. AIAA Journal 1983; 21 : 1525]. The solution accuracy is greatly enhanced when a higher‐order convection scheme combined with adaptive mesh refinement (AMR) are used. Copyright © 2000 John Wiley & Sons, Ltd.     

Anisotropic mesh adaptation: towards user‐independent,mesh‐independent and solver‐independent CFD. Part I: general principles

The present paper is the lead article in a three‐part series on anisotropic mesh adaptation and its applications to structured and unstructured meshes. A flexible approach is proposed and tested on two‐dimensional, inviscid and viscous, finite volume and finite element flow solvers, over a wide range of speeds. The directional properties of an interpolation‐based error estimate, extracted from the Hessian of the solution, are used to control the size and orientation of mesh edges. The approach is encapsulated into an edge‐based anisotropic mesh optimization methodology (MOM), which uses a judicious sequence of four local operations: refinement, coarsening, edge swapping and point movement, to equi‐distribute the error estimate along all edges, without any recourse to remeshing. The mesh adaptation convergence of the MOM loop is carefully studied for a wide variety of test cases. The mesh optimization generic coupling of MOM with finite volume and finite element flow solvers is shown to yield the same final mesh no matter what the starting point is. It is also shown that on such optimized meshes, the need for computational fluid dynamics (CFD) stabilization artifices, such as upwinding or artificial viscosity, are drastically reduced, if not altogether eliminated, in most well‐posed formulations. These two conclusions can be considered significant steps towards mesh‐independent and solver‐independent CFD. The structure of the three‐part series is thus, 1, general principles; 2, methodology and applications to structured and unstructured grids; 3, applications to three‐dimensional flows. Copyright © 2000 John Wiley & Sons, Ltd.     

A vortex axis and vortex core border grid adaptation algorithm

In the design process of hydrodynamical and aerodynamical technical applications, the numerical simulation of massively separated vortical flow is crucial for predicting, for example, lift or drag. To obtain reliable numerical results, it is mandatory to accurately predict the physical behavior of vortices. Thus, the dominant vortical flow structures have to be resolved in detail, which requires a local grid refinement and certain adaptation techniques. In this paper, a vortex flow structure adaptation algorithm is presented, which is particularly designed for local grid refinement at vortex axes positions and associated vortex core border locations. To this end, a fast and efficient vortex axis detection scheme is introduced and the algorithm for the vortex core border determination is explained. As the interaction between vortices makes the assignment of grid points to a certain vortex axis difficult, a helicity‐based vortex distinction approach in combination with a geometrical rotational sensor is developed. After describing the combined different techniques in detail, the vortex feature adaptation algorithm is applied to analytical and more realistic examples, which show that the described grid adaptation algorithm is able to enhance the grid cell resolution locally such that all significant vortical flow phenomena are resolved. Copyright © 2008 John Wiley & Sons, Ltd.     

An unstructured grid,three‐dimensional model based on the shallow water equations

A semi‐implicit finite difference model based on the three‐dimensional shallow water equations is modified to use unstructured grids. There are obvious advantages in using unstructured grids in problems with a complicated geometry. In this development, the concept of unstructured orthogonal grids is introduced and applied to this model. The governing differential equations are discretized by means of a semi‐implicit algorithm that is robust, stable and very efficient. The resulting model is relatively simple, conserves mass, can fit complicated boundaries and yet is sufficiently flexible to permit local mesh refinements in areas of interest. Moreover, the simulation of the flooding and drying is included in a natural and straightforward manner. These features are illustrated by a test case for studies of convergence rates and by examples of flooding on a river plain and flow in a shallow estuary. Copyright © 2000 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.     

An adaptive Cartesian grid generation method for ‘Dirty’ geometry

Traditional structured and unstructured grid generation methods need a ‘water‐tight’ boundary surface grid to start. Therefore, these methods are named boundary to interior (B2I) approaches. Although these methods have achieved great success in fluid flow simulations, the grid generation process can still be very time consuming if ‘non‐water‐tight’ geometries are given. Significant user time can be taken to repair or clean a ‘dirty’ geometry with cracks, overlaps or invalid manifolds before grid generation can take place. In this paper, we advocate a different approach in grid generation, namely the interior to boundary (I2B) approach. With an I2B approach, the computational grid is first generated inside the computational domain. Then this grid is intelligently ‘connected’ to the boundary, and the boundary grid is a result of this ‘connection’. A significant advantage of the I2B approach is that ‘dirty’ geometries can be handled without cleaning or repairing, dramatically reducing grid generation time. An I2B adaptive Cartesian grid generation method is developed in this paper to handle ‘dirty’ geometries without geometry repair. Comparing with a B2I approach, the grid generation time with the I2B approach for a complex automotive engine can be reduced by three orders of magnitude. Copyright © 2002 John Wiley & Sons, Ltd.     

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.     

On the characterization of grid density in grid refinement studies for discretization error estimation

This paper discusses the estimation of discretization errors on the basis of power series expansions for grid sets that are not geometrically similar, that is, grids not exhibiting a constant grid refinement ratio for the entire computational domain. Simple test cases with structured and unstructured grids are used to demonstrate that reliable error estimates on the basis of power series expansions can be made if the grids are refined systematically. However, if the grid refinement ratio is not constant in the complete domain, the definition of the typical cell size is not obvious, and the observed order of accuracy may not be equal to the expected theoretical order of the discretization. Some alternatives for the definition of the typical cell size are tested. In these tests, the error estimation does not show a significant effect of the definition of the typical cell size even for some cases with data sets clearly outside the ‘asymptotic range’. For non‐geometrically similar grids, the best estimates of the observed order of accuracy are obtained with the typical cell size on the basis of the mode of the cell size (the cell size that occurs more often in a given grid). Copyright © 2012 John Wiley & Sons, Ltd.     

Numerical diffusion for flow‐aligned unstructured grids with application to estuarine modeling

The benefits of unstructured grids in hydrodynamic models are well understood but in many cases lead to greater numerical diffusion compared with methods available on structured grids. The flexible nature of unstructured grids, however, allows for the orientation of the grid to align locally with the dominant flow direction and thus decrease numerical diffusion. We investigate the relationship between grid alignment and diffusive errors in the context of scalar transport in a triangular, unstructured, 3‐D hydrodynamic code. Analytical results are presented for the 2‐D anisotropic numerical diffusion tensor and verified against idealized simulations. Results from two physically realistic estuarine simulations, differing only in grid alignment, show significant changes in gradients of salinity. Changes in scalar gradients are reflective of reduced numerical diffusion interacting with the complex 3‐D structure of the transporting flow. We also describe a method for utilizing flow fields from an unaligned grid to generate a flow‐aligned grid with minimal supervision. Copyright © 2013 John Wiley & Sons, Ltd.     

Edge‐based reconstruction schemes for unstructured tetrahedral meshes

In this paper, we consider edge‐based reconstruction (EBR) schemes for solving the Euler equations on unstructured tetrahedral meshes. These schemes are based on a high‐accuracy quasi‐1D reconstruction of variables on an extended stencil along the edge‐based direction. For an arbitrary tetrahedral mesh, the EBR schemes provide higher accuracy in comparison with most second‐order schemes at rather low computational costs. The EBR schemes are built in the framework of vertex‐centered formulation for the point‐wise values of variables. Here, we prove the high accuracy of EBR schemes for uniform grid‐like meshes, introduce an economical implementation of quasi‐one‐dimensional reconstruction and the resulting new scheme of EBR family, estimate the computational costs, and give new verification results. Copyright © 2015 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 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.