Hybrid grid generation for viscous flow analysis

Cartesian grid with cut‐cell method has drawn attention of CFD researchers owing to its simplicity. However, it suffers from the accuracy near the boundary of objects especially when applied to viscous flow analysis. Hybrid grid consisting of Cartesian grid in the background, body‐fitted layer near the object, and transition layer connecting the two is an interesting alternative. In this paper, we propose a robust method to generate hybrid grid in two‐dimensional (2D) and three‐dimensional (3D) space for viscous flow analysis. In the first step, body‐fitted layer made of quadrangles (in 2D) or prisms (in 3D) is created near the object's boundary by extruding front nodes with a speed function depending on the minimum normal curvature obtained by quadric surface fitting. To solve global interferences effectively, a level set method is used to find candidates of colliding cells. Then, axis‐aligned Cartesian grid (quadtree in 2D or octree in 3D) is filled in the rest of the domain. Finally, the gap between body‐fitted layer and Cartesian grid is connected by transition layer composed of triangles (in 2D) or tetrahedrons (in 3D). Mesh in transition layer is initially generated by constrained Delaunay triangulation from sampled points based on size function and is further optimized to provide smooth connection. Our approach to automatic hybrid grid generation has been tested with many models including complex geometry and multi‐body cases, showing robust results in reasonable time. Copyright © 2012 John Wiley & Sons, Ltd.     

Orthogonal grid generation for Navier–Stokes computations

Body conforming orthogonal grids were generated using a fast hyperbolic method for aerofoils, and were used to solve the Navier–Stokes equation in the generalized orthogonal system for the first time for time accurate simulation of incompressible flow. For grid generation, the Beltrami equation and the definition equation for the orthogonality are solved using a finite difference method. The grids generated around aerofoils by this method have better orthogonality than the results published by earlier investigators. The Navier–Stokes equation at Reynolds numbers of 3000 and 35 000 for NACA 0012 and NACA 0015 respectively, have been solved as an application. The obtained results match quite well with the corresponding experimental results. © 1998 John Wiley & Sons, Ltd.     

A finite volume method for numerical grid generation

A novel method to generate body‐fitted grids based on the direct solution for three scalar functions is derived. The solution for scalar variables ξ, η and ζ is obtained with a conventional finite volume method based on a physical space formulation. The grid is adapted or re‐zoned to eliminate the residual error between the current solution and the desired solution, by means of an implicit grid‐correction procedure. The scalar variables are re‐mapped and the process is reiterated until convergence is obtained. Calculations are performed for a variety of problems by assuming combined Dirichlet–Neumann and pure Dirichlet boundary conditions involving the use of transcendental control functions, as well as functions designed to effect grid control automatically on the basis of boundary values. The use of dimensional analysis to build stable exponential functions and other control functions is demonstrated. Automatic procedures are implemented: one based on a finite difference approximation to the Cristoffel terms assuming local‐boundary orthogonality, and another designed to procure boundary orthogonality. The performance of the new scheme is shown to be comparable with that of conventional inverse methods when calculations are performed on benchmark problems through the application of point‐by‐point and whole‐field solution schemes. Advantages and disadvantages of the present method are critically appraised. Copyright © 1999 National Research Council of Canada.     

A stream function–vorticity formulation‐based immersed boundary method and its applications

A new stream function–vorticity formulation‐based immersed boundary method is presented in this paper. Different from the conventional immersed boundary method, the main feature of the present model is to accurately satisfy both governing equations and boundary conditions through velocity correction and vorticity correction procedures. The velocity correction process is performed implicitly based on the requirement that velocity at the immersed boundary interpolated from the corrected velocity field accurately satisfies the nonslip boundary condition. The vorticity correction is made through the stream function formulation rather than the vorticity transport equation. It is evaluated from the firstorder derivatives of velocity correction. Two simple and efficient ways are presented for approximation of velocity‐correction derivatives. One is based on finite difference approximation, while the other is based on derivative expressions of Dirac delta function and velocity correction. It was found that both ways can work very well. The main advantage of the proposed method lies in its simple concept, easy implementation, and robustness in stability. Numerical experiments for both stationary and moving boundary problems were conducted to validate the capability and efficiency of the present method. Good agreements with available data in the literature were achieved. Copyright © 2011 John Wiley & Sons, Ltd.     

A non‐conforming least‐squares finite element method for incompressible fluid flow problems

