Adaptive mesh refinement
Builds on Finite element method
Definition
Let be an initial mesh of a domain , and fix a discretization such as the finite element method. Let an error indicator assign a number to each element of each mesh . Adaptive mesh refinement builds meshes by repeating four steps for :
- Solve: compute the discrete solution on .
- Estimate: compute for all from and the data.
- Mark: choose a set of elements with large indicators.
- Refine: subdivide at least the elements of , plus the neighbours needed to keep the mesh conforming, to get .
The loop stops when is below a tolerance.
Remarks
A common marking rule is the DΓΆrfler criterion with a parameter . It takes a set of minimal size with . For the Poisson equation, a standard residual indicator combines with the jumps of the normal derivative of across the faces of .
Example: on the L-shaped domain , the solution of with boundary values is in polar coordinates with . Its gradient blows up at the corner , the indicators are largest there, and the meshes become graded towards .
Non-example: uniform refinement subdivides every element of in each step. Its refinement does not depend on any indicator, so step 3 is missing.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Finite element method concept
- Adaptive mesh refinement definition
Further reading
About this page
| Tag | C5JM6D0841 |
|---|---|
| URI | m2://C5JM6D0841 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65N50, 65M50 |
| Defines | Adaptive mesh refinement |
| Uses | Finite element method |
Markdown Β· JSON Β· Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.