Parameter investigation with line-implicit lower–upper symmetric Gauss–Seidel on 3D stretched grids

An implicit lower–upper symmetric Gauss–Seidel (LU-SGS) solver has been implemented as a multigrid smoother combined with a line-implicit method as an acceleration technique for Reynolds-averaged Navier–Stokes (RANS) simulation on stretched meshes. The computational fluid dynamics code concerned is Edge, an edge-based finite volume Navier–Stokes flow solver for structured and unstructured grids. The paper focuses on the investigation of the parameters related to our novel line-implicit LU-SGS solver for convergence acceleration on 3D RANS meshes. The LU-SGS parameters are defined as the Courant–Friedrichs–Lewy number, the left-hand side dissipation, and the convergence of iterative solution of the linear problem arising from the linearisation of the implicit scheme. The influence of these parameters on the overall convergence is presented and default values are defined for maximum convergence acceleration. The optimised settings are applied to 3D RANS computations for comparison with explicit and line-implicit Runge–Kutta smoothing. For most of the cases, a computing time acceleration of the order of 2 is found depending on the mesh type, namely the boundary layer and the magnitude of residual reduction.     

HIGH-ORDER DISCONTINUOUS GALERKIN SOLUTION OF N-S EQUATIONS ON HYBRID MESH

针对层流NS方程发展了混合网格上的高阶间断有限元方法,给出了物面边界高阶近似的具体步骤以及近物面弯曲单元的处理方法。对数值离散产生的非线性方程组采用牛顿迭代进行求解,每个牛顿循环采用预处理广义最小余量法求解产生的大型稀疏线性系统。使用该方法得到了典型算例的数值结果,并跟前人的计算结果进行了比较。计算结果表明,混合网格上应用高阶间断有限元方法求解黏性流动具有很好的应用前景。     

基于非结构/混合网格模拟黏性流的高阶精度DDG/FV混合方法

间断Galerkin有限元方法(discontinuous Galerkin method, DGM) 因具有计算精度高、模板紧致、易于并行等优点, 近年来已成为非结构/混合网格上广泛研究的高阶精度数值方法. 但其计算量和内存需求量巨大, 特别是对于网格规模达到百万甚至数千万的大型三维实际复杂外形问题, 其计算量和存储量对计算资源的消耗是难以承受的. 基于“混合重构”的DG/FV 格式可以有效降低DGM 的计算量和存储量. 本文将DDG 黏性项离散方法推广应用于DG/FV 混合算法, 得到新的DDG/FV混合格式, 以进一步提高DG/FV混合算法对于黏性流动模拟的计算效率. 通过Couette流动、层流平板边界层、定常圆柱绕流, 非定常圆柱绕流和NACA0012 翼型绕流等二维黏性流算例, 优化了DDG 通量公式中的参数选择, 验证了DDG/FV 混合格式对定常和非定常黏性流模拟的精度和计算效率, 并与广泛使用的BR2-DG 格式的计算结果和效率进行对比研究. 一系列数值实验结果表明, 本文构造的DDG/FV混合格式在二维非结构/混合网格的Navier-Stokes 方程求解中, 在达到相同的数值精度阶的前提下, 相比BR2-DG格式, 对于隐式时间离散的定常问题计算效率提高了2 倍以上, 对于显式时间离散的非定常问题计算效率提高1.6 倍, 并且在一些算例中, 混合格式具有更优良的计算稳定性. DDG/FV 混合格式提升了计算效率和稳定性, 具有良好的应用前景.      

A higher‐order unsplit 2D direct Eulerian finite volume method for two‐material compressible flows based on the MOOD paradigms

A higher‐order unsplit multi‐dimensional discretization of the diffuse interface model for two‐material compressible flows proposed by R. Saurel, F. Petitpas and R. A. Berry in 2009 is developed. The proposed higher‐order method is based on the concepts of the Multidimensional Optimal Order Detection (MOOD) method introduced in three recent papers for single‐material flows. The first‐order unsplit multi‐dimensional Finite Volume discretization presented by SPB serves as foundation for the development of the higher‐order unlimited schemes. Specific detection criteria along with a novel decrementing algorithm for the MOOD method are designed in order to deal with the complexity of multi‐material flows. Numerically, we compare errors and computational times on several 1D problems (stringent shock tube and cavitation problems) computed on 2D meshes with the second‐ and fourth‐order MOOD methods using a classical MUSCL method as reference. Several simulations of a 2D shocked R22 bubble in the air are also presented on Cartesian and unstructured meshes with the second‐ and fourth‐order MOOD methods, and qualitative comparisons confirm the conclusions obtained with 1D problems. These numerical results demonstrate the robustness of the MOOD approach and the interest of using more than second‐order methods even for locally singular solutions of complex physics models. Copyright © 2014 John Wiley & Sons, Ltd.     

