Math 2.0

Numerical analysis Definition

Extended finite element method

Builds on Finite element methodPartition of unityHeaviside step functionGalerkin method

Definition

Let 𝒯h\mathcal{T}_h be a mesh of a domain Ξ©βŠ‚β„d\Omega \subset \R^d with nodes xix_i, i∈Ii \in I. Let NiN_i be standard finite element shape functions with βˆ‘i∈INi=1\sum_{i \in I} N_i = 1 on Ξ©\Omega, a partition of unity. Let Οˆβ€‰β£:Ω→ℝ\psi \colon \Omega \to \R be an enrichment function that carries a known local feature of the solution. Let JβŠ†IJ \subseteq I be the set of nodes whose shape function support meets the region of that feature. The extended finite element method is the Galerkin method in the space of functions uh(x)=βˆ‘i∈INi(x) ui+βˆ‘j∈JNj(x)β€‰Οˆ(x) aj,u_h(x) = \sum_{i \in I} N_i(x) \, u_i + \sum_{j \in J} N_j(x) \, \psi(x) \, a_j, with unknown coefficients uiu_i and aja_j.

Remarks

The extra functions NjψN_j \psi have small support, so the system matrix stays sparse. If all aja_j equal one value aa, then on a region where βˆ‘j∈JNj=1\sum_{j \in J} N_j = 1 the enrichment equals aψa \psi exactly. Common choices of ψ\psi are a Heaviside function across a crack, and the singular functions of the crack tip, which behave like r\sqrt{r}. Often one uses the shifted form ψ(x)βˆ’Οˆ(xj)\psi(x) - \psi(x_j), so that uh(xi)=uiu_h(x_i) = u_i at the nodes.

Example: on Ξ©=(0,1)\Omega = (0, 1) with nodes xi=ihx_i = ih, let a crack sit at a point cc inside (xk,xk+1)(x_k, x_{k+1}). Take ψ(x)=H(xβˆ’c)\psi(x) = H(x - c), with HH the Heaviside step, and J={k,k+1}J = \set{k, k+1}. Then uhu_h can jump at cc by Nk(c)ak+Nk+1(c)ak+1N_k(c) a_k + N_{k+1}(c) a_{k+1}, while the mesh does not have a node at cc.

Non-example: the standard space with only the first sum is continuous on Ξ©\Omega. It has no enrichment, J=βˆ…J = \emptyset, so it cannot jump at cc unless cc is a mesh node and the mesh is split there.

Reading path

To understand this page from the ground up, read these 7 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. Function concept
  3. Galerkin method concept
  4. Partition of unity concept
  5. Laplace transform definition
  6. Heaviside step function object
  7. Extended finite element method definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Extended_finite_element_method
About this page
Tag35KXRGMAHT
URIm2://35KXRGMAHT
Kinddefinition
WritingW0 stub
MSC65N30, 74S05, 74R10
DefinesExtended finite element method
UsesFinite element method, Partition of unity, Heaviside step function, Galerkin method

Markdown Β· JSON Β· Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • 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.