论文标题
自适应红绿色蓝色精制网格上的粗化算法
A Coarsening Algorithm on Adaptive Red-Green-Blue Refined Meshes
论文作者
论文摘要
自适应网格划分是自适应有限元方法的基本组成部分。这包括当地的精炼和粗糙网格。在这项工作中，我们关注的是在二维中的红绿色蓝色改进策略及其同行 - 粗糙。通常，粗化算法主要基于明确给出的改进历史。在这项工作中，我们提出了一种关于自适应红绿色蓝色网格在两个维度上的粗糙算法，而无需明确了解改进历史。为此，我们检查了这些网格的局部结构，找到一个易于验证的标准以适应性的红色绿色蓝色网格，并证明该标准与所需的属性产生了网格。我们提出了MATLAB实现，建立在AmeshRef包装的红绿蓝色改进程序上。
Adaptive meshing is a fundamental component of adaptive finite element methods. This includes refining and coarsening meshes locally. In this work, we are concerned with the red-green-blue refinement strategy in two dimensions and its counterpart - coarsening. In general, coarsening algorithms are mostly based on an explicitly given refinement history. In this work, we present a coarsening algorithm on adaptive red-green-blue meshes in two dimensions without explicitly knowing the refinement history. To this end, we examine the local structure of these meshes, find an easy-to-verify criterion to adaptively coarsen red-green-blue meshes and prove that this criterion generates meshes with the desired properties. We present a MATLAB implementation built on the red-green-blue refinement routine of the ameshref-package.