基于非结构/混合网格的高阶精度格式研究进展

尽管以二阶精度格式为基础的计算流体力学(CFD) 方法和软件已经在航空航天飞行器设计中发挥了重要的作用, 但是由于二阶精度格式的耗散和色散较大, 对于湍流、分离等多尺度流动现象的模拟, 现有成熟的CFD 软件仍难以给出满意的结果, 为此CFD 工作者发展了众多的高阶精度计算格式. 如果以适应的计算网格来分类, 一般可以分为基于结构网格的有限差分格式、基于非结构/混合网格的有限体积法和有限元方法,以及各种类型的混合方法. 由于非结构/混合网格具有良好的几何适应性, 基于非结构/混合网格的高阶精度格式近年来备受关注. 本文综述了近年来基于非结构/混合网格的高阶精度格式研究进展, 重点介绍了空间离散方法, 主要包括k-Exact 和ENO/WENO 等有限体积方法, 间断伽辽金(DG) 有限元方法, 有限谱体积(SV) 和有限谱差分(SD) 方法, 以及近来发展的各种DG/FV 混合算法和将各种方法统一在一个框架内的CPR (correctionprocedure via reconstruction) 方法等. 随后简要介绍了高阶精度格式应用于复杂外形流动数值模拟的一些需要关注的问题, 包括曲边界的处理方法、间断侦测和限制器、各种加速收敛技术等. 在综述过程中, 介绍了各种方法的优势与不足, 其间介绍了作者发展的基于"静动态混合重构" 的DG/FV 混合算法. 最后展望了基于非结构/混合网格的高阶精度格式的未来发展趋势及应用前景.     

A Spalart–allmaras Turbulence Model Implementation for High-order Discontinuous Galerkin Solution of the Reynolds-averaged Navier-stokes Equations

A novel and robust approach has been proposed for the high-order discontinuous Galerkin (DG) discretization of the Reynolds-averaged Navier-Stokes (RANS) equations with the turbulence model of Spalart-Allmaras (SA). The solution polynomials of the SA equation are reconstructed by the Hermite weighted essentially non-oscillatory (HWENO) scheme. Several practical techniques are suggested to simplify and extend a positivity-preserving limiter to further guarantee the positivity of SA working variable. The resulting positivity-preserving HWENO limiting method is compact and easy to implement on arbitrary meshes. Typical turbulent flows are conducted to assess the accuracy and robustness of the present method. Numerical experiments demonstrate that with the increasing grid or order resolution, the limited results of the working variable are getting closer to the unlimited ones. And the most obvious improvement with proposed method is on the computation of the working variable field in wake regions.     

Footbridge between finite volumes and finite elements with applications to CFD

The aim of this paper is to introduce a new algorithm for the discretization of second‐order elliptic operators in the context of finite volume schemes on unstructured meshes. We are strongly motivated by partial differential equations (PDEs) arising in computational fluid dynamics (CFD), like the compressible Navier–Stokes equations. Our technique consists of matching up a finite volume discretization based on a given mesh with a finite element representation on the same mesh. An inverse operator is also built, which has the desirable property that in the absence of diffusion, one recovers exactly the finite volume solution. Numerical results are also provided. Copyright © 2001 John Wiley & Sons, Ltd.     

基于静动态混合重构的DG/FV混合格式

通过比较紧致格式和间断Galerkin(DG)格式, 提出了``静态重构'和``动态重构'的概念,对有限体积方法和DG有限元方法进行统一的表述. 借鉴有限体积的思想, 发展了基于``混合重构'技术的一类新的DG格式, 称之为间断Galerkin有限元/有限体积混合格式(DG/FV格式). 该类混合格式通过适当地扩展模板(拓展至紧邻单元)重构单元内的高阶多项式分布, 在提高精度的同时, 减少了传统DG格式的计算量和存储量. 通过典型一维和二维标量方程的计算发现新的混合格式在有些情况下具有超收敛(superconvergence)性质.      

