Computations of two passing‐by high‐speed trains by a relaxation overset‐grid algorithm

This paper presents a relaxation algorithm, which is based on the overset grid technology, an unsteady three‐dimensional Navier–Stokes flow solver, and an inner‐ and outer‐relaxation method, for simulation of the unsteady flows of moving high‐speed trains. The flow solutions on the overlapped grids can be accurately updated by introducing a grid tracking technique and the inner‐ and outer‐relaxation method. To evaluate the capability and solution accuracy of the present algorithm, the computational static pressure distribution of a single stationary TGV high‐speed train inside a long tunnel is investigated numerically, and is compared with the experimental data from low‐speed wind tunnel test. Further, the unsteady flows of two TGV high‐speed trains passing by each other inside a long tunnel and at the tunnel entrance are simulated. A series of time histories of pressure distributions and aerodynamic loads acting on the train and tunnel surfaces are depicted for detailed discussions. Copyright © 2004 John Wiley & Sons, Ltd.     

Maximum norm stability of difference schemes for parabolic equations on overset nonmatching space-time grids

In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain which is decomposed into an overlapping collection of cylindrical subregions of the form , for . Each of the space-time domains are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters and . In particular, the different space-time grids need not match on the regions of overlap, and the time steps can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit -scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.

Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.

     

A Coupling Framework for Multi-Domain Modelling and Multi-Physics Simulations

This paper describes a coupling framework for parallel execution of different solvers for multi-physics and multi-domain simulations with an arbitrary number of adjacent zones connected by different physical or overlapping interfaces. The coupling architecture is based on the execution of several instances of the same coupling code and relies on the use of smart edges (i.e., separate processes) dedicated to managing the exchange of information between two adjacent regions. The collection of solvers and coupling sessions forms a flexible and modular system, where the data exchange is handled by independent servers that are dedicated to a single interface connecting two solvers’ sessions. Accuracy and performance of the strategy is considered for turbomachinery applications involving Conjugate Heat Transfer (CHT) analysis and Sliding Plane (SP) interfaces.     

Computations of wall distances by solving a transport equation

Computations of wall distances still play a key role in modern turbulence modeling. Motivated by the expense involved in the computation, an approach solving partial differential equations is considered. An Euler-like transport equation is proposed based on the Eikonal equation. Thus, the efficient algorithms and code components developed for solving transport equations such as Euler and Navier-Stokes equations can be reused. This article provides a detailed implementation of the transport equation in the Cartesian coordinates based on the code of computational fluid dynamics for missiles (MICFD) of Beihang University. The transport equation is robust and rapidly convergent by the implicit lower-upper symmetric Gauss-Seidel (LUSGS) time advancement and upwind spatial discretization. Geometric derivatives must also be upwind determined to ensure accuracy. Special treatments on initial and boundary conditions are discussed. This distance solving approach is successfully applied on several complex geometries with 1-1 blocking or overset grids.     

货运动车组装载门凹陷对隧道内会车压力波的影响

随着我国技术经济水平的提高,电子商务产业快速发展,货运动车组应运而生。采用有限体积方法和重叠网格方法,以及SST k-ω高雷诺数湍流模型,数值模拟研究时速350 km的货运动车组在隧道内交会的压力波,探究货运动车组车体结构即装载门凹陷对隧道内交会压力波的影响。实车试验结果验证了本文数值模拟方法的准确性。研究结果表明,凹陷的装载门使平直车身处的最大正压值增大约20%~30%,且有无凹陷的装载门中心最大正压值的差异百分比维持在35%~80%,最大负压值差异百分比在20%~25%。     

用鲁棒Riemann求解器和运动重叠网格计算旋翼粘性绕流

发展了一种基于鲁棒Riemann求解器和运动重叠网格技术计算直升机悬停旋翼流场的方法。基于惯性坐标系,悬停旋翼流场是非定常流场,控制方程为可压缩Reynolds平均Navier-Stoke方程,其对流项采用Roe近似Reimann求解器离散,使用改进的五阶加权基本无振荡格式进行高阶重构,非定常时间推进采用含牛顿型LUSGS子迭代的全隐式双时间步方法。为实施旋转运动和便于捕捉尾迹,计算采用运动重叠网格技术。计算得到的桨叶表面压力分布及桨尖涡涡核位置都与实验结果吻合较好。数值结果表明:所发展方法对桨尖涡具有较高的分辨率,对激波具有较好的捕捉能力,该方法可进一步推广到前飞旋翼粘性绕流的计算。     

