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.     

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 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.     

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 simple quality triangulation algorithm for complex geometries

This paper presents a simple algorithm for quality triangulation in domains with complex geometries. Based on the fact that the equilateral triangles (regular meshes) are ideal for numerical computations in computational fluids dynamics (CFD) analysis, the proposed algorithm starts with an initial equilateral triangle mesh covering the whole domain. Nodes close to the boundary edges satisfy the so‐called non‐encroaching criterion, the distance from any inserted node to any boundary vertices and the midpoints of any boundary edge is greater than a given characteristic length. Both nearly uniform and non‐uniform triangle meshes can be generated using a mesh size reduction technique. Local refinement is achieved by using transition layers. More regular meshes can be generated in the interior of the domain and all angles of the triangle mesh produced by this algorithm are proven to be bounded in a reasonable range (19.5–141°). Copyright © 2010 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.     

Solution adaptive grids applied to low Reynolds number flow

A numerical study has been undertaken to investigate the use of a solution adaptive grid for flow around a cylinder in the laminar flow regime. The main purpose of this work is twofold. The first aim is to investigate the suitability of a grid adaptation algorithm and the reduction in mesh size that can be obtained. Secondly, the uniform asymmetric flow structures are ideal to validate the mesh structures due to mesh refinement and consequently the selected refinement criteria. The refinement variable used in this work is a product of the rate of strain and the mesh cell size, and contains two variables C_m and C_str which determine the order of each term. By altering the order of either one of these terms the refinement behaviour can be modified. Copyright © 2003 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.     

Mesh adaptation framework for embedded boundary methods for computational fluid dynamics and fluid-structure interaction

Embedded Boundary Methods (EBMs) are often preferred for the solution of Fluid-Structure Interaction (FSI) problems because they are reliable for large structural motions/deformations and topological changes. For viscous flow problems, however, they do not track the boundary layers that form around embedded obstacles and therefore do not maintain them resolved. Hence, an Adaptive Mesh Refinement (AMR) framework for EBMs is proposed in this paper. It is based on computing the distance from an edge of the embedding computational fluid dynamics mesh to the nearest embedded discrete surface and on satisfying the y⁺ requirements. It is also equipped with a Hessian-based criterion for resolving flow features such as shocks, vortices, and wakes and with load balancing for achieving parallel efficiency. It performs mesh refinement using a parallel version of the newest vertex bisection method to maintain mesh conformity. Hence, while it is sufficiently comprehensive to support many discretization methods, it is particularly attractive for vertex-centered finite volume schemes where dual cells tend to complicate the mesh adaptation process. Using the EBM known as FIVER, this AMR framework is verified for several academic FSI problems. Its potential for realistic FSI applications is also demonstrated with the simulation of a challenging supersonic parachute inflation dynamics problem.     

含泥质夹层油藏蒸汽注采过程的自适应网格算法研究

根据泥质夹层的低渗特性及空间分布，本文提出了一种含泥质夹层油藏网格渗透率的粗化计算方法，并在此基础上，将自适应网格算法应用于含泥质夹层油藏的数值模拟，提升其计算效率．在计算过程中，网格的动态划分仅依据流体物理量的变化，泥质夹层区域不全部采用细网格，仅针对流动锋面处的泥质夹层采用细网格，其余泥质夹层处采用不同程度的粗网格．相较于传统算法，网格数大幅下降．数值算例表明，自适应网格算法的计算结果精度与全精细网格一致，能够准确模拟出泥质夹层对于流体的阻碍作用，同时计算效率得到大幅提升，约为全精细网格算法的3~7 倍．     

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.     

A high‐order flux reconstruction adaptive mesh refinement method for magnetohydrodynamics on unstructured grids