In this paper, we develop least‐squares finite element methods (LSFEMs) for incompressible fluid flows with improved mass conservation. Specifically, we formulate a new locally conservative LSFEM for the velocity–vorticity–pressure Stokes system, which uses a piecewise divergence‐free basis for the velocity and standard C⁰ elements for the vorticity and the pressure. The new method, which we term dV‐VP improves upon our previous discontinuous stream‐function formulation in several ways. The use of a velocity basis, instead of a stream function, simplifies the imposition and implementation of the velocity boundary condition, and eliminates second‐order terms from the least‐squares functional. Moreover, the size of the resulting discrete problem is reduced because the piecewise solenoidal velocity element is approximately one‐half of the dimension of a stream‐function element of equal accuracy. In two dimensions, the discontinuous stream‐function LSFEM [1] motivates modification of our functional, which further improves the conservation of mass. We briefly discuss the extension of this modification to three dimensions. Computational studies demonstrate that the new formulation achieves optimal convergence rates and yields high conservation of mass. We also propose a simple diagonal preconditioner for the dV‐VP formulation, which significantly reduces the condition number of the LSFEM problem. Published 2012. This article is a US Government work and is in the public domain in the USA.     

An adaptive Cartesian grid generation method for ‘Dirty’ geometry

Traditional structured and unstructured grid generation methods need a ‘water‐tight’ boundary surface grid to start. Therefore, these methods are named boundary to interior (B2I) approaches. Although these methods have achieved great success in fluid flow simulations, the grid generation process can still be very time consuming if ‘non‐water‐tight’ geometries are given. Significant user time can be taken to repair or clean a ‘dirty’ geometry with cracks, overlaps or invalid manifolds before grid generation can take place. In this paper, we advocate a different approach in grid generation, namely the interior to boundary (I2B) approach. With an I2B approach, the computational grid is first generated inside the computational domain. Then this grid is intelligently ‘connected’ to the boundary, and the boundary grid is a result of this ‘connection’. A significant advantage of the I2B approach is that ‘dirty’ geometries can be handled without cleaning or repairing, dramatically reducing grid generation time. An I2B adaptive Cartesian grid generation method is developed in this paper to handle ‘dirty’ geometries without geometry repair. Comparing with a B2I approach, the grid generation time with the I2B approach for a complex automotive engine can be reduced by three orders of magnitude. Copyright © 2002 John Wiley & Sons, Ltd.     

A compact finite difference method on staggered grid for Navier–Stokes flows

Compact finite difference methods feature high‐order accuracy with smaller stencils and easier application of boundary conditions, and have been employed as an alternative to spectral methods in direct numerical simulation and large eddy simulation of turbulence. The underpinning idea of the method is to cancel lower‐order errors by treating spatial Taylor expansions implicitly. Recently, some attention has been paid to conservative compact finite volume methods on staggered grid, but there is a concern about the order of accuracy after replacing cell surface integrals by average values calculated at centres of cell surfaces. Here we introduce a high‐order compact finite difference method on staggered grid, without taking integration by parts. The method is implemented and assessed for an incompressible shear‐driven cavity flow at Re = 10³, a temporally periodic flow at Re = 10⁴, and a spatially periodic flow at Re = 10⁴. The results demonstrate the success of the method. Copyright © 2006 John Wiley & Sons, Ltd.     

A high‐order accurate method for two‐dimensional incompressible viscous flows

A high‐order accurate solution method for complex geometries is developed for two‐dimensional flows using the stream function–vorticity formulation. High‐order accurate spectrally optimized compact schemes along with appropriate boundary schemes are used for spatial discretization while a two‐level backward Euler implicit scheme is used for the time integration. The linear system of equations for stream function and vorticity are solved by an inner iteration while contravariant velocities constitute outer iterations. The effect of curvilinear grids on the solution accuracy is studied. The method is used to compute Cartesian and inclined driven cavity, flow in a triangular cavity and viscous flow in constricted channel. Benchmark‐like accuracy is obtained in all the problems with fewer grid points compared to reported studies. Copyright © 2006 John Wiley & Sons, Ltd.     

Grid‐free surface vorticity method applied to flow induced vibration of flexible cylinders

In order to study cross flow induced vibration of heat exchanger tube bundles, a new fluid–structure interaction model based on surface vorticity method is proposed. With this model, the vibration of a flexible cylinder is simulated at Re=2.67 × 10⁴, the computational results of the cylinder response, the fluid force, the vibration frequency, and the vorticity map are presented. The numerical results reproduce the amplitude‐limiting and non‐linear (lock‐in) characteristics of flow‐induced vibration. The maximum vibration amplitude as well as its corresponding lock‐in frequency is in good agreement with experimental results. The amplitude of vibration can be as high as 0.88D for the case investigated. As vibration amplitude increases, the amplitude of the lift force also increases. With enhancement of vibration amplitude, the vortex pattern in the near wake changes significantly. This fluid–structure interaction model is further applied to simulate flow‐induced vibration of two tandem cylinders and two side‐by‐side cylinders at similar Reynolds number. Promising and reasonable results and predictions are obtained. It is hopeful that with this relatively simple and computer time saving method, flow induced vibration of a large number of flexible tube bundles can be successfully simulated. Copyright © 2004 John Wiley & Sons, Ltd.     

