首页> 外文OA文献 >Turbulent flow computations on a hybrid cartesian point distribution using meshless solver LSFD-U
【2h】

Turbulent flow computations on a hybrid cartesian point distribution using meshless solver LSFD-U

机译:使用无网格求解器LSFD-U在混合笛卡尔点分布上进行湍流计算

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper may be considered as a sequel to one of our earlier works pertaining to the development of an upwind algorithm for meshless solvers. While the earlier work dealt with the development of an inviscid solution procedure, the present work focuses on its extension to viscous flows. A robust viscous discretization strategy is chosen based on positivity of a discrete Laplacian. This work projects meshless solver as a viable cartesian grid methodology. The point distribution required for the meshless solver is obtained from a hybrid cartesian gridding strategy. Particularly considering the importance of an hybrid cartesian mesh for RANS computations, the difficulties encountered in a conventional least squares based discretization strategy are highlighted. In this context, importance of discretization strategies which exploit the local structure in the grid is presented, along with a suitable point sorting strategy. Of particular interest is the proposed discretization strategies (both inviscid and viscous) within the structured grid block; a rotated update for the inviscid part and a Green-Gauss procedure based positive update for the viscous part. Both these procedures conveniently avoid the ill-conditioning associated with a conventional least squares procedure in the critical region of structured grid block. The robustness and accuracy of such a strategy is demonstrated on a number of standard test cases including a case of a multi-element airfoil. The computational efficiency of the proposed meshless solver is also demonstrated. (C) 2010 Elsevier Ltd. All rights reserved.
机译:本文可能被视为我们有关无网格求解器逆风算法开发的早期工作的续篇。尽管较早的工作涉及无粘性解决程序的开发,但当前的工作重点是将其扩展到粘性流。基于离散拉普拉斯算子的正性,选择了鲁棒的粘性离散化策略。这项工作将无网格求解器投影为一种可行的笛卡尔网格方法。无网格求解器所需的点分布是从混合笛卡尔网格化策略中获得的。特别是考虑到混合笛卡尔网格对于RANS计算的重要性,突出了在传统的基于最小二乘法的离散化策略中遇到的困难。在这种情况下,提出了利用网格局部结构的离散化策略的重要性以及合适的点排序策略。特别令人感兴趣的是在结构化网格块内提出的离散化策略(无粘性和粘性);对粘性部分进行轮换更新,对粘性部分进行基于绿色高斯程序的正更新。这两个过程都方便地避免了在结构化网格块的关键区域中与常规最小二乘法相关的不良情况。这种策略的鲁棒性和准确性在包括多翼型机翼的情况在内的许多标准测试案例中得到了证明。还证明了所提出的无网格求解器的计算效率。 (C)2010 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号