An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

Fluid‐structure coupling of linear elastic model with compressible flow models

Cavitation erosion is caused in solids exposed to strong pressure waves developing in an adjacent fluid field. The knowledge of the transient distribution of stresses in the solid is important to understand the cause of damaging by comparisons with breaking points of the material. The modeling of this problem requires the coupling of the models for the fluid and the solid. For this purpose, we use a strategy based on the solution of coupled Riemann problems that has been originally developed for the coupling of 2 fluids. This concept is exemplified for the coupling of a linear elastic structure with an ideal gas. The coupling procedure relies on the solution of a nonlinear equation. Existence and uniqueness of the solution is proven. The coupling conditions are validated by means of quasi‐1D problems for which an explicit solution can be determined. For a more realistic scenario, a 2D application is considered where in a compressible single fluid, a hot gas bubble at low pressure collapses in a cold gas at high pressure near an adjacent structure.     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

A possible counterexample to well posedness of entropy solutions and to Godunov scheme convergence

A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.

     

Momentum transport and torque scaling in Taylor-Couette flow from an analogy with turbulent convection

We generalize an analogy between rotating and stratified shear flows. This analogy is summarized in Table 1. We use this analogy in the unstable case (centrifugally unstable flow vs. convection) to compute the torque in Taylor-Couette configuration, as a function of the Reynolds number. At low Reynolds numbers, when most of the dissipation comes from the mean flow, we predict that the non-dimensional torque G = T/ν² L, where L is the cylinder length, scales with Reynolds number R and gap width η, G = 1.46η^3/2(1 - η)^-7/4 R ^3/2. At larger Reynolds number, velocity fluctuations become non-negligible in the dissipation. In these regimes, there is no exact power law dependence the torque versus Reynolds. Instead, we obtain logarithmic corrections to the classical ultra-hard (exponent 2) regimes: G = 0.50 . These predictions are found to be in excellent agreement with avail-able experimental data. Predictions for scaling of velocity fluctuations are also provided. Received 7 June 2001 and Received in final form 7 December 2001     

A stability of the steady flow of compressible viscous fluid with respect to initial disturbance (v∞ ≠ 0)

We consider a compressible viscous fluid with the velocity at infinity equal to a strictly non‐zero constant vector in ?³. Under the assumptions on the smallness of the external force and velocity at infinity, Novotny–Padula (Math. Ann. 1997; 308 :439– 489) proved the existence and uniqueness of steady flow in the class of functions possessing some pointwise decay. In this paper, we study stability of the steady flow with respect to the initial disturbance. We proved that if H³‐norm of the initial disturbance is small enough, then the solution to the non‐stationary problem exists uniquely and globally in time, which satisfies a uniform estimate on prescribed velocity at infinity and converges to the steady flow in L_q‐norm for any number q? 2. Copyright © 2006 John Wiley & Sons, Ltd.     

机翼大攻角下失速颤振的气动弹性研究

本文采用流固耦合的数值方法研究了机翼在0°～50°攻角下的颤振。计算结果表明,随着来流攻角α0的增大,机翼的固有频率对颤振的影响越来越大,颤振由线性的强迫振动逐渐发展成为非线性的自激振动,而当α0增加到一定程度以后,大尺度分离流交替地从机翼头部和尾部产生,机翼和流场会发生共振,引起机翼的失速颤振。     

1+1/2对转涡轮叶排轴向间距对性能影响的研究

木文对1+1/2对转涡轮中轴向间距影响进行了初步研究。对不同轴向间距叶栅流场进行了大量时间精确模拟。研究表明,1+1/2对转涡轮高低压转叶间轴向间距成为追求高效率的制约因素,轴向间距为高压转叶喉部宽度是关键点。因此有关小轴向间距下强激波/叶排干扰的研究应该加强。     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.