Numerical solution of three‐dimensional velocity–vorticity Navier–Stokes equations by finite difference method

This paper describes the finite difference numerical procedure for solving velocity–vorticity form of the Navier–Stokes equations in three dimensions. The velocity Poisson equations are made parabolic using the false‐transient technique and are solved along with the vorticity transport equations. The parabolic velocity Poisson equations are advanced in time using the alternating direction implicit (ADI) procedure and are solved along with the continuity equation for velocities, thus ensuring a divergence‐free velocity field. The vorticity transport equations in conservative form are solved using the second‐order accurate Adams–Bashforth central difference scheme in order to assure divergence‐free vorticity field in three dimensions. The velocity and vorticity Cartesian components are discretized using a central difference scheme on a staggered grid for accuracy reasons. The application of the ADI procedure for the parabolic velocity Poisson equations along with the continuity equation results in diagonally dominant tri‐diagonal matrix equations. Thus the explicit method for the vorticity equations and the tri‐diagonal matrix algorithm for the Poisson equations combine to give a simplified numerical scheme for solving three‐dimensional problems, which otherwise requires enormous computational effort. For three‐dimensional‐driven cavity flow predictions, the present method is found to be efficient and accurate for the Reynolds number range 100?Re?2000. Copyright © 2004 John Wiley & Sons, Ltd.     

A subdomain boundary element method for high‐Reynolds laminar flow using stream function‐vorticity formulation

The paper presents a new formulation of the integral boundary element method (BEM) using subdomain technique. A continuous approximation of the function and the function derivative in the direction normal to the boundary element (further ‘normal flux’) is introduced for solving the general form of a parabolic diffusion‐convective equation. Double nodes for normal flux approximation are used. The gradient continuity is required at the interior subdomain corners where compatibility and equilibrium interface conditions are prescribed. The obtained system matrix with more equations than unknowns is solved using the fast iterative linear least squares based solver. The robustness and stability of the developed formulation is shown on the cases of a backward‐facing step flow and a square‐driven cavity flow up to the Reynolds number value 50 000. Copyright © 2004 John Wiley & Sons, Ltd.     

A 3D mesh deformation technique for irregular in‐flight ice accretion

Aircraft holding around busy airports may be requested to sustain as much as 45 min of icing before landing or being diverted to another airport. In this paper, a three‐dimensional mesh deformation scheme, based on a structural frame analogy, is proposed for the numerical simulation of ice accretion during extended exposure to adverse weather conditions. The goal is to provide an approach that is robust and efficient enough to delay or altogether avoid re‐meshing while preserving (enforcing) nearly orthogonal elements at the highly distorted ice surface. Robustness is achieved by suitably modifying the axial and torsional stiffness components of the frame elements in order to handle large and irregular grid displacements typical of in‐flight icing. Computational efficiency is obtained by applying the mesh displacement to an automatically selected small subset of the entire computational domain. The methodology is validated first in the case of deformations typical of fluid‐structure interaction problems, including wing bending, a helicopter rotor in forward flight, and the twisting of a high‐lift wing configuration. The approach is then assessed for aero‐icing on two swept wings and compared against experimental measurements where available. Copyright © 2015 John Wiley & Sons, Ltd.     

A fixed‐grid b‐spline finite element technique for fluid–structure interaction

We present a fixed‐grid finite element technique for fluid–structure interaction problems involving incompressible viscous flows and thin structures. The flow equations are discretised with isoparametric b‐spline basis functions defined on a logically Cartesian grid. In addition, the previously proposed subdivision‐stabilisation technique is used to ensure inf–sup stability. The beam equations are discretised with b‐splines and the shell equations with subdivision basis functions, both leading to a rotation‐free formulation. The interface conditions between the fluid and the structure are enforced with the Nitsche technique. The resulting coupled system of equations is solved with a Dirichlet–Robin partitioning scheme, and the fluid equations are solved with a pressure–correction method. Auxiliary techniques employed for improving numerical robustness include the level‐set based implicit representation of the structure interface on the fluid grid, a cut‐cell integration algorithm based on marching tetrahedra and the conservative data transfer between the fluid and structure discretisations. A number of verification and validation examples, primarily motivated by animal locomotion in air or water, demonstrate the robustness and efficiency of our approach. Copyright © 2013 John Wiley & Sons, Ltd.     

A momentum coupling method for the unsteady incompressible Navier–Stokes equations on the staggered grid

