Math 2.0

Numerical analysis Definition

Adaptive mesh refinement

Builds on Finite element method

Definition

Let 𝒯0\mathcal{T}_0 be an initial mesh of a domain Ξ©\Omega, and fix a discretization such as the finite element method. Let an error indicator assign a number Ξ·K(𝒯)β‰₯0\eta_K(\mathcal{T}) \ge 0 to each element KK of each mesh 𝒯\mathcal{T}. Adaptive mesh refinement builds meshes 𝒯0,𝒯1,…\mathcal{T}_0, \mathcal{T}_1, \ldots by repeating four steps for β„“=0,1,…\ell = 0, 1, \ldots:

  1. Solve: compute the discrete solution uβ„“u_\ell on 𝒯ℓ\mathcal{T}_\ell.
  2. Estimate: compute Ξ·K=Ξ·K(𝒯ℓ)\eta_K = \eta_K(\mathcal{T}_\ell) for all Kβˆˆπ’―β„“K \in \mathcal{T}_\ell from uβ„“u_\ell and the data.
  3. Mark: choose a set β„³β„“βŠ†π’―β„“\mathcal{M}_\ell \subseteq \mathcal{T}_\ell of elements with large indicators.
  4. Refine: subdivide at least the elements of β„³β„“\mathcal{M}_\ell, plus the neighbours needed to keep the mesh conforming, to get 𝒯ℓ+1\mathcal{T}_{\ell + 1}.

The loop stops when (βˆ‘KΞ·K2)1/2\big(\sum_K \eta_K^2\big)^{1/2} is below a tolerance.

Remarks

A common marking rule is the DΓΆrfler criterion with a parameter 0<θ≀10 < \theta \le 1. It takes a set β„³β„“\mathcal{M}_\ell of minimal size with βˆ‘Kβˆˆβ„³β„“Ξ·K2β‰₯ΞΈβˆ‘Kβˆˆπ’―β„“Ξ·K2\sum_{K \in \mathcal{M}_\ell} \eta_K^2 \ge \theta \sum_{K \in \mathcal{T}_\ell} \eta_K^2. For the Poisson equation, a standard residual indicator combines hK2βˆ₯f+Ξ”uβ„“βˆ₯L2(K)2h_K^2 \norm{f + \Delta u_\ell}_{L^2(K)}^2 with the jumps of the normal derivative of uβ„“u_\ell across the faces of KK.

Example: on the L-shaped domain (βˆ’1,1)2βˆ–[0,1)Γ—(βˆ’1,0](-1, 1)^2 \setminus [0, 1) \times (-1, 0], the solution of βˆ’Ξ”u=0-\Delta u = 0 with boundary values r2/3sin⁑(2Ο†/3)r^{2/3} \sin(2\varphi/3) is u=r2/3sin⁑(2Ο†/3)u = r^{2/3} \sin(2\varphi/3) in polar coordinates (r,Ο†)(r, \varphi) with 0<Ο†<3Ο€/20 < \varphi < 3\pi/2. Its gradient blows up at the corner 00, the indicators are largest there, and the meshes become graded towards 00.

Non-example: uniform refinement subdivides every element of 𝒯ℓ\mathcal{T}_\ell 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Finite element method concept
  2. Adaptive mesh refinement definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Adaptive_mesh_refinement
About this page
TagC5JM6D0841
URIm2://C5JM6D0841
Kinddefinition
WritingW0 stub
MSC65N50, 65M50
DefinesAdaptive mesh refinement
UsesFinite 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.