Multigrid solutions of the Euler and Navier–Stokes equations on unstructured grids

A computationally efficient multigrid algorithm for upwind edge‐based finite element schemes is developed for the solution of the two‐dimensional Euler and Navier–Stokes equations on unstructured triangular grids. The basic smoother is based upon a Galerkin approximation employing an edge‐based formulation with the explicit addition of an upwind‐type local extremum diminishing (LED) method. An explicit time stepping method is used to advance the solution towards the steady state. Fully unstructured grids are employed to increase the flexibility of the proposed algorithm. A full approximation storage (FAS) algorithm is used as the basic multigrid acceleration procedure. Copyright © 1999 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.     

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.     

基于非结构网格的高效求解方法研究

非结构网格的求解效率一直是计算流体力学工作者十分关注的问题。本文从一个新的角度分析了N-S(Euler/Navier-Stokes)方程求解效率的高低,表明计算效率不仅涉及时间离散的效率,空间离散和程序算法都与之息息相关。采用不同的计算状态,对目前非结构网格上广泛应用的LU-SGS、对称Gauss-Seidel和GMRES方法进行较详细地比较和分析,考查了空间离散的耗时对方程求解效率的影响。结果表明,LU-SGS方法的计算效率在所给的算例中均是最低的;在不考虑大量内存消耗时,GMRES算法求解Euler方程的效率较高,松耦合求解N-S方程时效率会有所降低;在大规模计算中,多次对称的Gauss-Seidel迭代方法应是较好的选择,特别是N-S方程的求解。     

High‐order k‐exact WENO finite volume schemes for solving gas dynamic Euler equations on unstructured grids

This paper presents a family of High‐order finite volume schemes applicable on unstructured grids. The k‐exact reconstruction is performed on every control volume as the primary reconstruction. On a cell of interest, besides the primary reconstruction, additional candidate reconstruction polynomials are provided by means of very simple and efficient ‘secondary’ reconstructions. The weighted average procedure of the WENO scheme is then applied to the primary and secondary reconstructions to ensure the shock‐capturing capability of the scheme. This procedure combines the simplicity of the k‐exact reconstruction with the robustness of the WENO schemes and represents a systematic and unified way to construct High‐order accurate shock capturing schemes. To further improve the efficiency, an efficient problem‐independent shock detector is introduced. Several test cases are presented to demonstrate the accuracy and non‐oscillation property of the proposed schemes. The results show that the proposed schemes can predict the smooth solutions with uniformly High‐order accuracy and can capture the shock waves and contact discontinuities in high resolution. Copyright © 2011 John Wiley & Sons, Ltd.     

Evaluation of adaptive mesh refinement and coarsening for the computation of compressible flows on unstructured meshes

The compressible gas flows of interest to aerospace applications often involve situations where shock and expansion waves are present. Decreasing the characteristic dimension of the computational cells in the vicinity of shock waves improves the quality of the computed flows. This reduction in size may be accomplished by the use of mesh adaption procedures. In this paper an analysis is presented of an adaptive mesh scheme developed for an unstructured mesh finite volume upwind computer code. This scheme is tailored to refine or coarsen the computational mesh where gradients of the flow properties are respectively high or low. The refinement and coarsening procedures are applied to the classical gas dynamic problems of the stabilization of shock waves by solid bodies. In particular, situations where oblique shock waves interact with an expansion fan and where bow shocks arise around solid bodies are considered. The effectiveness of the scheme in reducing the computational time, while increasing the solution accuracy, is assessed. It is shown that the refinement procedure alone leads to a number of computational cells which is 20% larger than when alternate passes of refinement and coarsening are used. Accordingly, a reduction of computational time of the same order of magnitude is obtained. Copyright © 2005 John Wiley & Sons, Ltd.     

High‐order ENO and WENO schemes for unstructured grids

