首页> 外文会议>ASME/JSME Joint Fluids Engineering Conference >IMPROVEMENT OF SEARCHING NODES ARITHMETIC IN MESHFREE METHOD
【24h】

IMPROVEMENT OF SEARCHING NODES ARITHMETIC IN MESHFREE METHOD

机译:网格法中搜索节点算法的改进

获取原文

摘要

In numerical simulation with meshfree method, it is necessary to search nodes that are needed. In dealing with complex problems, there must be a great number of nodes distributed in computational domain. If a conventional Node-Searching method is used here, it will be a burdensome task for the computer. So this paper proposes a new numerical arithmetic, Domain-Dividing method, which means that the domain can be divided into several subdomains. With this method, we can search only those corresponding subdomains instead of the entire domain for nodes. This paper adopts the Node-Searching arithmetic to simulate the inviscid potential flow over a cylinder, and it is found that with the increase of the nodes in domain, the computational time of meshfree method is increasingly longer than that of finite element method, but compared with meshfree method using conventional Node-Searching method, the arithmetic proposed in this paper can reduce much more time for searching nodes.
机译:在具有MeshFree方法的数值模拟中,有必要搜索所需的节点。在处理复杂问题时,必须有大量的计算域中分布。如果此处使用传统的节点搜索方法,则它将是计算机的负担任务。因此,本文提出了一种新的数值算术,域分割方法,这意味着域可以分为几个子域。使用此方法,我们只能搜索那些相应的子域而不是用于节点的整个域。本文采用节点搜索算法来模拟圆柱体上的不合宽度电位流动,并发现随着域中的节点的增加,网格射程方法的计算时间越来越长于有限元方法,但比较利用传统节点搜索方法的网格纤维法,本文提出的算术可以减少更多时间来搜索节点。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号