A Hybrid Domain Decomposition and Multigrid Method for the Acceleration of Compressible Viscous Flow Calculations on Unstructured Triangular Meshes

This paper is concerned with the formulation and the evaluation of a hybrid solution method that makes use of domain decomposition and multigrid principles for the calculation of two-dimensional compressible viscous flows on unstructured triangular meshes. More precisely, a non-overlapping additive domain decomposition method is used to coordinate concurrent subdomain solutions with a multigrid method. This hybrid method is developed in the context of a flow solver for the Navier-Stokes equations which is based on a combined finite element/finite volume formulation on unstructured triangular meshes. Time integration of the resulting semi-discrete equations is performed using a linearized backward Euler implicit scheme. As a result, each pseudo time step requires the solution of a sparse linear system. In this study, a non-overlapping domain decomposition algorithm is used for advancing the solution at each implicit time step. Algebraically, the Schwarz algorithm is equivalent to a Jacobi iteration on a linear system whose matrix has a block structure. A substructuring technique can be applied to this matrix in order to obtain a fully implicit scheme in terms of interface unknowns. In the present approach, the interface unknowns are numerical fluxes. The interface system is solved by means of a full GMRES method. Here, the local system solves that are induced by matrix-vector products with the interface operator, are performed using a multigrid by volume agglomeration method. The resulting hybrid domain decomposition and multigrid solver is applied to the computation of several steady flows around a geometry of NACA0012 airfoil.     

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.     

Discretization of transport equations on 2D Cartesian unstructured grids using data from remote cells for the convection terms

This paper presents a new finite volume discretization methodology for the solution of transport equations on locally refined or unstructured Cartesian meshes. The implementation of the cell‐face values of the dependent variables enables the employment of data from remote cells and thus the use of higher‐order differencing schemes. It also results in simple and flux‐conservative multiple‐scale stencils for the discretization of the governing equations. The latter are finally cast into a generalized form that does not depend on the local mesh structure. The performance of the numerical model is demonstrated on some classical 2D problems using various gridding techniques and a bounded second‐order upwind scheme. A stable and efficient behaviour of the algorithm is observed in all test cases. The results indicate that the combination in the present model of both local grid refinement and second‐order discretization can produce substantially more accurate solutions than each of the above techniques alone, for the same computational effort. The method is also applicable to turbulent flows and can be easily extended to three‐dimensions. Copyright © 2003 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.     

A computationally efficient 3D finite‐volume scheme for violent liquid–gas sloshing

We describe a semi‐implicit volume‐of‐fluid free‐surface‐modelling methodology for flow problems involving violent free‐surface motion. For efficient computation, a hybrid‐unstructured edge‐based vertex‐centred finite volume discretisation is employed, while the solution methodology is entirely matrix free. Pressures are solved using a matrix‐free preconditioned generalised minimum residual algorithm and explicit time‐stepping is employed for the momentum and interface‐tracking equations. The high resolution artificial compressive (HiRAC) volume‐of‐fluid method is used for accurate capturing of the free surface in violent flow regimes while allowing natural applicability to hybrid‐unstructured meshes. The code is parallelised for solution on distributed‐memory architectures and evaluated against 2D and 3D benchmark problems. Good parallel scaling is demonstrated, with almost linear speed‐up down to 6000 cells per core. Finally, the code is applied to an industrial‐type problem involving resonant excitation of a fuel tank, and a comparison with experimental results is made in this violent sloshing regime. Copyright © 2015 John Wiley & Sons, Ltd.     

High-order Lagrangian cell-centered conservative scheme on unstructured meshes

A high-order Lagrangian cell-centered conservative gas dynamics scheme is presented on unstructured meshes. A high-order piecewise pressure of the cell is intro- duced. With the high-order piecewise pressure of the cell, the high-order spatial discretiza- tion fluxes are constructed. The time discretization of the spatial fluxes is performed by means of the Taylor expansions of the spatial discretization fluxes. The vertex velocities are evaluated in a consistent manner due to an original solver located at the nodes by means of momentum conservation. Many numerical tests are presented to demonstrate the robustness and the accuracy of the scheme.     