旋转射弹高速倾斜入水多相流场与弹道数值模拟

基于VOF多相流模型和有限体积法求解水、汽、气多相流动的RANS方程,结合重叠网格技术和six DOF算法对某一型号舰载射弹倾斜入水过程进行数值模拟研究。首先基于该方法研究了射弹旋转效应对射弹运动特性及流体动力特性的影响,然后对不同入水角下倾斜入水过程进行分析,得到不同倾角下旋转射弹入水空泡形态发展规律、弹体运动特征及流体动力特性变化规律。研究结果表明：射弹的旋转有利于弹体在初始对称面内的弹道稳定性,但会降低弹体侧向稳定性,使射弹受到的阻力系数、俯仰力矩系数变小;入水角越小,形成的空泡越不对称,由射弹运动状态的改变引起的空泡形态变化越明显,在超空泡航行阶段,弹体运动较稳定,不同角度下流体动力系数差别很小,当弹体下表面刺破空泡壁沾湿时,弹体运动状态发生较大变化,流体动力系数迅速增大,此时入水角度过小,弹体容易失稳;弹体的沾湿对空泡形态、弹体运动稳定性和流体动力特性有着重要的影响。

     

CFD computations of NAL experimental airplane with rocket booster using overset unstructured grids

Flows around the NAL jet‐powered experimental airplane with a small rocket booster under the fuselage are computed by solving the Euler equations using the overset unstructured grid method. The main objective of the present study is to evaluate the effect of a small rocket booster, which accelerates the airplane to supersonic speed, on the aerodynamic performance of the airplane during the ascent flight and the booster separation. Two unstructured meshes, one for the airplane and one for the booster, overlap. For the accurate separation simulation, the two bodies are in contact at first, and then the booster mesh is contact mesh is moved relative to the airplane mesh to evaluate flow interactions between two bodies. Copyright © 2005 John Wiley & Sons, Ltd.     

全附体ONRT船模在波浪中自航的数值模拟

采用基于重叠网格技术的CFD方法数值研究了全附体ONRT船模在迎浪工况中自航的水动力特性.文中数值计算采用自主开发的面向船舶与海洋工程的CFD求解器naoe-FOAM-SJTU.自航计算中船体运动及螺旋桨转动等通过重叠网格技术完成,波浪环境则采用求解器中的三维数值造波和消波模块实现.计算中自航船模的螺旋桨转速通过静水自航数值计算得出,波浪工况计算采用东京2015 CFD会议中标准算例进行设置.数值计算结果,如船体运动、实时航速变化等,与试验数据进行了对比分析.此外,给出了数值预报的推力和扭矩系数,并且通过详细的流场信息来分析和解释了船模在波浪中自航过程中的水动力变化情况.数值预报结果同试验值吻合较好,说明采用当前结合重叠网格技术和CFD的数值方法可以很好地预报波浪中自航问题.     

Computations of wall distances by solving a transport equation

Computations of wall distances still play a key role in modern turbulence modeling. Motivated by the expense involved in the computation, an approach solving partial differential equations is considered. An Euler-like transport equation is proposed based on the Eikonal equation. Thus, the efficient algorithms and code components developed for solving transport equations such as Euler and Navier-Stokes equations can be reused. This article provides a detailed implementation of the transport equation in the Cartesian coordinates based on the code of computational fluid dynamics for missiles (MICFD) of Beihang University. The transport equation is robust and rapidly convergent by the implicit lower-upper symmetric Gauss-Seidel (LUSGS) time advancement and upwind spatial discretization. Geometric derivatives must also be upwind determined to ensure accuracy. Special treatments on initial and boundary conditions are discussed. This distance solving approach is successfully applied on several complex geometries with 1–1 blocking or overset grids.