A COARSENING ALGORITHM ON ADAPTIVE GRIDS BY NEWEST VERTEX BISECTION AND ITS APPLICATIONS

被引:34
作者
Chen, Long [1 ]
Zhang, Chensong [2 ]
机构
[1] Univ Calif Irvine, Dept Math, Irvine, CA 92697 USA
[2] Penn State Univ, Dept Math, University Pk, PA 16802 USA
关键词
Adaptive finite element method; Coarsening; Newest vertex bisection; Multilevel preconditioning; FINITE-ELEMENT-METHOD; POSTERIORI ERROR ESTIMATION; LINEAR PARABOLIC PROBLEMS; ELLIPTIC RECONSTRUCTION; ITERATIVE METHODS; REFINEMENT; PRECONDITIONERS; EQUATIONS; SPACES;
D O I
10.4208/jcm.1004-m3172
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, an efficient and easy-to-implement coarsening algorithm is proposed for adaptive grids obtained using the newest vertex bisection method in two dimemsions. The new coarsening algorithm does not require storing the binary refinement tree explicitly. Instead, the structure is implicitly contained in a special ordering of triangular elements. Numerical experiments demonstrate that the proposed coarsening algorithm is efficient when applied for multilevel preconditioners and mesh adaptivity for time-dependent problems.
引用
收藏
页码:767 / 789
页数:23
相关论文
共 36 条