Development of new finite volume schemes on unstructured triangular grid for simulating the gas–liquid two‐phase flow

This paper presents a coupled finite volume inner doubly iterative efficient algorithm for linked equations (IDEAL) with level set method to simulate the incompressible gas–liquid two‐phase flows with moving interfaces on unstructured triangular grid. The finite volume IDEAL method on a collocated grid is employed to solve the incompressible two‐phase Navier–Stokes equations, and the level set method is used to capture the moving interfaces. For the sake of mass conservation, an effective second‐order accurate finite volume scheme is developed to solve the level set equation on triangular grid, which can be implemented much easier than the classical high‐order level set solvers. In this scheme, the value of level set function on the boundary of control volume is approximated using a linear combination of a high‐order Larangian interpolation and a second‐order upwind interpolation. By the rotating slotted disk and stretching and shrinking of a circular fluid element benchmark cases, the mass conservation and accuracy of the new scheme is verified. Then the coupled method is applied to two‐phase flows, including a 2D bubble rising problem and a 2D dam breaking problem. The computational results agree well with those reported in literatures and experimental data. Copyright © 2015 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.     

An aspect ratio agglomeration multigrid for unstructured grids

A robust aspect ratio‐based agglomeration algorithm to generate high quality of coarse grids for unstructured and hybrid grids is proposed in this paper. The algorithm focuses on multigrid techniques for the numerical solution of Euler and Navier–Stokes equations, which conform to cell‐centered finite volume special discretization scheme, combines vertex‐based isotropic agglomeration and cell‐based directional agglomeration to yield large increases in convergence rates. Aspect ratio is used as fusing weight to capture the degree of cell convexity and give an indication of cell stretching. Agglomeration front queue is established to propagate inward from the boundaries, which stores isotropic vertex and also high‐stretched cell marked with different flag according to aspect ratio. We conduct the present method to solve Euler and Navier–Stokes equations on unstructured and hybrid grids and compare the results with single grid as well as MGridGen, which shows that the present method is efficient in reducing computational time for large‐scale system equations. Copyright © 2013 John Wiley & Sons, Ltd.     

Developing implicit pressure‐weighted upwinding scheme to calculate steady and unsteady flows on unstructured grids

The finite‐volume methods normally utilize either simple or complicated mathematical expressions to interpolate the fluxes at the cell faces of their unstructured volumes. Alternatively, we benefit from the advantages of both finite‐volume and finite‐element methods and estimate the advection terms on the cell faces using an inclusive pressure‐weighted upwinding scheme extended on unstructured grids. The present pressure‐based method treats the steady and unsteady flows on a collocated grid arrangement. However, to avoid a non‐physical spurious pressure field pattern, two mass flux per volume expressions are derived at the cell interfaces. The dual advantages of using an unstructured‐based discretization and a pressure‐weighted upwinding scheme result in obtaining high accurate solutions with noticeable progress in the performance of the primitive method extended on the structured grids. The accuracy and performance of the extended formulations are demonstrated by solving different standard and benchmark problems. The results show that there are excellent agreements with both benchmark and analytical solutions as well as experimental data. Copyright © 2007 John Wiley & Sons, Ltd.     

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 gas‐kinetic scheme for the simulation of turbulent flows on unstructured meshes

This paper presents a numerical method for simulating turbulent flows via coupling the Boltzmann BGK equation with Spalart–Allmaras one equation turbulence model. Both the Boltzmann BGK equation and the turbulence model equation are carried out using the finite volume method on unstructured meshes, which is different from previous works on structured grid. The application of the gas‐kinetic scheme is extended to the simulation of turbulent flows with arbitrary geometries. The adaptive mesh refinement technique is also adopted to reduce the computational cost and improve the efficiency of meshes. To organize the unstructured mesh data structure efficiently, a non‐manifold hybrid mesh data structure is extended for polygonal cells. Numerical experiments are performed on incompressible flow over a smooth flat plate and compressible turbulent flows around a NACA 0012 airfoil using unstructured hybrid meshes. These numerical results are found to be in good agreement with experimental data and/or other numerical solutions, demonstrating the applicability of the proposed method to simulate both subsonic and transonic turbulent flows. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

A time‐accurate pseudo‐compressibility approach based on an unstructured hybrid finite volume technique applied to unsteady turbulent premixed flame propagation

A preconditioning approach based on the artificial compressibility formulation is extended to solve the governing equations for unsteady turbulent reactive flows with heat release, at low Mach numbers, on an unstructured hybrid grid context. Premixed reactants are considered and a flamelet approach for combustion modelling is adopted using a continuous quenched mean reaction rate. An overlapped cell‐vertex finite volume method is adopted as a discretisation scheme. Artificial dissipation terms for hybrid grids are explicitly added to ensure a stable, discretised set of equations. A second‐order, explicit, hybrid Runge–Kutta scheme is applied for the time marching in pseudo‐time. A time derivative of the dependent variable is added to recover the time accuracy of the preconditioned set of equations. This derivative is discretised by an implicit, second‐order scheme. The resulting scheme is applied to the calculation of an infinite planar (one‐dimensional) turbulent premixed flame propagating freely in reactants whose turbulence is supposed to be frozen, homogeneous and isotropic. The accuracy of the results obtained with the proposed method proves to be excellent when compared to the data available in the literature. Copyright © 2004 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.     

