Year: 2010
Journal of Computational Mathematics, Vol. 28 (2010), Iss. 6 : pp. 767–789
Abstract
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 dimensions. 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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/jcm.1004-m3172
Journal of Computational Mathematics, Vol. 28 (2010), Iss. 6 : pp. 767–789
Published online: 2010-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 23
Keywords: Adaptive finite element method Coarsening Newest vertex bisection Multilevel preconditioning.