Feature‐based adaptive mesh refinement for wingtip vortices

Feature‐based solution‐adaptive mesh refinement is an attractive strategy when it is known a priori that the resolution of certain key features is critical to achieving the objectives of a simulation. In this paper, we apply vortex characterization techniques, which are typically employed to visualize vortices, to identify regions of the computational domain for mesh refinement. We investigate different refinement strategies that are facilitated by these vortex characterization techniques to simulate the flow past a wing in a wind tunnel. Our results, which we compare with experimental data, indicate that it is necessary to refine the region within and near the vortex extent surface to obtain an accurate prediction. Application of the identified mesh refinement strategy also produced observed improvement in the results predicted for a spinning missile with deflected canards. Copyright © 2010 John Wiley & Sons, Ltd.     

Anisotropic mesh refinement for discontinuous Galerkin methods in two‐dimensional aerodynamic flow simulations

We derive and implement two types of anisotropic indicators which can be used within an anisotropic refinement algorithm for second but also for higher‐order discontinuous Galerkin discretizations. Although the first type of indicator employs the possible inter‐element discontinuities of the discrete functions, the second type of indicator estimates the approximation error in terms of second but possibly also higher‐order derivatives. We implement a simple extension of these indicators to systems of equations which performs similar to the so‐called metric intersection used to combine the metric information of several solution components and is applicable to higher‐order discretizations as well. The anisotropic indicators are incorporated into an adaptive refinement algorithm which uses state‐of‐the‐art residual‐based or adjoint‐based indicators for goal‐oriented refinement to select the elements to be refined, whereas the anisotropic indicators determine which anisotropic case the selected elements shall be refined with. We demonstrate the performance of the anisotropic refinement algorithm for sub‐, trans‐ and supersonic, inviscid and viscous compressible flows around a NACA0012 airfoil. Copyright © 2007 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.     

自适应多重网格有限元网格生成器研制

基于协调三角形剖分算法、分子表数据结构和Ｚｉｅｎｋｉｅｗｉｃｚ－Ｚｈｕ误差估计方法，本文研制出适用于自适应多重网格有限元的网格生成器。该网格生成器可对复杂的区域进行自适应加密。当荷载作用边界随时间变化及在动力荷载作用下，网格生成器可退化与再加密网格。     

一种新的求解对流占优问题的自适应网格细化方法

在均匀网格上求解对流占优问题时,往往会产生数值震荡现象,因此需要局部加密网格来提高解的精度。针对对流占优问题,设计了一种新的自适应网格细化算法。该方法采用流线迎风SUPG(Petrov-Galerkin)格式求解对流占优问题,定义了网格尺寸并通过后验误差估计子修正来指导自适应网格细化,以泡泡型局部网格生成算法BLMG为网格生成器,通过模拟泡泡在区域中的运动得到了高质量的点集。与其他自适应网格细化方法相比,该方法可在同一框架内实现网格的细化和粗化,同时在所有细化层得到了高质量的网格。数值算例结果表明,该方法在求解对流占优问题时具有更高的数值精度和更好的收敛性。     

Adaptive mesh refinement for simulating fluid-structure interaction using a sharp interface immersed boundary method

In this article, adaptive mesh refinement (AMR) is performed to simulate flow around both stationary and moving boundaries. The finite-difference approach is applied along with a sharp interface immersed boundary (IB) method. The Lagrangian polynomial is employed to facilitate the interpolation from a coarse to a fine grid level, while a weighted-average formula is used to transfer variables inversely. To save memory, the finest grid is only generated in the local areas close to the wall boundary, and the mesh is dynamically reconstructed based on the location of the wall boundary. The Navier-Stokes equations are numerically solved through the second-order central difference scheme in space and the third-order Runge-Kutta time integration. Flow around a circular cylinder rotating in a square domain is firstly simulated to examine the accuracy and convergence rate. Then three cases are investigated to test the validity of the present method: flow past a stationary circular cylinder at low Reynolds numbers, flow past a forced oscillating circular cylinder in the transverse direction at various frequencies, and a free circular cylinder subjected to vortex-induced vibration in two degrees of freedom. Computational results agree well with these in the literature and the flow fields are smooth around the interface of different refinement levels. The effect of refinement level has also been evaluated. In addition, a study for the computational efficiency shows that the AMR approach is helpful to reduce the total node number and speed up the time integration, which could prompt the application of the IB method when a great near-wall spatial resolution is required.     

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.     

Adaptive mesh refinement and coarsening for aerodynamic flow simulations