This work describes the implementation and analysis of high‐order accurate schemes applied to high‐speed flows on unstructured grids. The class of essentially non‐oscillatory schemes (ENO), that includes weighted ENO schemes (WENO), is discussed in the paper with regard to the implementation of third‐ and fourth‐order accurate methods. The entire reconstruction process of ENO and WENO schemes is described with emphasis on the stencil selection algorithms. The stencils can be composed by control volumes with any number of edges, e.g. triangles, quadrilaterals and hybrid meshes. In the paper, ENO and WENO schemes are implemented for the solution of the dimensionless, 2‐D Euler equations in a cell centred finite volume context. High‐order flux integration is achieved using Gaussian quadratures. An approximate Riemann solver is used to evaluate the fluxes on the interfaces of the control volumes and a TVD Runge–Kutta scheme provides the time integration of the equations. Such a coupling of all these numerical tools, together with the high‐order interpolation of primitive variables provided by ENO and WENO schemes, leads to the desired order of accuracy expected in the solutions. An adaptive mesh refinement technique provides better resolution in regions with strong flowfield gradients. Results for high‐speed flow simulations are presented with the objective of assessing the implemented capability. Copyright © 2007 John Wiley & Sons, Ltd.     

Finite volume scheme for the solution of fluid flow problems on unstructured non‐staggered grids

A recently developed non‐staggered methodology which uses the principle of applying fourth‐order dissipation to the governing pressure‐correction equation is developed so it can be applied to unstructured grids. A finite volume methodology is used for discretization. The fourth‐order dissipation term is found using second‐order gradient operators. This makes it straightforward to incorporate the dissipation term on unstructured grids. The new methodology is compared with solutions from a standard finite volume second‐order flow solver and is also tested for a standard laminar driven‐lid flow problem with grids systems that do not have a uniform structure. Finally, we demonstrate how the new methodology can be used to predict flow over a wavy boundary. Copyright © 2002 John Wiley & Sons, Ltd.     

Unsteady shock‐fitting for unstructured grids

An unstructured, shock‐fitting algorithm, originally developed to simulate steady flows, has being further developed to make it capable of dealing with unsteady flows. The present paper discusses and analyses the additional features required to extend to unsteady flows, the steady algorithm. The properties of the unsteady version of this novel, unstructured shock‐fitting technique, are tested by reference to the inviscid interaction between a vortex and a planar shock: a comparative assessment of shock‐capturing and shock‐fitting is made for the same test problem. Copyright © 2015 John Wiley & Sons, Ltd.     

An improved unstructured WENO method for compressible multi‐fluids flow

An improved high‐order accurate WENO finite volume method based on unstructured grids for compressible multi‐fluids flow is proposed in this paper. The third‐order accuracy WENO finite volume method based on triangle cell is used to discretize the governing equations. To have higher order of accuracy, the P1 polynomial is reconstructed firstly. After that, the P2 polynomial is reconstructed from the combination of the P1. The reconstructed coefficients are calculated by analytical form of inverse matrix rather than the numerical inversion. This greatly improved the efficiency and the robustness. Four examples are presented to examine this algorithm. Numerical results show that there is no spurious oscillation of velocity and pressure across the interface and high‐order accurate result can be achieved. Copyright © 2016 John Wiley & Sons, Ltd.     

Low‐cost implicit schemes for all‐speed flows on unstructured meshes

Matrix‐free implicit treatments are now commonly used for computing compressible flow problems: a reduced cost per iteration and low‐memory requirements are their most attractive features. This paper explains how it is possible to preserve these features for all‐speed flows, in spite of the use of a low‐Mach preconditioning matrix. The proposed approach exploits a particular property of a widely used low‐Mach preconditioner proposed by Turkel. Its efficiency is demonstrated on some steady and unsteady applications. Copyright © 2008 John Wiley & Sons, Ltd.     

A nodal Godunov method for Lagrangian shock hydrodynamics on unstructured tetrahedral grids

We present a nodal Godunov method for Lagrangian shock hydrodynamics. The method is designed to operate on three‐dimensional unstructured grids composed of tetrahedral cells. A node‐centered finite element formulation avoids mesh stiffness, and an approximate Riemann solver in the fluid reference frame ensures a stable, upwind formulation. This choice leads to a non‐zero mass flux between control volumes, even though the mesh moves at the fluid velocity, but eliminates volume errors that arise due to the difference between the fluid velocity and the contact wave speed. A monotone piecewise linear reconstruction of primitive variables is used to compute interface unknowns and recover second‐order accuracy. The scheme has been tested on a variety of standard test problems and exhibits first‐order accuracy on shock problems and second‐order accuracy on smooth flows using meshes of up to O(10⁶) tetrahedra. Copyright © 2014 John Wiley & Sons, Ltd.     