We report our recent development of the high‐order flux reconstruction adaptive mesh refinement (AMR) method for magnetohydrodynamics (MHD). The resulted framework features a shock‐capturing duo of AMR and artificial resistivity (AR), which can robustly capture shocks and rotational and contact discontinuities with a fraction of the cell counts that are usually required. In our previous paper, 36 we have presented a shock‐capturing framework on hydrodynamic problems with artificial diffusivity and AMR. Our AMR approach features a tree‐free, direct‐addressing approach in retrieving data across multiple levels of refinement. In this article, we report an extension to MHD systems that retains the flexibility of using unstructured grids. The challenges due to complex shock structures and divergence‐free constraint of magnetic field are more difficult to deal with than those of hydrodynamic systems. The accuracy of our solver hinges on 2 properties to achieve high‐order accuracy on MHD systems: removing the divergence error thoroughly and resolving discontinuities accurately. A hyperbolic divergence cleaning method with multiple subiterations is used for the first task. This method drives away the divergence error and preserves conservative forms of the governing equations. The subiteration can be accelerated by absorbing a pseudo time step into the wave speed coefficient, therefore enjoys a relaxed CFL condition. The AMR method rallies multiple levels of refined cells around various shock discontinuities, and it coordinates with the AR method to obtain sharp shock profiles. The physically consistent AR method localizes discontinuities and damps the spurious oscillation arising in the curl of the magnetic field. The effectiveness of the AMR and AR combination is demonstrated to be much more powerful than simply adding AR on finer and finer mesh, since the AMR steeply reduces the required amount of AR and confines the added artificial diffusivity and resistivity to a narrower and narrower region. We are able to verify the designed high‐order accuracy in space by using smooth flow test problems on unstructured grids. The efficiency and robustness of this framework are fully demonstrated through a number of two‐dimensional nonsmooth ideal MHD tests. We also successfully demonstrate that the AMR method can help significantly save computational cost for the Orszag‐Tang vortex problem.     

界面不稳定性的自适应欧拉数值计算

采用欧拉网格自适应算法数值模拟Richtmyer Meshkov和Rayleigh Taylor不稳定多介质流界面,获得了高精度界面特征。对不同流体引入不同位标函数跟踪界面运动,将位标函数方程与流体动力学方程耦合求解,在笛卡儿坐标系中运用二阶精度有限体积算法,保持流场守恒条件下,通过采用多层网格级对笛卡儿网格嵌套细化,从而实现多介质流体界面的高精度自适应跟踪。给出的方法逻辑简单,可以大大节省CPU时间。     

Adaptive mesh refinement for simulation of thin film flows

We present a robust and accurate numerical method for simulating gravity-driven, thin-film flow problems. The convection term in the governing equation is treated by a semi-implicit, essentially non-oscillatory scheme. The resulting nonlinear discrete equation is solved using a nonlinear full approximation storage multigrid algorithm with adaptive mesh refinement techniques. A set of representative numerical experiments are presented. We show that the use of adaptive mesh refinement reduces computational time and memory compared to the equivalent uniform mesh results. Our simulation results are consistent with previous experimental observations.     

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.     

A finite volume scheme for solving anisotropic diffusion on ALE‐AMR grids

In the context of High Energy Density Physics and more precisely in the field of laser plasma interaction, Lagrangian schemes are commonly used. The lack of robustness due to strong grid deformations requires the regularization of the mesh through the use of Arbitrary Lagrangian Eulerian methods. Theses methods usually add some diffusion and a loss of precision is observed. We propose to use Adaptive Mesh Refinement (AMR) techniques to reduce this loss of accuracy. This work focuses on the resolution of the anisotropic diffusion operator on Arbitrary Lagrangian Eulerian‐AMR grids. In this paper, we describe a second‐order accurate cell‐centered finite volume method for solving anisotropic diffusion on AMR type grids. The scheme described here is based on local flux approximation which can be derived through the use of a finite difference approximation, leading to the CCLADNS scheme. We present here the 2D and 3D extension of the CCLADNS scheme to AMR meshes. Copyright © 2017 John Wiley & Sons, Ltd.     

Comparison of experimental data with the numerical simulation of planar entry flow: Role of the constitutive equation