High‐order strand grid methods for low‐speed and incompressible flows

A novel high‐order finite volume scheme using flux correction methods in conjunction with structured finite differences is extended to low Mach and incompressible flows on strand grids. Flux correction achieves a high order by explicitly canceling low‐order truncation error terms across finite volume faces and is applied in unstructured layers of the strand grid. The layers are then coupled together using a source term containing summation‐by‐parts finite differences in the strand direction. A preconditioner is employed to extend the method to low speed and incompressible flows. We further extend the method to turbulent flows with the Spalart–Allmaras model. Laminar flow test cases indicate improvements in accuracy and convergence using the high‐order preconditioned method, while turbulent body‐of‐revolution flow results show improvements in only some cases, perhaps because of dominant errors arising from the turbulence model itself. Copyright © 2016 John Wiley & Sons, Ltd.     

The Lagrange–Galerkin method for the two‐dimensional shallow water equations on adaptive grids

The weak Lagrange–Galerkin finite element method for the two‐dimensional shallow water equations on adaptive unstructured grids is presented. The equations are written in conservation form and the domains are discretized using triangular elements. Lagrangian methods integrate the governing equations along the characteristic curves, thus being well suited for resolving the non‐linearities introduced by the advection operator of the fluid dynamics equations. An additional fortuitous consequence of using Lagrangian methods is that the resulting spatial operator is self‐adjoint, thereby justifying the use of a Galerkin formulation; this formulation has been proven to be optimal for such differential operators. The weak Lagrange–Galerkin method automatically takes into account the dilation of the control volume, thereby resulting in a conservative scheme. The use of linear triangular elements permits the construction of accurate (by virtue of the second‐order spatial and temporal accuracies of the scheme) and efficient (by virtue of the less stringent Courant–Friedrich–Lewy (CFL) condition of Lagrangian methods) schemes on adaptive unstructured triangular grids. Lagrangian methods are natural candidates for use with adaptive unstructured grids because the resolution of the grid can be increased without having to decrease the time step in order to satisfy stability. An advancing front adaptive unstructured triangular mesh generator is presented. The highlight of this algorithm is that the weak Lagrange–Galerkin method is used to project the conservation variables from the old mesh onto the newly adapted mesh. In addition, two new schemes for computing the characteristic curves are presented: a composite mid‐point rule and a general family of Runge–Kutta schemes. Results for the two‐dimensional advection equation with and without time‐dependent velocity fields are illustrated to confirm the accuracy of the particle trajectories. Results for the two‐dimensional shallow water equations on a non‐linear soliton wave are presented to illustrate the power and flexibility of this strategy. Copyright © 2000 John Wiley & Sons, Ltd.     

Level‐set based flamelet approach for simulating turbulent lifted jet flame

The present study focuses on numerically investigating the flame structure, flame liftoff, and stabilization in a lifted turbulent H₂/N₂ jet flame with a vitiated coflow. To realistically represent the turbulent partially premixed nature in the flow region between nozzle exit and flame base, the level‐set approach coupled with the conserved scalar flamelet model has been applied. The unstructured‐grid level‐set approach has been developed to allow the geometric flexibility and computational efficiency for the solution of the physically and geometrically complex reacting flows. The pressure–velocity coupling is handled by the multiple pressure‐correction method. The predicted flame pattern is in good conformity with the measured one. In terms of the liftoff height, the agreement between prediction and experiment is quite good. Even if there are noticeable deviations in a certain region, the predicted profiles for the overall flame structure agree reasonably well with the experimental data. These numerical results indicate that the present level‐set‐based flamelet approach in conjunction with the unstructured‐grid finite‐volume method is capable of realistically predicting the essential features and precise structure of the turbulent‐lifted jet flame with computational efficiency. Copyright © 2008 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.     

Three‐dimensional modeling of non‐hydrostatic free‐surface flows on unstructured grids

A three‐dimensional numerical model is presented for the simulation of unsteady non‐hydrostatic shallow water flows on unstructured grids using the finite volume method. The free surface variations are modeled by a characteristics‐based scheme, which simulates sub‐critical and super‐critical flows. Three‐dimensional velocity components are considered in a collocated arrangement with a σ‐coordinate system. A special treatment of the pressure term is developed to avoid the water surface oscillations. Convective and diffusive terms are approximated explicitly, and an implicit discretization is used for the pressure term to ensure exact mass conservation. The unstructured grid in the horizontal direction and the σ coordinate in the vertical direction facilitate the use of the model in complicated geometries. Solution of the non‐hydrostatic equations enables the model to simulate short‐period waves and vertically circulating flows. Copyright © 2015 John Wiley & Sons, Ltd.     

