...
首页> 外文期刊>Applied mathematics and computation >Towards a more efficient dynamic mesh adaptation methodology for continuum discretization in complex engineering problems
【24h】

Towards a more efficient dynamic mesh adaptation methodology for continuum discretization in complex engineering problems

机译:寻求一种更有效的动态网格自适应方法,用于复杂工程问题中的连续离散化

获取原文
获取原文并翻译 | 示例
           

摘要

A novel and efficient method of adaptive mesh generation, for dynamically adaptive unstructured grids, is proposed. A locally refined triangulation is constructed on a coarse background mesh, subdividing each triangle in the refinement region R into four congruent sub-triangles iteratively, by connecting edge midpoints, until triangles of a prescribed length-scale are obtained. The unavoidable propagation outside the refinement region R is restricted to a single triangle in the coarse background mesh. The triangles, in the immediate vicinity of region R, are broken down using the concept of iterated function systems, widely used in fractal modeling, by recursive generation of sub-triangles with a gradation towards the region R triangles. A quantitative assessment of the present algorithm proves its superiority over other comparable models reported in the literature. The time cost of the algorithm is linear, and the method can be easily extended to three dimensions. (c) 2006 Elsevier Inc. All rights reserved.
机译:提出了一种新颖有效的自适应网格生成方法,用于动态自适应非结构​​化网格。在粗糙的背景网格上构建局部精化的三角剖分,通过连接边缘中点,迭代地将精化区域R中的每个三角形细分为四个相等的子三角形,直到获得指定长度比例的三角形。细化区域R外部不可避免的传播被限制在粗糙背景网格中的单个三角形中。通过递归生成具有朝向区域R三角形的渐变的子三角形,使用在分形建模中广泛使用的迭代函数系统的概念将紧邻区域R的三角形分解。本算法的定量评估证明了其优于文献中报道的其他可比模型的优势。该算法的时间成本是线性的,该方法可以轻松扩展到三个维度。 (c)2006 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号