An algorithm for adaptive mesh refinement in \(n\) dimensions (Q1377291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1112337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for adaptive mesh refinement in \(n\) dimensions |
scientific article; zbMATH DE number 1112337 |
Statements
An algorithm for adaptive mesh refinement in \(n\) dimensions (English)
0 references
14 September 2000
0 references
This paper deals with local adaptive mesh refinement in \(n\) dimensions in the context of finite element calculations. The given fast algorithm is based on simplex bisection which simplifies bookkeeping of the neighbour graph. A program in C++ is also presented. Notice that bisection refinement leads to certain restrictions on the initial, coarsest grid. The author formulates and proves a criterion for the applicability of the described mesh refinement procedure.
0 references
mesh generation
0 references
simplex bisection
0 references
mesh refinement
0 references
finite elements
0 references
0.8603758811950684
0 references
0.8377018570899963
0 references
0.8343583941459656
0 references
0.832729160785675
0 references
0.8185815215110779
0 references