SIMPLE‐type preconditioners for cell‐centered,colocated finite volume discretization of incompressible Reynolds‐averaged Navier–Stokes equations

This paper contains a comparison of four SIMPLE‐type methods used as solver and as preconditioner for the iterative solution of the (Reynolds‐averaged) Navier–Stokes equations, discretized with a finite volume method for cell‐centered, colocated variables on unstructured grids. A matrix‐free implementation is presented, and special attention is given to the treatment of the stabilization matrix to maintain a compact stencil suitable for unstructured grids. We find SIMPLER preconditioning to be robust and efficient for academic test cases and industrial test cases. Compared with the classical SIMPLE solver, SIMPLER preconditioning reduces the number of nonlinear iterations by a factor 5–20 and the CPU time by a factor 2–5 depending on the case. The flow around a ship hull at Reynolds number 2E9, for example, on a grid with cell aspect ratio up to 1:1E6, can be computed in 3 instead of 15 h.Copyright © 2012 John Wiley & Sons, Ltd.     

On the Computation of Compressible Turbulent Flows on Unstructured Grids

An accurate, fast, matrix-free implicit method has been developed to solve compressible turbulent How problems using the Spalart and Allmaras one equation turbulence model on unstructured meshes. The mean-flow and turbulence-model equations are decoupled in the time integration in order to facilitate the incorporation of different turbulence models and reduce memory requirements. Both mean flow and turbulent equations are integrated in time using a linearized implicit scheme. A recently developed, fast, matrix-free implicit method, GMRES+LU-SGS, is then applied to solve the resultant system of linear equations. The spatial discretization is carried out using a hybrid finite volume and finite element method, where the finite volume approximation based on a containment dual control volume rather than the more popular median-dual control volume is used to discretize the inviscid fluxes, and the finite element approximation is used to evaluate the viscous flux terms. The developed method is used to compute a variety of turbulent flow problems in both 2D and 3D. The results obtained are in good agreement with theoretical and experimental data and indicate that the present method provides an accurate, fast, and robust algorithm for computing compressible turbulent flows on unstructured meshes.     

Two‐dimensional flow past circular cylinders using finite volume lattice Boltzmann formulation

In this article, an extension to the total variation diminishing finite volume formulation of the lattice Boltzmann equation method on unstructured meshes was presented. The quadratic least squares procedure is used for the estimation of first‐order and second‐order spatial gradients of the particle distribution functions. The distribution functions were extrapolated quadratically to the virtual upwind node. The time integration was performed using the fourth‐order Runge–Kutta procedure. A grid convergence study was performed in order to demonstrate the order of accuracy of the present scheme. The formulation was validated for the benchmark two‐dimensional, laminar, and unsteady flow past a single circular cylinder. These computations were then investigated for the low Mach number simulations. Further validation was performed for flow past two circular cylinders arranged in tandem and side‐by‐side. Results of these simulations were extensively compared with the previous numerical data. Copyright © 2011 John Wiley & Sons, Ltd.     

Unsteady CFD computations using vertex‐centered finite volumes for unstructured grids on Graphics Processing Units

This paper presents a Navier–Stokes solver for steady and unsteady turbulent flows on unstructured/hybrid grids, with triangular and quadrilateral elements, which was implemented to run on Graphics Processing Units (GPUs). The paper focuses on programming issues for efficiently porting the CPU code to the GPU, using the CUDA language. Compared with cell‐centered schemes, the use of a vertex‐centered finite volume scheme on unstructured grids increases the programming complexity since the number of nodes connected by edge to any other node might vary a lot. Thus, delicate GPU memory handling is absolutely necessary in order to maximize the speed‐up of the GPU implementation with respect to the Fortran code running on a single CPU core. The developed GPU‐enabled code is used to numerically study steady and unsteady flows around the supercritical airfoil OAT15A, by laying emphasis on the transonic buffet phenomenon. The computations were carried out on NVIDIA's Ge‐Force GTX 285 graphics cards and speed‐ups up to ～46 × (on a single GPU, with double precision arithmetic) are reported. Copyright © 2010 John Wiley & Sons, Ltd.     

Multigrid third‐order least‐squares solution of Cauchy–Riemann equations on unstructured triangular grids

In this paper, a multigrid algorithm is developed for the third‐order accurate solution of Cauchy–Riemann equations discretized in the cell‐vertex finite‐volume fashion: the solution values stored at vertices and the residuals defined on triangular elements. On triangular grids, this results in a highly overdetermined problem, and therefore we consider its solution that minimizes the residuals in the least‐squares norm. The standard second‐order least‐squares scheme is extended to third‐order by adding a high‐order correction term in the residual. The resulting high‐order method is shown to give sufficiently accurate solutions on relatively coarse grids. Combined with a multigrid technique, the method then becomes a highly accurate and efficient solver. We present some results to demonstrate its accuracy and efficiency, including both structured and unstructured triangular grids. Copyright © 2006 John Wiley & Sons, Ltd.     

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.