A new TVD method for advection simulation on 2D unstructured grids

For advection schemes with flux limiters derived on one‐dimensional grids to two‐dimensional (2D) unstructured triangular ones. In this method, the variables located normal to this face are taken into more account to compute the flux, by means of defining required nodes along the line through the center point of the considered face and perpendicular to it. Besides, the new method adopts the improved total variation diminishing schemes in, which consider the face position between the two neighboring cells as well as the size differences of the related cells; therefore, it fits 2D unstructured grids well. Compared with the present flux limiting methods for 2D unstructured grids, a higher accuracy and efficiency and a good monotonicity are achieved by the new method.Copyright © 2012 John Wiley & Sons, Ltd.     

Symmetric Gauss-Seidel multigrid solution of the Euler equations on structured and unstructured grids

The efficient symmetric Gauss-Seidel (SGS) algorithm for solving the Euler equations of inviscid, compressible flow on structured grids, developed in collaboration with Jameson of Stanford University, is extended to unstructured grids. The algorithm uses a nonlinear formulation of an SGS solver, implemented within the framework of multigrid. The earlier form of the algorithm used the natural (lexicographic) ordering of the mesh cells available on structured grids for the SGS sweeps, but a number of features of the method that are believed to contribute to its success can also be implemented for computations on unstructured grids. The present paper reviews, the features of the SGS multigrid solver for structured gr0ids, including its nonlinear implementation, its use of “absolute” Jacobian matrix preconditioning, and its incorporation of multigrid, and then describes the incorporation of these features into an algorithm suitable for computations on unstructured grids. The implementation on unstructured grids is based on the agglomerated multigrid method developed by Sørensen, which uses an explicit Runge-Kutta smoothing algorithm. Results of computations for steady, transonic flows past two-dimensional airfoils are presented, and the efficiency of the method is evaluated for computations on both structured and unstructured meshes.     

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.     

Parallel adaptive refinement for unsteady flow calculations on 3D unstructured grids

A parallel adaptive refinement algorithm for three‐dimensional unstructured grids is presented. The algorithm is based on an hierarchical h‐refinement/derefinement scheme for tetrahedral elements.The algorithm has been fully parallelized for shared‐memory platforms via a domain decomposition of the mesh at the algebraic level. The effectiveness of the procedure is demonstrated with applications which involve unsteady compressible fluid flow. A parallel speedup study of the algorithm also is included. Published in 2004 by John Wiley & Sons, Ltd.     

Godunov-type solution of the shallow water equations on adaptive unstructured triangular grids

A Godunov-type upwind finite volume solver of the non-linear shallow water equations is described. The shallow water equations are expressed in a hyperbolic conservation law formulation for application to cases where the bed topography is spatially variable. Inviscid fluxes at cell interfaces are computed using Roe's approximate Riemann solver. Second-order accurate spatial calculations of the fluxes are achieved by enhancing the polynomial approximation of the gradients of conserved variables within each cell. Numerical oscillations are curbed by means of a non-linear slope limiter. Time integration is second-order accurate and implicit. The numerical model is based on dynamically adaptive unstructured triangular grids. Test cases include an oblique hydraulic jump, jet-forced flow in a flat-bottomed circular reservoir, wind-induced circulation in a circular basin of non-uniform bed topography and the collapse of a circular dam. The model is found to give accurate results in comparison with published analytical and alternative numerical solutions. Dynamic grid adaptation and the use of a second-order implicit time integration scheme are found to enhance the computational efficiency of the model.     

Algebraic turbulence models for the computation of two-dimensional high-speed flows using unstructured grids

The incorporation of algebraic turbulence models in a solver for the 2D compressible Navier–Stokes equations using triangular grids is described. A practical way to use the Cebeci–Smith model and to modify it in separated regions is proposed. The ability of the model to predict high-speed perfect-gas boundary layers is investigated from a numerical point of view.