Validation of adaptive unstructured hexahedral mesh computations of flow around a wind turbine airfoil

In this paper we investigate local adaptive refinement of unstructured hexahedral meshes for computations of the flow around the DU91 wind turbine airfoil. This is a 25% thick airfoil, found at the mid‐span section of a wind turbine blade. Wind turbine applications typically involve unsteady flows due to changes in the angle of attack and to unsteady flow separation at high angles of attack. In order to obtain reasonably accurate results for all these conditions one should use a mesh which is refined in many regions, which is not computationally efficient. Our solution is to apply an automated mesh adaptation technique. In this paper we test an adaptive refinement strategy developed for unstructured hexahedral meshes for steady flow conditions. The automated mesh adaptation is based on local flow sensors for pressure, velocity, density or a combination of these flow variables. This way the mesh is refined only in those regions necessary for high accuracy, retaining computational efficiency. A validation study is performed for two cases: attached flow at an angle of 6° and separated flow at 12°. The results obtained using our adaptive mesh strategy are compared with experimental data and with results obtained with an equally sized non‐adapted mesh. From these computations it can be concluded that for a given computing time, adapted meshes result in solutions closer to the experimental data compared to non‐adapted meshes for attached flow. Finally, we show results for unsteady computations. Copyright © 2005 John Wiley & Sons, Ltd.     

Patched grid and adaptive mesh refinement strategies for the calculation of the transport of vortices

This paper presents two techniques allowing local grid refinement to calculate the transport of vortices. one is the patched grid (PG) method which allows non‐coincident interfaces between blocks. Treatment of the non‐coincident interfaces is given in detail. The second one is the adaptive mesh refinement (AMR) method which has been developed in order to create embedded sub‐grids. The efficiency of these two methods is demonstrated by some validating tests. Then the PG and AMR strategies are applied in the computation of the transport of vortices. We start with a simple vortex flow in a cubic box. Then, the flowfield around a complex aircraft configuration is calculated using the two refinement techniques. Results are compared with a fine, referenced grid calculation. Copyright © 2002 John Wiley & Sons, Ltd.     

Collocated discrete least‐squares (CDLS) meshless method: Error estimate and adaptive refinement

Meshless methods are new approaches for solving partial differential equations. The main characteristic of all these methods is that they do not require the traditional mesh to construct a numerical formulation. They require node generation instead of mesh generation. In other words, there is no pre‐specified connectivity or relationships among the nodes. This characteristic make these methods powerful. For example, an adaptive process which requires high computational effort in mesh‐dependent methods can be very economically solved with meshless methods. In this paper, a posteriori error estimate and adaptive refinement strategy is developed in conjunction with the collocated discrete least‐squares (CDLS) meshless method. For this, an error estimate is first developed for a CDLS meshless method. The proposed error estimator is shown to be naturally related to the least‐squares functional, providing a suitable posterior measure of the error in the solution. A mesh moving strategy is then used to displace the nodal points such that the errors are evenly distributed in the solution domain. Efficiency and effectiveness of the proposed error estimator and adaptive refinement process are tested against two hyperbolic benchmark problems, one with shocked and the other with low gradient smooth solutions. These experiments show that the proposed adaptive process is capable of producing stable and accurate results for the difficult problems considered. Copyright © 2007 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.     

Accurate and robust adaptive mesh refinement for aerodynamic simulation with multi‐block structured curvilinear mesh

A multi‐block curvilinear mesh‐based adaptive mesh refinement (AMR) method is developed to satisfy the competing objectives of improving accuracy and reducing cost. Body‐fitted curvilinear mesh‐based AMR is used to capture flow details of various length scales. A series of efforts are made to guarantee the accuracy and robustness of the AMR system. A physics‐based refinement function is proposed, which is proved to be able to detect both shock wave and vortical flow. The curvilinear mesh is refined with cubic interpolation, which guarantees the aspect ratio and smoothness. Furthermore, to enable its application in complex configurations, a sub‐block‐based refinement strategy is developed to avoid generating invalid mesh, which is the consequence of non‐smooth mesh lines or singular geometry features. A newfound problem of smaller wall distance, which negatively affects the stability and is never reported in the literature, is also discussed in detail, and an improved strategy is proposed. Together with the high‐accuracy numerical scheme, a multi‐block curvilinear mesh‐based AMR system is developed. With a series of test cases, the current method is verified to be accurate and robust and be able to automatically capture the flow details at great cost saving compared with the global refinement. Copyright © 2015 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.     

Extrudate swell through an orifice die