Assessment of different reconstruction techniques for implementing the NVSF schemes on unstructured meshes

Three new far‐upwind reconstruction techniques, New‐Technique 1, 2, and 3, are proposed in this paper, which localize the normalized variable and space formulation (NVSF) schemes and facilitate the implementation of standard bounded high‐resolution differencing schemes on arbitrary unstructured meshes. By theoretical analysis, it is concluded that the three new techniques overcome two inherent drawbacks of the original technique found in the literature. Eleven classic high‐resolution NVSF schemes developed in the past decades are selected to evaluate performances of the three new techniques relative to the original technique. Under the circumstances of arbitrary unstructured meshes, stretched meshes, and uniform triangular meshes, for each NVSF scheme, the accuracies and convergence properties, when implementing the four aforementioned far‐upwind reconstruction techniques respectively, are assessed by the pure convection of several scalar profiles. The numerical results clearly show that New‐Technique‐2 leads to a better performance in terms of overall accuracy and convergence behavior for the 11 NVSF schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

A refined r‐factor algorithm for TVD schemes on arbitrary unstructured meshes

A refined r‐factor algorithm for implementing total variation diminishing (TVD) schemes on arbitrary unstructured meshes, referred to henceforth as a face‐perpendicular far‐upwind interpolation scheme for arbitrary meshes (FFISAM), is proposed based on an extensive review of the existing r‐factor algorithms available in the literature. The design principles, as well as the respective advantages and disadvantages, of the existing algorithms are first systematically analyzed before presenting the FFISAM. The FFISAM is designed to combine the merits of various existing r‐factor algorithms. The performance of the FFISAM, implemented in 10 classical TVD schemes, is evaluated against four two‐dimensional pure‐advection benchmark test cases where analytical solutions are available. The numerical results clearly show that the FFISAM leads to a better overall performance than the existing algorithms in terms of accuracy and convergence on arbitrary unstructured meshes for the 10 classical TVD schemes. Copyright © 2015 John Wiley & Sons, Ltd.     

Acceleration on stretched meshes with line-implicit LU-SGS in parallel implementation

The implicit lower–upper symmetric Gauss–Seidel (LU-SGS) solver is combined with the line-implicit technique to improve convergence on the very anisotropic grids necessary for resolving the boundary layers. The computational fluid dynamics code used is Edge, a Navier–Stokes flow solver for unstructured grids based on a dual grid and edge-based formulation. Multigrid acceleration is applied with the intention to accelerate the convergence to steady state. LU-SGS works in parallel and gives better linear scaling with respect to the number of processors, than the explicit scheme. The ordering techniques investigated have shown that node numbering does influence the convergence and that the orderings from Delaunay and advancing front generation were among the best tested. 2D Reynolds-averaged Navier–Stokes computations have clearly shown the strong efficiency of our novel approach line-implicit LU-SGS which is four times faster than implicit LU-SGS and line-implicit Runge–Kutta. Implicit LU-SGS for Euler and line-implicit LU-SGS for Reynolds-averaged Navier–Stokes are at least twice faster than explicit and line-implicit Runge–Kutta, respectively, for 2D and 3D cases. For 3D Reynolds-averaged Navier–Stokes, multigrid did not accelerate the convergence and therefore may not be needed.     

Implicit symmetrized streamfunction formulations of magnetohydrodynamics

We apply the finite element method to the classic tilt instability problem of two‐dimensional, incompressible magnetohydrodynamics, using a streamfunction approach to enforce the divergence‐free conditions on the magnetic and velocity fields. We compare two formulations of the governing equations, the standard one based on streamfunctions and a hybrid formulation with velocities and magnetic field components. We use a finite element discretization on unstructured meshes and an implicit time discretization scheme. We use the PETSc library with index sets for parallelization. To solve the nonlinear problems on each time step, we compare two nonlinear Gauss‐Seidel‐type methods and Newton's method with several time‐step sizes. We use GMRES in PETSc with multigrid preconditioning to solve the linear subproblems within the nonlinear solvers. We also study the scalability of this simulation on a cluster. Copyright © 2008 John Wiley & Sons, Ltd.