.png){kind=icon}
返回
An algorithm for adaptive mesh refinement in n dimensions
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02684475.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The author describes a fast algorithm for local adaptive mesh refinement in n dimensions based on simplex bisection. A ready-to-use implementation of the algorithm in C++ pseudocode is given. It is proven that the scheme satisfies all conditions one usually places on grid refinement in the context of finite-element calculations. Bisection refinement also offers an interesting additional feature over the usual, regular, refinement scheme: all linear finite-element basis functions of one generation are of disjoint support. In the way the scheme is presented here, all generated simplex meshes satisfy a 'structural condition' which is exploited to simplify bookkeeping of the neighbour graph. However, bisection refinement places certain restrictions on the initial, coarsest grid. For a simply connected domain, a precise and useful criterion for the applicability of the described refinement scheme is formulated and proven.
Keyword:
mesh generation
bisection
refinement
finite elements
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
暂无机构信息
引用论文
.png){kind=icon}
Numerical Analysis of Porpoising Stability Limit of a Blended-Wing–Body Aircraft During Ditching
PREAI
分享收藏 没有更多内容
没有更多内容