The extrudate swell of a viscoelastic fluid through an orifice die is investigated by using a mixed finite element and a streamline integration method (FESIM), using a version of the K-BKZ model. The free surface calculation is based on a local mass conservation scheme and an approximate numerical treatment for the contact point movement of the free surface. The numerical results show a vortex growth and an increasing swelling ratio with the Weissenberg number. Convergence with mesh refinement is demonstrated, even at a high Weissenberg number of O(587), where the swelling ratio reaches a value of about 360%. In addition, it is found that the effective flow channel at the entrance region next to the orifice die is reduced due to the enhanced vortex growth, which may be a source of flow instability.     

Adaptive mesh refinement method-based large eddy simulation for the flow over circular cylinder at ReD = 3900

With the development of computational power, large eddy simulation (LES) method is increasingly used in simulating complex flow. However, there still exist many factors affecting the LES quality and appropriate mesh resolution is among one of them. This work aims to develop an automatic procedure to refine the LES mesh by combining adaptive mesh refinement (AMR) and LES quality criteria. An LES refinement criterion is developed by estimating the proper grid length scale which meets the accuracy requirement of LES method. With this criterion, the baseline mesh is automatically refined with the AMR method. In this work, an efficient one-shot refinement strategy is also proposed to reduce the overall simulation time. Current AMR-based LES method is verified with the typical LES test case about the flow past circular cylinder at Re _D = 3900. Results show that the automatically refined mesh provides systematically better agreement with experimental results and with current method the balance between accuracy and computational expense for LES can be obtained.     

Adaptive mesh refinement and load balancing based on multi-level block-structured Cartesian mesh

We developed a framework for a distributed-memory parallel computer that enables dynamic data management for adaptive mesh refinement and load balancing. We employed simple data structure of the building cube method (BCM) where a computational domain is divided into multi-level cubic domains and each cube has the same number of grid points inside, realising a multi-level block-structured Cartesian mesh. Solution adaptive mesh refinement, which works efficiently with the help of the dynamic load balancing, was implemented by dividing cubes based on mesh refinement criteria. The framework was investigated with the Laplace equation in terms of adaptive mesh refinement, load balancing and the parallel efficiency. It was then applied to the incompressible Navier–Stokes equations to simulate a turbulent flow around a sphere. We considered wall-adaptive cube refinement where a non-dimensional wall distance y⁺ near the sphere is used for a criterion of mesh refinement. The result showed the load imbalance due to y⁺ adaptive mesh refinement was corrected by the present approach. To utilise the BCM framework more effectively, we also tested a cube-wise algorithm switching where an explicit and implicit time integration schemes are switched depending on the local Courant-Friedrichs-Lewy (CFL) condition in each cube.     

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.     

Application of the VORTFIND algorithm for the identification of vortical flow features around complex three‐dimensional geometries

Accurate prediction of the hydrodynamic forces and moments acting on a manoeuvring marine vehicle using Reynolds averaged Navier–Stokes simulations requires sufficient mesh resolution to capture off‐body vortical structures. Because the path of these structures is not known a priori, a vortex identification and capture strategy is required alongside an iterative mesh adaption process. An improved version of the VORTFIND algorithm, which can identify multiple vortices of variable strength and rotational direction using a K‐means algorithm is described. The algorithm is applied to velocity fields generated from Reynolds averaged Navier–Stokes simulations to increase the mesh resolution in the vortex core region, ensuring sufficient mesh density to capture the downstream propagation of the vortex for a submarine hull at drift and ship propeller–rudder interaction.Copyright © 2012 John Wiley & Sons, Ltd.     

The combined effects of non‐planarity and asymmetry on primary and secondary flows in the small bronchial tubes

The laminar flow in the small bronchial tubes is quite complex due to the presence of vortex‐dominated, secondary flows. In this paper, we report the results of a numerical investigation of the simultaneous effects of asymmetric and non‐planar branching on the primary and secondary flows in the small bronchial tubes, i.e. generations 6–12. We simulate steady‐state inspiratory flow at a Reynolds number of 1000 in three‐generation, asymmetric planar and non‐planar bronchial tube models. The non‐planar model was defined by applying a 90° out‐of‐plane rotation to the third‐generation branches. A detailed mesh refinement study was performed in order to demonstrate mesh independence. Significant differences were observed between flows in the planar and non‐planar models. An uneven mass flow distribution was observed in the non‐planar model in contrast to the evenly distributed mass flow in the planar model. The secondary flows created symmetric vortex patterns in the planar model, whereas vortex symmetry was lost in the non‐planar model. These results illustrate the importance of incorporating asymmetry in addition to non‐planarity in the geometric models. Copyright © 2008 John Wiley & Sons, Ltd.     

