2010
DOI: 10.4208/jcm.1004.m3172
|View full text |Cite
|
Sign up to set email alerts
|

A Coarsening Algorithm on Adaptive Grids by Newest Vertex Bisection and Its Applications

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 R 2. The 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 very efficient when applied for multilevel preconditioners and mesh adaptivity for time-dependent… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…It uses a beautiful data structure to represent the mesh and also provides efficient MATLAB subroutines to manipulate the mesh (e.g. see [10,1]). In particular, local refinement and coarsening can be done fairly easily.…”
Section: Numerical Testsmentioning
confidence: 99%
“…It uses a beautiful data structure to represent the mesh and also provides efficient MATLAB subroutines to manipulate the mesh (e.g. see [10,1]). In particular, local refinement and coarsening can be done fairly easily.…”
Section: Numerical Testsmentioning
confidence: 99%
“…Similar to the refinement criterion, a Dörfler criterion is defined for coarsening as well, with θ c as the user-defined coarsening parameter. The earlier created array that contains the information about the added nodes by bisection helps in identifying the nodes that are suitable for coarsening [37]. Hence we cannot coarsen below the initial number of elements that we start with.…”
Section: Adaptive Variational Formulationmentioning
confidence: 99%
“…Inspired by the coarsening algorithm in [9], we introduce new refinement/coarsening algorithms for quadrilateral meshes. Unlike the classical recursive refinement/coarsening procedures, the proposed algorithms are non-recursive and require neither storing nor maintaining refinement tree information such as the parents, brothers, generation, etc.…”
Section: An Adaptive Algorithm For Quadrilateral Meshesmentioning
confidence: 99%
“…Chen and Zhang [9] proposed a non recursive refinement/coarsening algorithm for triangular meshes which does not require storing the bisection tree explicitly. They only store coordinates of vertices and connectivity of triangles which are the minimal information required to represent a mesh for standard finite element computation.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation