An unstructured/structured multi‐layer hybrid grid method and its application

A multi‐layer hybrid grid method is constructed to simulate complex flow field around 2‐D and 3‐D configuration. The method combines Cartesian grids with structured grids and triangular meshes to provide great flexibility in discretizing a domain. We generate the body‐fitted structured grids near the wall surface and the Cartesian grids for the far field. In addition, we regard the triangular meshes as an adhesive to link each grid part. Coupled with a tree data structure, the Cartesian grid is generated automatically through a cell‐cutting algorithm. The grid merging methodology is discussed, which can smooth hybrid grids and improve the quality of the grids. A cell‐centred finite volume flow solver has been developed in combination with a dual‐time stepping scheme. The flow solver supports arbitrary control volume cells. Both inviscid and viscous flows are computed by solving the Euler and Navier–Stokes equations. The above methods and algorithms have been validated on some test cases. Computed results are presented and compared with experimental data. Copyright © 2006 John Wiley & Sons, Ltd.     

复杂无粘流场数值模拟的矩形/三角形混合网格技术

建立了一套模拟复杂无粘流场的矩形／三角形混合网格技术，其中三角形仅限于物面附近，发挥非结构网格的几何灵活性，以少量的网格模拟复杂外型；同时在以外的区域采用矩形结构网格，发挥矩形网格计算简单快速的优势，有效地克服全非结构网格计算方法需要较大内存量和较长ＣＰＵ时间的不足．混合网格系统由修正的四分树方法生成．将ＮＮＤ有限差分与ＮＮＤ有限体积格式有机地融合于混合网格计算，消除了全矩形网格模拟曲边界的台阶效应，同时保证了网格间的通量守恒．数值实验表明本方法在模拟复杂无粘流场方面的灵活性和高效性．     

An efficient and accurate algebraic interface capturing method for unstructured grids in 2 and 3 dimensions: The THINC method with quadratic surface representation

We present in this paper an efficient and accurate volume of fluid (VOF) type scheme to compute moving interfaces on unstructured grids with arbitrary quadrilateral mesh elements in 2D and hexahedral elements in 3D. Being an extension of the multi‐dimensional tangent of hyperbola interface capturing (THINC) reconstruction proposed by the authors in Cartesian grid, an algebraic VOF scheme is devised for arbitrary quadrilateral and hexahedral elements. The interface is cell‐wisely approximated by a quadratic surface, which substantially improves the numerical accuracy. The same as the other THINC type schemes, the present method does not require the explicit geometric representation of the interface when computing numerical fluxes and thus is very computationally efficient and straightforward in implementation. The proposed scheme has been verified by benchmark tests, which reveal that this scheme is able to produce high‐quality numerical solutions of moving interfaces in unstructured grids and thus a practical method for interfacial multi‐phase flow simulations. Copyright © 2014 John Wiley & Sons, Ltd.     

A three‐dimensional hydrodynamic model for shallow waters using unstructured Cartesian grids

This paper presents a three‐dimensional unstructured Cartesian grid model for simulating shallow water hydrodynamics in lakes, rivers, estuaries, and coastal waters. It is a flux‐based finite difference model that uses a cut‐cell approach to fit the bottom topography and shorelines and, at the same time, has the flexibility of discretizing complex geometries with Cartesian grids that can be arbitrarily downsized in the two horizontal directions simultaneously. Because of the use of Cartesian grids, the grid generation is very simple and does not suffer the grid generation headache often seen in many other unstructured models, as the unstructured Cartesian grid model does not have any requirements on the orthogonality of the grids. The newly developed unstructured Cartesian grid model was validated against analytical solutions for a three‐dimensional seiching case in a rectangular basin, before it was compared with another three‐dimensional model named LESS3D for circulations and salinity transport processes in an idealized embayment that is driven by tides and freshwater inflows. Model tests show that the numerical procedure used in the unstructured Cartesian grid model is robust. Similar to other unstructured models, a variable grid size has resulted in a smaller number of grids required for a reasonable model simulation, which in turn reduces the CPU time used in the model run. Copyright © 2010 John Wiley & Sons, Ltd.     

A numerical study on a Cartesian-based body-fitted adaptive grid method

ABSTRACT

A hybrid Cartesian-based body-fitted adaptive grid method for compressible Navier–Stokes equations is implemented and investigated. In this method, the body-fitted structured grids are generated around the geometries, and the left regions are filled with Cartesian grids. To transfer the data between the different grids, the donor cell searching technique is adopted. An unstructured data-based finite volume update procedure is used, and least squares method is suggested to retain the second order in the overlap region. The moving shock waves with different speeds and vortex passing through the interfaces of the hybrid Cartesian grid are used to explore the accuracy and conservation. A new technique is presented to deal with the non-physical stagnation of slowly moving shock wave around the interface of grid. Numerical examples are presented to demonstrate the results. The three-dimensional extension has also been shown by a benchmark problem.     

Simulation of sharp gas–liquid interface using VOF method and adaptive grid local refinement around the interface

The volume of fluid (VOF) method is used to perform two‐phase simulations (gas–liquid). The governing Navier–Stokes conservation equations of the flow field are numerically solved on two‐dimensional axisymmetric or three‐dimensional unstructured grids, using Cartesian velocity components, following the finite volume approximation and a pressure correction method. A new method of adaptive grid local refinement is developed in order to enhance the accuracy of the predictions, to capture the sharp gas–liquid interface and to speed up the calculations. Results are compared with experimental measurements in order to assess the efficiency of the method. Copyright © 2004 John Wiley & Sons, Ltd.     

The shallow flow equations solved on adaptive quadtree grids

This paper describes an adaptive quadtree grid‐based solver of the depth‐averaged shallow water equations. The model is designed to approximate flows in complicated large‐scale shallow domains while focusing on important smaller‐scale localized flow features. Quadtree grids are created automatically by recursive subdivision of a rectangle about discretized boundary, bathymetric or flow‐related seeding points. It can be fitted in a fractal‐like sense by local grid refinement to any boundary, however distorted, provided absolute convergence to the boundary is not required and a low level of stepped boundary can be tolerated. Grid information is stored as a tree data structure, with a novel indexing system used to link information on the quadtree to a finite volume discretization of the governing equations. As the flow field develops, the grids may be adapted using a parameter based on vorticity and grid cell size. The numerical model is validated using standard benchmark tests, including seiches, Coriolis‐induced set‐up, jet‐forced flow in a circular reservoir, and wetting and drying. Wind‐induced flow in the Nichupté Lagoon, México, provides an illustrative example of an application to flow in extremely complicated multi‐connected regions. Copyright © 2001 John Wiley & Sons, Ltd.     

Aerodynamic shape optimization on overset grids using the adjoint method

This paper deals with the use of the continuous adjoint equation for aerodynamic shape optimization of complex configurations with overset grids methods. While the use of overset grid eases the grid generation process, the non‐trivial task of ensuring communication between overlapping grids needs careful attention. This need is effectively addressed by using a practically useful technique known as the implicit hole cutting (IHC) method. The method depends on a simple cell selection process based on the criterion of cell size, and all grid points including interior points and fringe points are treated indiscriminately in the computation of the flow field. This paper demonstrates the simplicity of the IHC method for the adjoint equation. Similar to the flow solver, the adjoint equations are solved on conventional point‐matched and overlapped grids within a multi‐block framework. Parallel computing with message passing interface is also used to improve the overall efficiency of the optimization process. The method is successfully demonstrated in several two‐ and a three‐dimensional shape optimization cases for both external and internal flow problems. Copyright © 2009 John Wiley & Sons, Ltd.     

动态混合网格生成及隐式非定常计算方法

建立了一种基于动态混合网格的非定常数值计算方法. 混合网格由贴体的四边形网格、外场 的多层次矩形网格和中间的三角形网格构成. 当物体运动时，贴体四边形网格随物体运动而 运动，而外场的矩形网格保持静止，中间的三角形网格随之变形；当物体运动位移较大，导 致三角形网格的质量降低，甚至导致网格相交时，在局部重新生成网格. 新网格上的物理量 由旧网格上的物理量插值而得. 为了提高计算效率，采用了双时间步和子迭代相结合的隐式 有限体积格式计算非定常Navier-Stokes方程. 子迭代采用高效的块LU-SGS方法. 利用该 方法数值模拟了NACA0012振荡翼型的无黏和黏性绕流，得到了与实验和他人计算相当一致 的结果.     

Cell-vertex Based Parallel and Adaptive Explicit 3D Flow Solution on Unstructured Grids

A parallel adaptive Euler flow solution algorithm is developed for 3D applications on distributed memory computers. Significant contribution of this research is the development and implementation of a parallel grid adaptation scheme together with an explicit cell vertex-based finite volume 3D flow solver on unstructured tetrahedral grids. Parallel adaptation of grids is based on grid-regeneration philosophy by using an existing serial grid generation program. Then, a general partitioner repartitions the grid. An adaptive sensor value, which is a measure to refine or coarsen grids, is calculated considering the pressure gradients in all partitioned blocks of grids. The parallel performance of the present study was tested. Parallel computations were performed on Unix workstations and a Linux cluster using MPI communication library. The present results show that overall adaptation scheme developed in this study is applicable to any pair of a flow solver and grid generator with affordable cost. It is also proved that parallel adaptation is necessary for accurate and efficient flow solutions.     

A structured but non‐uniform Cartesian grid‐based model for the shallow water equations

In large‐scale shallow flow simulations, local high‐resolution predictions are often required in order to reduce the computational cost without losing the accuracy of the solution. This is normally achieved by solving the governing equations on grids refined only to those areas of interest. Grids with varying resolution can be generated by different approaches, e.g. nesting methods, patching algorithms and adaptive unstructured or quadtree gridding techniques. This work presents a new structured but non‐uniform Cartesian grid system as an alternative to the existing approaches to provide local high‐resolution mesh. On generating a structured but non‐uniform Cartesian grid, the whole computational domain is first discretized using a coarse background grid. Local refinement is then achieved by directly allocating a specific subdivision level to each background grid cell. The neighbour information is specified by simple mathematical relationships and no explicit storage is needed. Hence, the structured property of the uniform grid is maintained. After employing some simple interpolation formulae, the governing shallow water equations are solved using a second‐order finite volume Godunov‐type scheme in a similar way as that on a uniform grid. Copyright © 2010 John Wiley & Sons, Ltd.     

Computation of free‐surface flows with local mesh adaptation

This paper describes a modern free‐surface capturing strategy implemented in an unstructured finite‐volume viscous flow solver that can handle moving grids composed of arbitrary‐shaped control volumes. An adaptive mesh strategy is fully integrated in the code making it a single tool for dynamically maintaining a prescribed density of grid points around the steady or unsteady interface between air and water. The whole adaptive procedure is described in detail. The efficiency of the overall approach is examined on two‐ and three‐dimensional hydrodynamic applications. The adaptive strategy achieves interesting gains in terms of computational and human efforts compared to single‐mesh computations. Copyright © 2005 John Wiley & Sons, Ltd.     

基于复合叉树的自适应笛卡尔网格应用研究

采用复合叉树自适应笛卡尔网格和有限体积法求解三维Euler方程,在网格生成过程中,以模型几何外形、模型表面曲率为基础,构建了基于复合叉树的网格生成和加密方法。在流场计算过程中,又针对流场变化特征,建立了基于复合叉树的网格各向异性拆分模式,同时采用以中心差分为基础的Jameson有限体积法。通过对M6机翼在跨音速情况下的数值仿真,表明计算结果与风洞实验结果符合良好,同时也表明本算法具有高分辨率、节省机时,提高计算效率等特点。     

A novel Cartesian cut cell solver for incompressible viscous flow in irregular domains

A Cartesian cut cell solver with solution‐based adaptive mesh refinement is developed for simulating viscous, incompressible flows with arbitrary complex geometries. The cut cells are automatically generated using Volume CAD (VCAD), a framework for storing geometric and material attribute data. Unlike earlier cut cell methods, this solver organizes the cutting patterns into only six categories and further subdivides the resulting pentagon into two quadrilaterals, such that mesh data can be stored by uniform data structure and the post‐processing of flow data can be handled conveniently. A novel method is proposed to treat minuscule cut cells without the process of cell merging. A collocated finite volume method, which can be used even when multiple cell shapes and orthogonal and non‐orthogonal grids exist in the decomposition, is employed to discretize the Navier–Stokes equations. A modified SIMPLE‐based smoothing pressure correction scheme is applied in this cut cell method to suppress checkerboard pressure oscillations caused by collocated arrangement. The solver is first used to simulate a channel flow to demonstrate its calculation accuracy expressed with L₁ and L_∞ norm errors and then the method is utilized to solve three benchmark problems of flow and heat transfer within irregular domains to verify its feasibility, efficiency, accuracy and potential in engineering applications. Copyright © 2010 John Wiley & Sons, Ltd.     

A simplified adaptive Cartesian grid system for solving the 2D shallow water equations

This paper presents a new simplified grid system that provides local refinement and dynamic adaptation for solving the 2D shallow water equations (SWEs). Local refinement is realized by simply specifying different subdivision levels to the cells on a background uniform coarse grid that covers the computational domain. On such a non‐uniform grid, the structured property of a regular Cartesian mesh is maintained and neighbor information is determined by simple algebraic relationships, i.e. data structure becomes unnecessary. Dynamic grid adaptation is achieved by changing the subdivision level of a background cell. Therefore, grid generation and adaptation is greatly simplified and straightforward to implement. The new adaptive grid‐based SWE solver is tested by applying it to simulate three idealized test cases and promising results are obtained. The new grid system offers a simplified alternative to the existing approaches for providing adaptive mesh refinement in computational fluid dynamics. Copyright © 2011 John Wiley & Sons, Ltd.     

A finite volume unstructured multigrid method for efficient computation of unsteady incompressible viscous flows

An unstructured non‐nested multigrid method is presented for efficient simulation of unsteady incompressible Navier–Stokes flows. The Navier–Stokes solver is based on the artificial compressibility approach and a higher‐order characteristics‐based finite‐volume scheme on unstructured grids. Unsteady flow is calculated with an implicit dual time stepping scheme. For efficient computation of unsteady viscous flows over complex geometries, an unstructured multigrid method is developed to speed up the convergence rate of the dual time stepping calculation. The multigrid method is used to simulate the steady and unsteady incompressible viscous flows over a circular cylinder for validation and performance evaluation purposes. It is found that the multigrid method with three levels of grids results in a 75% reduction in CPU time for the steady flow calculation and 55% reduction for the unsteady flow calculation, compared with its single grid counterparts. The results obtained are compared with numerical solutions obtained by other researchers as well as experimental measurements wherever available and good agreements are obtained. Copyright © 2004 John Wiley & Sons, Ltd.     

A grid deformation technique for unsteady flow computations

A grid deformation technique is presented here based on a transfinite interpolation algorithm applied to the grid displacements. The method, tested using a two‐dimensional flow solver that uses an implicit dual‐time method for the solution of the unsteady Euler equations on deforming grids, is applicable to problems with time varying geometries arising from aeroelasticity and free surface marine problems. The present work is placed into a multi‐block framework and fits into the development of a generally applicable parallel multi‐block flow solver. The effect of grid deformation is examined and comparison with rigidly rotated grids is made for a series of pitching aerofoil test cases selected from the AGARD aeroelastic configurations for the NACA0012 aerofoil. The effect of using a geometric conservation law is also examined. Finally, a demonstration test case for the Williams aerofoil with an oscillating flap is presented, showing the capability of the grid deformation technique. Copyright © 2000 John Wiley & Sons, Ltd.     

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

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

A sliding interface method for unsteady unstructured flow simulations

The objective of this work is to develop a sliding interface method for simulations involving relative grid motion that is fast and efficient and involves no grid deformation, remeshing, or hole cutting. The method is implemented into a parallel, node‐centred finite volume, unstructured viscous flow solver. The rotational motion is accomplished by rigidly rotating the subdomain representing the moving component. At the subdomain interface boundary, the faces along the interface are extruded into the adjacent subdomain to create new volume elements forming a one‐cell overlap. These new volume elements are used to compute a flux across the subdomain interface. An interface flux is computed independently for each subdomain. The values of the solution variables and other quantities for the nodes created by the extrusion process are determined by linear interpolation. The extrusion is done so that the interpolation will maintain information as localized as possible. The grid on the interface surface is arbitrary. The boundary between the two subdomains is completely independent from one another; meaning that they do not have to connect in a one‐to‐one manner and no symmetry or pattern restrictions are placed on the grid. A variety of numerical simulations were performed on model problems and large‐scale applications to examine conservation of the interface flux. Overall solution errors were found to be comparable to that for fully connected and fully conservative simulations. Excellent agreement is obtained with theoretical results and results from other solution methodologies. Copyright © 2006 John Wiley & Sons, Ltd.