Numerical simulations of the steady Navier–Stokes equations using adaptive meshing schemes

In this paper, we consider an adaptive meshing scheme for solution of the steady incompressible Navier–Stokes equations by finite element discretization. The mesh refinement and optimization are performed based on an algorithm that combines the so‐called conforming centroidal Voronoi Delaunay triangulations (CfCVDTs) and residual‐type local a posteriori error estimators. Numerical experiments in the two‐dimensional space for various examples are presented with quadratic finite elements used for the velocity field and linear finite elements for the pressure. The results show that our meshing scheme can equally distribute the errors over all elements in some optimal way and keep the triangles very well shaped as well at all levels of refinement. In addition, the convergence rates achieved are close to the best obtainable. Extension of this approach to three‐dimensional cases is also discussed and the main challenge is the efficient implementation of three‐dimensional CfCVDT generation that is still under development. Copyright © 2007 John Wiley & Sons, Ltd.     

Efficient computation of mean drag for the subcritical flow past a circular cylinder using general Galerkin G2

General Galerkin (G2) is a new computational method for turbulent flow, where a stabilized Galerkin finite element method is used to compute approximate weak solutions to the Navier–Stokes equations directly, without any filtering of the equations as in a standard approach to turbulence simulation, such as large eddy simulation, and thus no Reynolds stresses are introduced, which need modelling. In this paper, G2 is used to compute the drag coefficient c_D for the flow past a circular cylinder at Reynolds number Re=3900, for which the flow is turbulent. It is found that it is possible to approximate c_D to an accuracy of a few percent, corresponding to the accuracy in experimental results for this problem, using less than 10⁵ mesh points, which makes the simulations possible using a standard PC. The mesh is adaptively refined until a stopping criterion is reached with respect to the error in a chosen output of interest, which in this paper is c_D. Both the stopping criterion and the mesh‐refinement strategy are based on a posteriori error estimates, in the form of a space–time integral of residuals times derivatives of the solution of a dual problem, linearized at the approximate solution, and with data coupling to the output of interest. Copyright © 2008 John Wiley & Sons, Ltd.     

Spatial accuracy and performance of a mixed‐order,explicit multi‐stage method for unsteady flows

We assess the spatial accuracy and performance of a mixed‐order, explicit multi‐stage method in which an inexpensive low‐order scheme is used for the initial stages, and a more expensive high‐order scheme is used for the final stage only. Compared with the use of a high‐order scheme for all stages, we observe that the mixed‐order scheme achieves comparable accuracy and convergence while providing a speed‐up of a factor of two on mesh sizes of O(10⁶ ? 10⁷) tetrahedron. For calculations with significant adaptive mesh refinement, a more modest speed‐up of 30% is obtained. Published 2012. This article is a US Government work and is in the public domain in the USA.     

Adaptive VOF with curvature‐based refinement

Adaptive refinement is implemented in the context of the volume‐of‐fluid (VOF) methodology in order to study the efficacy of resolving interfaces adaptively based on the local value of curvature. The usual uniform mesh VOF implementation is modified slightly to ensure accurate advection of fluxes between cells at different resolutions. Normals and curvatures are calculated accurately via height functions. Results of a series of tests indicate that in most instances the use of adaptive refinement (when compared to uniform refinement with a similar number of cells) leads to more accurate VOF advection. The results also clearly show that curvature‐based adaptive refinement leads to a distribution of errors along an interface that is nearly independent of curvature. Copyright © 2007 John Wiley & Sons, Ltd.     

The use of dynamic grid adaptation algorithms for the modelling of flow around a circular cylinder in sub‐critical flow regime

In the present study a dynamic grid adaptation (DGA) algorithm is utilized for predicting flow around a circular cylinder in sub‐critical flow regime at a Reynolds number of 1.4×10⁵. The reason for adopting a DGA algorithm is the unsteadiness of the flow field which makes a conventional mesh inefficient. The concept being adopted is to concentrate mesh refinement in regions with high gradients and high turbulent viscosity, while in the region further downstream where the flow is fully developed a coarser mesh will develop and turbulence is modelled with the large eddy simulation (LES) turbulence model. The aim of the study is to present an appropriate variable for mesh refinement, which accomplishes a high rate of mesh refinement in the region with high gradients. The new variable is a product of the local mesh cell size and the rate of strain and includes two additional variables to allow control over the refinement behaviour. The results are compared with experimental data at the corresponding Reynolds number and also with numerical results obtained with conventional mesh. It is demonstrated that DGA algorithms can give results of a very high quality for a mesh that is significantly smaller than for a conventional mesh. Copyright © 2003 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.     

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.