The goal of this research was to determine whether there is any interaction between the type of constitutive equation used and the degree of mesh refinement, as well as how the type of constitutive equation might affect the convergence and quality of the solution, for a planar 4:1 contraction in the finite eiement method. Five constitutive equations were used in this work: the Phan-Thien–Tanner (PTT), Johnson–Segalman (JS), White–Metzner (WM), Leonov-like and upper convected Maxwell (UCM) models. A penalty Galerkin finite element technique was used to solve the system of non-linear differential equations. The constitutive equations were fitted to the steady shear viscosity and normal stress data for a polystyrene melt. In general it was found that the convergence limit based on the Deborah number De and the Weissenberg number We varied from model to model and from mesh to mesh. From a practical point of view it was observed that the wall shear stress in the downstream region should also be indicated at the point where convergence is lost, since this parameter reflects the throughput conditions. Because of the dependence of convergence on the combination of mesh size and constitutive equation, predictions of the computations were compared with birefringence data obtained for the same polystyrene melt flowing through a 4:1 planar contraction. Refinement in the mesh led to better agreement between the predictions using the PTT model and flow birefringence, but the oscillations became worse in the corner region as the mesh was further refined, eventually leading to the loss of convergence of the numerical algorithm. In comparing results using different models at the same wall shear stress conditions and on the same mesh, it was found that the PTT model gave less overshoot of the stresses at the re-entrant corner. Away from the corner there were very small differences between the quality of the solutions obtained using different models. All the models predicted solutions with oscillations. However, the values of the solutions oscillated around the experimental birefringence data, even when the numerical algorithm would not converge. Whereas the stresses are predicted to oscillate, the streamlines and velocity field remained smooth. Predictions for the existence of vortices as well as for the entrance pressure loss (ΔP_ent) varied from model to model. The UCM and WM models predicted negative values for ΔP_ent.     

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

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

High-resolution multi-code implementation of unsteady Navier–Stokes flow solver based on paralleled overset adaptive mesh refinement and high-order low-dissipation hybrid schemes

The low-dissipation high-order accurate hybrid up-winding/central scheme based on fifth-order weighted essentially non-oscillatory (WENO) and sixth-order central schemes, along with the Spalart--Allmaras (SA)-based delayed detached eddy simulation (DDES) turbulence model, and the flow feature-based adaptive mesh refinement (AMR), are implemented into a dual-mesh overset grid infrastructure with parallel computing capabilities, for the purpose of simulating vortex-dominated unsteady detached wake flows with high spatial resolutions. The overset grid assembly (OGA) process based on collection detection theory and implicit hole-cutting algorithm achieves an automatic coupling for the near-body and off-body solvers, and the error-and-try method is used for obtaining a globally balanced load distribution among the composed multiple codes. The results of flows over high Reynolds cylinder and two-bladed helicopter rotor show that the combination of high-order hybrid scheme, advanced turbulence model, and overset adaptive mesh refinement can effectively enhance the spatial resolution for the simulation of turbulent wake eddies.     

A study on the extension of a VOF/PLIC based method to a curvilinear co-ordinate system

The conventional volume-of-fluid method has the potential to deal with large free surface deformation on a fixed Cartesian grid. However, when free-surface flows are within or over complex geometries of industrial relevance, such as free-surface flows over offshore oil platforms, it is advantageous to extend the method originally written in Cartesian forms into non-Cartesian forms. In the present study, an algorithm similar to the algorithm described by Rudman in 1997 is proposed for use with curvilinear co-ordinates. This extension results in the ability to model complex geometries which could not be modelled using the original algorithm. Excellent agreement between the solutions obtained on both orthogonal and non-orthogonal meshes is achieved, although in general the L ₁ error, based on the exact solution, on the non-orthogonal mesh is slightly higher than that on the orthogonal mesh. The extended fluid flow solving capacity of the present method is demonstrated through its application to a non-orthogonal Rayleigh–Taylor instability problem.