Third‐order Cartesian overset mesh adaptation method for solving steady compressible flows

A third‐order mesh generation and adaptation method is presented for solving the steady compressible Euler equations. For interior points, a third‐order scheme is used on Cartesian and curvilinear meshes. Concerning the mesh adaptation, the method of Meakin is also extended to third order. The accuracy of the new overset mesh adaptation method is demonstrated by a grid convergence study for 2‐D inviscid model problems and results are compared with a second‐order method. Finally, the method is applied to the computation of an inviscid 3‐D flow around a hovering blade of the ONERA 7A helicopter rotor exhibiting an improvement in the wake capture. With a 7 million point mesh, the tip vortex can be followed for more than three rotor revolutions with the third‐order method. The CPU time needed for this calculation is only 3% higher than with a conventional second‐order method. Copyright © 2007 John Wiley & Sons, Ltd.     

An efficient implicit mesh‐less method for compressible flow calculations

A dual‐time implicit mesh‐less scheme is presented for calculation of compressible inviscid flow equations. The Taylor series least‐square method is used for approximation of spatial derivatives at each node which leads to a central difference discretization. Several convergence acceleration techniques such as local time stepping, enthalpy damping and residual smoothing are adopted in this approach. The capabilities of the method are demonstrated by flow computations around single and multi‐element airfoils at subsonic, transonic and supersonic flow conditions. Results are presented which indicate good agreements with other reliable finite‐volume results. The computational time is considerably reduced when using the proposed mesh‐less method compared with the explicit mesh‐less and finite‐volume schemes using the same point distributions. Copyright © 2010 John Wiley & Sons, Ltd.     

A multigrid adaptive mesh refinement strategy for 3D aerodynamic design

Presently, improving the accuracy and reducing computational costs are still two major CFD objectives often considered incompatible. This paper proposes to solve this dilemma by developing an adaptive mesh refinement method in order to integrate the 3D Euler and Navier–Stokes equations on structured meshes, where a local multigrid method is used to accelerate convergence for steady compressible flows. The time integration method is a LU‐SGS method (AIAA J 1988; 26: 1025–1026) associated with a spatial Jameson‐type scheme (Numerical solutions of the Euler equations by finite volume methods using Runge–Kutta time‐stepping schemes. AIAA Paper, 81‐1259, 1981). Computations of turbulent flows are handled by the standard k–ω model of Wilcox (AIAA J 1994; 32: 247–255). A coarse grid correction, based on composite residuals, has been devised in order to enforce the coupling between the different grid levels and to accelerate the convergence. The efficiency of the method is evaluated on standard 2D and 3D aerodynamic configurations. Copyright © 2004 John Wiley & Sons, Ltd.     

A particle swarm optimization approach for hexahedral mesh smoothing

There are some approaches for all‐hexahedral mesh quality improvement by means of node‐movement while preserving the connectivity. Among these methods, the most easily implemented and well known one is the Laplacian smoothing method; however, for this method mesh quality improvement is not guaranteed in all cases, and this approach might cause inverted elements especially in concave regions. In this work, a method for the improvement of hexahedral mesh shape‐quality without causing inverted elements is proposed; which is based on optimization of an objective function calculated by means of the individual qualities of hexahedral elements in the mesh. The shape‐quality for each hexahedral element is defined via the condition number of the relevant element. The numerical optimization scheme is the particle swarm optimization method, which originated from observations related to the social behaviors of bird, insect, or fish colonies. The purpose of this paper is to discuss the applicability of this approach to mesh smoothing. Some examples are given in order to demonstrate the applicability. Copyright © 2008 John Wiley & Sons, Ltd.     

A multiscale control volume finite element method for advection–diffusion equations

We present a new stabilized method for advection–diffusion equations, which combines a control volume FEM formulation of the governing equations with a novel multiscale approximation of the total flux. The latter incorporates information about the exact solution that cannot be represented on the mesh. To define this flux, we solve the governing equations along suitable mesh segments under the assumption that the flux varies linearly along these segments. This procedure yields second‐order accurate fluxes on the edges of the mesh. Then, we use curl‐conforming elements of the same order to lift these edge fluxes into the mesh elements. In so doing, we obtain a stabilized control volume FEM formulation that is second‐order accurate and does not require mesh‐dependent stabilization parameters. Numerical convergence studies on uniform and nonuniform grids along with several standard advection tests illustrate the computational properties of the new method. Published 2015. This article is a U.S. Government work and is in the public domain in the USA.     

A Voronoi‐based ALE solver for the calculation of incompressible flow on deforming unstructured meshes