A new mesh refinement technique for unstructured grids is discussed. The new technique presents the important advantage of maintaining the original grid skewness, thanks to the capability of handling hanging nodes. The paper also presents an interpretation of MacCormack's method in an unstructured grid context. Results for a transonic convergent–divergent nozzle, for a convergent nozzle with a supersonic entrance and for transonic flow over a NACA 0012 airfoil are presented and discussed. Copyright © 2004 John Wiley & Sons, Ltd.     

A multiblock/multilevel mesh refinement procedure for CFD computations

A multiblock/multilevel algorithm with local refinement for general two‐ and three‐dimensional fluid flow is presented. The patched‐based local refinement procedure is presented in detail and algorithmic implementations are also presented. The multiblock implementation is essentially block‐unstructured, i.e. each block having its own local curvilinear co‐ordinate system. Refined grid patches can be put anywhere in the computational domain and can extend across block boundaries. To simplify the implementation, while still maintaining sufficient generality, the refinement is restricted to a refinement of the grid successively halving the grid size within a selected patch. The multiblock approach is implemented within the framework of the well‐known SIMPLE solution strategy. Computational experiments showing the effect of using the multilevel solution procedure are presented for a sample elliptic problem and a few benchmark problems of computational fluid dynamics (CFD). Copyright © 2001 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.     

等压假设下考虑化学反应动力学影响的约束爆炸准静态压力的计算

为研究约束爆炸后爆炸产物与约束空间内的氧气发生化学反应对约束爆炸准静态压力的影响,从能量守恒和理想气体状态方程出发,基于爆炸后产物膨胀过程的等压假设模型,建立了约束爆炸准静态压力计算公式,并对TNT炸药爆炸后发生的化学反应与约束空间内准静态压力大小的关系进行分析。计算得到不同药量体积比下,TNT炸药约束爆炸后的准静态压力,计算结果与实验结果符合较好,可应用于其他类型炸药,并为预测约束爆炸后的准静态压力提供理论依据和估算方法。     

Adaptive mesh refinement for high‐resolution finite element schemes

New a posteriori error indicators based on edgewise slope‐limiting are presented. The L₂‐norm is employed to measure the error of the solution gradient in both global and element sense. A second‐order Newton–Cotes formula is utilized in order to decompose the local gradient error from a ??₁ finite element solution into a sum of edge contributions. The slope values at edge midpoints are interpolated from the two adjacent vertices. Traditional techniques to recover (superconvergent) nodal gradient values from consistent finite element slopes are reviewed. The deficiencies of standard smoothing procedures—L₂‐projection and the Zienkiewicz–Zhu patch recovery—as applied to nonsmooth solutions are illustrated for simple academic configurations. The recovered gradient values are corrected by applying a slope limiter edge‐by‐edge so as to satisfy geometric constraints. The direct computation of slopes at edge midpoints by means of limited averaging of adjacent gradient values is proposed as an inexpensive alternative. Numerical tests for various solution profiles in one and two space dimensions are presented to demonstrate the potential of this postprocessing procedure as an error indicator. Finally, it is used to perform adaptive mesh refinement for compressible inviscid flow simulations. Copyright © 2006 John Wiley & Sons, Ltd.     

Anisotropic unstructured mesh adaption for flow simulations

Three new ideas for anisotropic adaption of unstructured triangular grids are presented, with particular emphasis on fluid flow computations. © 1997 John Wiley & Sons, Ltd.     

Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions

The effects of reordering the unknowns on the convergence of incomplete factorization preconditioned Krylov subspace methods are investigated. Of particular interest is the resulting preconditioned iterative solver behavior when adaptive mesh refinement and coarsening (AMR/C) are utilized for serial or distributed parallel simulations. As representative schemes, we consider the familiar reverse Cuthill–McKee and quotient minimum degree algorithms applied with incomplete factorization preconditioners to CG and GMRES solvers. In the parallel distributed case, reordering is applied to local subdomains for block ILU preconditioning, and subdomains are repartitioned dynamically as mesh adaptation proceeds. Numerical studies for representative applications are conducted using the object‐oriented AMR/C software system libMesh linked to the PETSc solver library. Serial tests demonstrate that global unknown reordering and incomplete factorization preconditioning can reduce the number of iterations and improve serial CPU time in AMR/C computations. Parallel experiments indicate that local reordering for subdomain block preconditioning associated with dynamic repartitioning because of AMR/C leads to an overall reduction in processing time. Copyright © 2011 John Wiley & Sons, Ltd.     

Adaptive mesh refinement techniques for high‐order shock capturing schemes for multi‐dimensional hydrodynamic simulations

