Predicting turbulent flow in a staggered tube bundle

This paper presents the results of calculations performed for the turbulent, incompressible flow around a staggered array of tubes for which carefully obtained experimental results are available as part of an established ERCOFTAC-IAHR test case. The Reynolds-averaged Navier–Stokes equations are solved using a pressure-based finite volume algorithm, using collocated cell vertex store on an unstructured and adaptive mesh of tetrahedra. Turbulence closure is obtained with a truncated form of a low-Reynolds number k– model developed by Yang and Shih. The computational domain covers all seven rows of tubes used in the experimental study and periodic flow is allowed to develop naturally. The results of the computations are surprisingly good and compare favourably with results obtained by others using a wide range of alternative k– models for a single cylinder with periodic inflow and outflow boundaries on structured meshes.     

Considerations on the spring analogy

This paper presents an investigation on the spring analogy. The spring analogy serves for deformation in a moving boundary problem. First, two different kinds of springs are discussed: the vertex springs and the segment springs. The vertex spring analogy is originally used for smoothing a mesh after mesh generation or refinement. The segment spring analogy is used for deformation of the mesh in a moving boundary problem. The difference between the two methods lies in the equilibrium length of the springs. By means of an analogy to molecular theory, the two theories are generalized into a single theory that covers both. The usual choice of the stiffness of the spring is clarified by the mathematical analysis of a representative one‐dimensional configuration. The analysis shows that node collision is prevented when the stiffness is chosen as the inverse of the segment length. The observed similarity between elliptic grid generation and the spring analogy is also investigated. This investigation shows that both methods update the grid point position by a weighted average of the surrounding points in an iterative manner. The weighting functions enforce regularity of the mesh. Based on these considerations, several improvements on the spring analogy are developed. The principle of Saint Venant is circumvented by a boundary correction. The prevention of inversion of triangular elements is improved by semi‐torsional springs. The numerical results show the superiority of the segment spring analogy over the vertex one for a small rotation of an NACA0012 mesh. The boundary correction allows for large deformation of the mesh, where the standard spring analogy fails. The final test is performed on a Navier–Stokes mesh. This mesh contains high aspect ratio mesh cells near the boundary. Large deformation of this mesh shows that the semi‐torsional spring improvement is imperative to retain the validity of this mesh. Copyright © 2000 John Wiley & Sons, Ltd.     

四边形网格的削角细分

提出了一种四边形网格的削角细分方法(Corner-Cuttmg Subdivision Scheme).每细分一次,四边形网格数目增加为原来的两倍,两次细分结果相当于一次二分对偶细分(Binary Dual Subdivision)和一个旋转.细分算法采用线性细分加平滑的形式,具体地讲平滑是采用两次重复平均的方法,因此其生成曲面具有C1连续性.而且由于这种细分方法对网格几何操作简单,所得网格数据量增长相对缓慢,更适合于3D图像重构及网络传输等应用领域..     

Discontinuous Galerkin methods for the chemotaxis and haptotaxis models

In this work, first we formulate and compare three different discontinuous Interior Penalty Galerkin methods for the 2D Keller–Segel chemotaxis model. Keller–Segel chemotaxis model is the important starting step in the modeling of the real biological system. We show in the numerical tests that two of the proposed methods fail to give accurate, oscillation-free solutions.     

Further results on ultraconvergence derivative recovery for odd-order rectangular finite elements

For rectangular finite element, we give a superconvergence method by SPR technique based on the generalization of a new ultraconvergence record and the sharp Green function estimates, by which we prove that the derivative has ultra-convergence of order O(h ^k+3) (k ⩾ 3 being odd) and displacement has order of O(h ^k+4) (k ⩾ 4 being even) at the locally symmetry points.      

Weakly Admissible Meshes and Discrete Extremal Sets

We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, namely Approximate Fekete Points and Discrete Leja Points. These provide new computational tools for polynomial least squares and interpolation on multidimensional compact sets, with different applications such as numerical cubature, digital filtering, spectral and high-order methods for PDEs.     

曲率相关的爆轰波在非结构四边形网格上的数值方法

假设爆轰波阵面的法向速度是曲率的线性函数,在非结构四边形网格上采用水平集方法模拟爆轰波阵面的运动过程.水平集方程的曲率无关项采用正格式离散,曲率项采用伽辽金等参有限元方法空间离散,时间离散采用半隐格式.在笛卡儿网格和随机网格上,含曲率的水平集方程的离散格式为强一阶精度,重新初始化方程的离散格式精度为近似一阶精度.曲率收缩的不光滑界面和多个爆轰波阵面相互作用的算例说明格式可有效地模拟爆轰波与曲率相关的运动.     

Generalized Wall Functions for High-speed Separated Flows Over Adiabatic and Isothermal Walls

We present the extension of our wall-laws developed for low-speed flows to super-and hyper-sonic configurations. In particular, we are interested in flows over isothermal walls and in the modeling of heat transfer. We recall the main steps of the development:

?Obtaining generalized wall functions for low-speed fluids, valid for all y ⁺.

?Taking into account transversal effects in wall-laws.

?Accounting for the compressible feature of the flow on adiabatic walls without using information on the local boundary layer structure, for instance its thickness, but only using information available at the fictitious wall.

?Taking into account thermal effects on isothermal walls. In particular, the heat flux at the real wall is obtained by an a posteriori evaluation using information at the fictitious one.

?Only using information available on unstructured meshes and avoiding the information coming from a Cartesian hypothesis for the mesh in near-wall regions.

These ingredients are validated on hyper-sonic configurations on adiabatic and isothermal walls for expansion and compression ramps.     

三角形网格上多介质流动问题界面处理方法

多介质流动问题的求解一般是在结构网格上实现,而三角形网格对于复杂计算区域具有更好的适应性,本文结合rGFM方法,给出三角形网格上多介质流动问题界面处理方法.利用level-set方法跟踪界面,在界面处构造Riemann问题,得到界面处流体准确的流动状态.通过定义界面边界条件,将多介质流动问题转化为单介质流动问题,利用高精度RKDG方法求解.采用多个算例验证该方法的稳健性和有效性,结果表明该方法能准确捕捉界面和激波的位置,保持界面清晰.     

基于背景网格变形的动态网格移动方法

基于Delaunay背景网格插值技术的动态网格生成方法无需迭代计算,效率较高。但对复杂构形大幅运动的动边界问题,尤其当边界大幅转动时,背景网格极易交叉重叠。重新生成背景网格和重新定位网格节点信息不仅费时而且会导致网格质量的严重下降。本文提出改进的基于背景网格的动态网格变形方法,通过在初始Delaunay背景网格中添加辅助点,生成一层新的背景网格和新的映射关系;采用ball-vertex弹簧法驱动新背景网格的变形,进而牵动目标网格的变形。算例表明,本文提出的动态网格变形方法对所关心区域的网格具有良好保形性,边界可转动更大角度而不会出现网格交叉重叠问题,总体上提高了动态网格更新的效率和质量。