An Arbitrary Lagrangian–Eulerian method for the calculation of incompressible Navier–Stokes equations in deforming geometries is described. The mesh node connectivity is defined by a Delaunay triangulation of the nodes, whereas the discretized equations are solved using finite volumes defined by the Voronoi dual of the triangulation. For prescribed boundary motion, an automatic node motion algorithm provides smooth motion of the interior nodes. Changes in the connectivity of the nodes are made through the use of local transformations to maintain the mesh as Delaunay. This allows the nodes and their associated Voronoi finite volumes to migrate through the domain in a free manner, without compromising the quality of the mesh. An MAC finite volume solver is applied on the Voronoi dual using a cell‐centred non‐staggered formulation, with cell‐face velocities being calculated by the Rhie–Chow momentum interpolation. Advective fluxes are approximated with the third‐order QUICK differencing scheme. The solver is demonstrated via its application to a driven cavity flow, and the flow about flapping aerofoil geometries. Copyright © 2010 John Wiley & Sons, Ltd.     

A swept‐intersection‐based remapping method in a ReALE framework

A complete reconnection‐based arbitrary Lagrangian–Eulerian (ReALE) strategy devoted to the computation of hydrodynamic applications for compressible fluid flows is presented here. In ReALE, we replace the rezoning phase of classical ALE method by a rezoning where we allow the connectivity between cells of the mesh to change. This leads to a polygonal mesh that recovers the Lagrangian features in order to follow more efficiently the flow. Those reconnections allow to deal with complex geometries and high vorticity problems contrary to ALE method. For optimizing the remapping phase, we have modified the idea of swept‐integration‐based. The new method is called swept‐intersection‐based remapping method. We demonstrate that our method can be applied to several numerical examples representative of hydrodynamic experiments.Copyright © 2012 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.     

A coupling difference scheme for the numerical solution of a singular perturbation problem

In this paper, we consider a singularly perturbed problem without turning points. On a special diseretization mesh, a coupling difference scheme, resulting from central difference scheme and Abrahamsson-Keller-Kreiss box scheme, is proposed and the second order convergence, uniform in the small parameter, is proved. Finally, numerical resulls are provided.     

Algebraic multigrid and incompressible fluid flow

This paper is concerned with the development of algebraic multigrid (AMG) solution methods for the coupled vector–scalar fields of incompressible fluid flow. It addresses in particular the problems of unstable smoothing and of maintaining good vector–scalar coupling in the AMG coarse‐grid approximations. Two different approaches have been adopted. The first is a direct approach based on a second‐order discrete‐difference formulation in primitive variables. Here smoothing is stabilized using a minimum residual control harness and velocity–pressure coupling is maintained by employing a special interpolation during the construction of the inter‐grid transfer operators. The second is an indirect approach that avoids the coupling problem altogether by using a fourth‐order discrete‐difference formulation in a single scalar‐field variable, primitive variables being recovered in post‐processing steps. In both approaches the discrete‐difference equations are for the steady‐state limit (infinite time step) with a fully implicit treatment of advection based on central differencing using uniform and non‐uniform unstructured meshes. They are solved by Picard iteration, the AMG solvers being used repeatedly for each linear approximation. Both classical AMG (C‐AMG) and smoothed‐aggregation AMG (SA‐AMG) are used. In the direct approach, the SA‐AMG solver (with inter‐grid transfer operators based on mixed‐order interpolation) provides an almost mesh‐independent convergence. In the indirect approach for uniform meshes, the C‐AMG solver (based on a Jacobi‐relaxed interpolation) provides solutions with an optimum scaling of the convergence rates. For non‐uniform meshes this convergence becomes mesh dependent but the overall solution cost increases relatively slowly with increasing mesh bandwidth. Copyright © 2006 John Wiley & Sons, Ltd.     

A finite element method for free surface flows of incompressible fluids in three dimensions. Part I. Boundary fitted mesh motion

Computational fluid mechanics techniques for examining free surface problems in two‐dimensional form are now well established. Extending these methods to three dimensions requires a reconsideration of some of the difficult issues from two‐dimensional problems as well as developing new formulations to handle added geometric complexity. This paper presents a new finite element formulation for handling three‐dimensional free surface problems with a boundary‐fitted mesh and full Newton iteration, which solves for velocity, pressure, and mesh variables simultaneously. A boundary‐fitted, pseudo‐solid approach is used for moving the mesh, which treats the interior of the mesh as a fictitious elastic solid that deforms in response to boundary motion. To minimize mesh distortion near free boundary under large deformations, the mesh motion equations are rotated into normal and tangential components prior to applying boundary conditions. The Navier–Stokes equations are discretized using a Galerkin–least square/pressure stabilization formulation, which provides good convergence properties with iterative solvers. The result is a method that can track large deformations and rotations of free surface boundaries in three dimensions. The method is applied to two sample problems: solid body rotation of a fluid and extrusion from a nozzle with a rectangular cross‐section. The extrusion example exhibits a variety of free surface shapes that arise from changing processing conditions. Copyright © 2000 John Wiley & Sons, Ltd.     