The numerical simulation of physical phenomena represented by non‐linear hyperbolic systems of conservation laws presents specific difficulties mainly due to the presence of discontinuities in the solution. State of the art methods for the solution of such equations involve high resolution shock capturing schemes, which are able to produce sharp profiles at the discontinuities and high accuracy in smooth regions, together with some kind of grid adaption, which reduces the computational cost by using finer grids near the discontinuities and coarser grids in smooth regions. The combination of both techniques presents intrinsic numerical and programming difficulties. In this work we present a method obtained by the combination of a high‐order shock capturing scheme, built from Shu–Osher's conservative formulation (J. Comput. Phys. 1988; 77 :439–471; 1989; 83 :32–78), a fifth‐order weighted essentially non‐oscillatory (WENO) interpolatory technique (J. Comput. Phys. 1996; 126 :202–228) and Donat–Marquina's flux‐splitting method (J. Comput. Phys. 1996; 125 :42–58), with the adaptive mesh refinement (AMR) technique of Berger and collaborators (Adaptive mesh refinement for hyperbolic partial differential equations. Ph.D. Thesis, Computer Science Department, Stanford University, 1982; J. Comput. Phys. 1989; 82 :64–84; 1984; 53 :484–512). Copyright © 2006 John Wiley & Sons, Ltd.     

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.     

二维自适应网格生成的改进AFT与背景网格法

在基于重生成的自适应有限元网格生成算法研究中,将推进波前法（AFT）与背景网格法结合并提出改进方法,有效地解决了网格生成和单元尺寸计算这两个关键问题。改进的AFT方法,将前沿区分为活跃前沿和非活跃前沿两类,在选取目标前沿时既考虑前沿尺寸又考虑前沿分类。改进的背景网格法,利用结构化栅格对背景网格进行管理,在栅格中直接存放背景网格中的单元,既提高了新单元尺寸的计算速度,又从数值上保证了新生成网格中单元之间尺寸合理过渡。     

Numerical analysis of moving interfaces using a level set method coupled with adaptive mesh refinement

A novel numerical scheme is developed by coupling the level set method with the adaptive mesh refinement in order to analyse moving interfaces economically and accurately. The finite element method (FEM) is used to discretize the governing equations with the generalized simplified marker and cell (GSMAC) scheme, and the cubic interpolated pseudo‐particle (CIP) method is applied to the reinitialization of the level set function. The present adaptive mesh refinement is implemented in the quadrangular grid systems and easily embedded in the FEM‐based algorithm. For the judgement on renewal of mesh, the level set function is adopted as an indicator, and the threshold is set at the boundary of the smoothing band. With this criterion, the variation of physical properties and the jump quantity on the free surface can be calculated accurately enough, while the computation cost is largely reduced as a whole. In order to prove the validity of the present scheme, two‐dimensional numerical simulation is carried out in collapse of a water column, oscillation and movement of a drop under zero gravity. As a result, its effectiveness and usefulness are clearly shown qualitatively and quantitatively. Among them, the movement of a drop due to the Marangoni effect is first simulated efficiently with the present scheme. Copyright © 2004 John Wiley & Sons, Ltd.     

Application of adaptive mesh refinement method to complex flows in clean rooms

The adaptive mesh refinement (AMR) method is developed for three-dimensional turbulent complex flows in clean rooms using the finite volume method with a collocated grid arrangement. Clean rooms have many interesting and complex flow characteristics especially the secondary flows and the recirculation regions. The accurate numerical solution of the flows is important for the efficient design of clean rooms. The use of the conventional uniform grid requires such a high computational time and data storage capacity that they make computational fluid dynamics (CFD) less attractive for the design optimization. The AMR method is, therefore, applied by using the fine grid only in the required regions and using the coarse grid in the other regions. The velocity is chosen as the main parameter for the grid refinement because it is the most influential parameter in clean rooms. The results show that the present AMR method can reduce the computational time by eight times and the data storage requirement is only 37% of that using the conventional method, while the same order of accuracy can be maintained. The present AMR method is, therefore, proved to be a promising technique for solving three-dimensional turbulent complex flows in clean rooms.     

A local mesh refinement approach for large‐eddy simulations of turbulent flows

In this paper, a local mesh refinement (LMR) scheme on Cartesian grids for large‐eddy simulations is presented. The approach improves the calculation of ghost cell pressures and velocities and combines LMR with high‐order interpolation schemes at the LMR interface and throughout the rest of the computational domain to ensure smooth and accurate transition of variables between grids of different resolution. The approach is validated for turbulent channel flow and flow over a matrix of wall‐mounted cubes for which reliable numerical and experimental data are available. Comparisons of predicted first‐order and second‐order turbulence statistics with the validation data demonstrated a convincing agreement. Importantly, it is shown that mean streamwise velocities and fluctuating turbulence quantities transition smoothly across coarse‐to‐fine and fine‐to‐coarse interfaces. © 2016 The Authors International Journal for Numerical Methods in Fluids Published by John Wiley & Sons Ltd