A new numerical method is developed to efficiently solve the unsteady incompressible Navier–Stokes equations with second-order accuracy in time and space. In contrast to the SIMPLE algorithms, the present formulation directly solves the discrete x- and y-momentum equations in a coupled form. It is found that the present implicit formulation retrieves some cross convection terms overlooked by the conventional iterative methods, which contribute to accuracy and fast convergence. The finite volume method is applied on the fully staggered grid to solve the vector-form momentum equations. The preconditioned conjugate gradient squared method (PCGS) has proved very efficient in solving the associate linearized large, sparse block-matrix system. Comparison with the SIMPLE algorithm has indicated that the present momentum coupling method is fast and robust in solving unsteady as well as steady viscous flow problems. © 1998 John Wiley & Sons, Ltd.     

A comparison of primitive variables and streamfunction–vorticity for fem depth-averaged modelling of steady flow

The governing equations for depth-averaged turbulent flow are presented in both the primitive variable and streamfunction–vorticity forms. Finite element formulations are presented, with special emphasis on the handling of bottom stress terms and spatially varying eddy viscosity. The primitive variable formulation is found to be preferable because of its flexibility in handling spatial variation in viscosity, variability in water surface elevations, and inflow and outflow boundaries. The substantial reduction in computational effort afforded by the streamfunction–vorticity formulation is found not to be sufficient to recommend its use for general depth-averaged flows. For those flows in which the surface can be approximated as a fixed level surface, the streamfunction–vorticity form can produce results equivalent to the primitive variable form as long as turbulent viscosity can be estimated as a constant.     

A fast nested multi‐grid viscous flow solver for adaptive Cartesian/Quad grids

A nested multi‐grid solution algorithm has been developed for an adaptive Cartesian/Quad grid viscous flow solver. Body‐fitted adaptive Quad (quadrilateral) grids are generated around solid bodies through ‘surface extrusion’. The Quad grids are then overlapped with an adaptive Cartesian grid. Quadtree data structures are employed to record both the Quad and Cartesian grids. The Cartesian grid is generated through recursive sub‐division of a single root, whereas the Quad grids start from multiple roots—a forest of Quadtrees, representing the coarsest possible Quad grids. Cell‐cutting is performed at the Cartesian/Quad grid interface to merge the Cartesian and Quad grids into a single unstructured grid with arbitrary cell topologies (i.e., arbitrary polygons). Because of the hierarchical nature of the data structure, many levels of coarse grids have already been built in. The coarsening of the unstructured grid is based on the Quadtree data structure through reverse tree traversal. Issues arising from grid coarsening are discussed and solutions are developed. The flow solver is based on a cell‐centered finite volume discretization, Roe's flux splitting, a least‐squares linear reconstruction, and a differentiable limiter developed by Venkatakrishnan in a modified form. A local time stepping scheme is used to handle very small cut cells produced in cell‐cutting. Several cycling strategies, such as the saw‐tooth, W‐ and V‐cycles, have been studies. The V‐cycle has been found to be the most efficient. In general, the multi‐grid solution algorithm has been shown to greatly speed up convergence to steady state—by one to two orders. Copyright © 2000 John Wiley & Sons, Ltd.     

A meshless finite point method for three‐dimensional analysis of compressible flow problems involving moving boundaries and adaptivity

A finite point method for solving compressible flow problems involving moving boundaries and adaptivity is presented. The numerical methodology is based on an upwind‐biased discretization of the Euler equations, written in arbitrary Lagrangian–Eulerian form and integrated in time by means of a dual‐time steeping technique. In order to exploit the meshless potential of the method, a domain deformation approach based on the spring network analogy is implemented, and h‐adaptivity is also employed in the computations. Typical movable boundary problems in transonic flow regime are solved to assess the performance of the proposed technique. In addition, an application to a fluid–structure interaction problem involving static aeroelasticity illustrates the capability of the method to deal with practical engineering analyses. The computational cost and multi‐core performance of the proposed technique is also discussed through the examples provided. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

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.     

Fast boundary‐domain integral algorithm for the computation of incompressible fluid flow problems

The paper deals with the numerical solution of fluid dynamics using the boundary‐domain integral method (BDIM). A velocity–vorticity formulation of the Navier–Stokes equations is adopted, where the kinematic equation is written in its parabolic form. Computational aspects of the numerical simulation of two‐dimensional flows is described in detail. In order to lower the computational cost, the subdomain technique is applied. A preconditioned Krylov subspace method (PKSM) is used for the solution of systems of linear equations. Level‐based fill‐in incomplete lower upper decomposition (ILU) preconditioners are developed and their performance is examined. Scaling of stopping criteria is applied to minimize the number of iterations for the PKSM. The effectiveness of the proposed method is tested on several benchmark test problems. Copyright © 1999 John Wiley & Sons, Ltd.