An adaptive cut‐cell method for environmental fluid mechanics

In this work we present a numerical method for solving the incompressible Navier–Stokes equations in an environmental fluid mechanics context. The method is designed for the study of environmental flows that are multiscale, incompressible, variable‐density, and within arbitrarily complex and possibly anisotropic domains. The method is new because in this context we couple the embedded‐boundary (or cut‐cell) method for complex geometry with block‐structured adaptive mesh refinement (AMR) while maintaining conservation and second‐order accuracy. The accurate simulation of variable‐density fluids necessitates special care in formulating projection methods. This variable‐density formulation is well known for incompressible flows in unit‐aspect ratio domains, without AMR, and without complex geometry, but here we carefully present a new method that addresses the intersection of these issues. The methodology is based on a second‐order‐accurate projection method with high‐order‐accurate Godunov finite‐differencing, including slope limiting and a stable differencing of the nonlinear convection terms. The finite‐volume AMR discretizations are based on two‐way flux matching at refinement boundaries to obtain a conservative method that is second‐order accurate in solution error. The control volumes are formed by the intersection of the irregular embedded boundary with Cartesian grid cells. Unlike typical discretization methods, these control volumes naturally fit within parallelizable, disjoint‐block data structures, and permit dynamic AMR coarsening and refinement as the simulation progresses. We present two‐ and three‐dimensional numerical examples to illustrate the accuracy of the method. Copyright © 2008 John Wiley & Sons, Ltd.     

Anisotropic goal‐oriented error analysis for a third‐order accurate CENO Euler discretization

In this paper, a central essentially non‐oscillatory approximation based on a quadratic polynomial reconstruction is considered for solving the unsteady 2D Euler equations. The scheme is third‐order accurate on irregular unstructured meshes. The paper concentrates on a method for a metric‐based goal‐oriented mesh adaptation. For this purpose, an a priori error analysis for this central essentially non‐oscillatory scheme is proposed. It allows us to get an estimate depending on the polynomial reconstruction error. As a third‐order error is not naturally expressed in terms of a metric, we propose a least‐square method to approach a third‐order error by a quadratic term. Then an optimization problem for the best mesh metric is obtained and analytically solved. The resulting mesh optimality system is discretized and solved using a global unsteady fixed‐point algorithm. The method is applied to an acoustic propagation benchmark.     

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.     

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.     

Adaptive mesh refinement‐enhanced local DFD method and its application to solve Navier–Stokes equations

Recently, the domain‐free discretization (DFD) method was presented to efficiently solve problems with complex geometries without introducing the coordinate transformation. In order to exploit the high performance of the DFD method, in this paper, the local DFD method with the use of Cartesian mesh is presented, where the physical domain is covered by a Cartesian mesh and the local DFD method is applied for numerical discretization. In order to further improve the efficiency of the solver, the newly developed solution‐based adaptive mesh refinement (AMR) technique is also introduced. The proposed methods are then applied to the simulation of natural convection in concentric annuli between a square outer cylinder and a circular inner cylinder. Numerical experiments show that the present numerical results agree very well with available data in the literature, and AMR‐enhanced local DFD method is an effective tool for the computation of flow problems. Copyright © 2005 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.     

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.     

Theoretical analysis for achieving high‐order spatial accuracy in Lagrangian/Eulerian source terms

In a fully coupled Lagrangian/Eulerian two‐phase calculation, the source terms from computational particles must be agglomerated to nearby gas‐phase nodes. Existing methods are capable of accomplishing this particle‐to‐gas coupling with second‐order accuracy. However, higher‐order methods would be useful for applications such as two‐phase direct numerical simulation and large eddy simulation. A theoretical basis is provided for producing high spatial accuracy in particle‐to‐gas source terms with low computational cost. The present work derives fourth‐ and sixth‐order accurate methods, and the procedure for even higher accuracy is discussed. The theory is also expanded to include two‐ and three‐dimensional calculations. One‐ and two‐dimensional tests are used to demonstrate the convergence of this method and to highlight problems with statistical noise. Finally, the potential for application in computational fluid dynamics codes is discussed. It is concluded that high‐order kernels have practical benefits only under limited ranges of statistical and spatial resolution. Additionally, convergence demonstrations with full CFD codes will be extremely difficult due to the worsening of statistical errors with increasing mesh resolution. Copyright © 2006 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.