Shape Function In Finite Element Method

Shape functions in the finite element method: the backbone of numerical simulation

In the finite element method (FEM), shape functions are the mathematical expressions that interpolate the solution within each element. But they translate the nodal values—known or unknown quantities at the element’s corners—into a continuous field that approximates the true physical behavior. Even so, understanding shape functions is essential because they determine the accuracy, convergence, and computational efficiency of FEM analyses across engineering, physics, and applied mathematics. This article explores the concept of shape functions, their derivation, properties, and practical use in real‑world problems.

Introduction

When solving partial differential equations (PDEs) analytically, one often encounters complex geometries or boundary conditions that defy closed‑form solutions. That said, fEM circumvents this by discretizing the domain into a mesh of simple elements (triangles, quadrilaterals, tetrahedra, etc. Worth adding: ) and approximating the unknown field with local polynomial functions. These local polynomials are the shape functions.

Interpolation – they reconstruct the field inside an element from nodal values.
Variational formulation – they appear in the weighted residual integrals that produce the element stiffness matrix and force vector.

Because shape functions are defined locally, they are easy to assemble into a global system while preserving continuity across element boundaries (for conforming elements). The choice of shape functions directly influences the order of accuracy and the computational cost.

Fundamental Properties of Shape Functions

A valid set of shape functions ( {N_i(\mathbf{x})} ) for an element must satisfy several key properties:

Property	Description	Typical Symbol
Partition of Unity	(\displaystyle \sum_{i=1}^{n} N_i(\mathbf{x}) = 1) for all points (\mathbf{x}) in the element. So	( N_i(\mathbf{x}j) = \delta{ij} )
Polynomial Order	The shape functions are polynomials of a chosen degree (p).	( \sum N_i = 1 )
Kronecker Delta Property	( N_i(\mathbf{x}j) = \delta{ij}), meaning each shape function equals one at its own node and zero at all others.	( N_i \in \mathbb{P}_p )
Continuity	For conforming FEM, shape functions are at least (C^0) continuous across element interfaces.

These conditions guarantee that the interpolated field is continuous and that the nodal values are correctly represented.

Deriving Shape Functions for Common Elements

1. Linear Triangular Element (2D)

For a triangle with nodes at ((x_1,y_1)), ((x_2,y_2)), ((x_3,y_3)), the linear shape functions are:

[ N_i(x,y) = a_i + b_i x + c_i y, \quad i=1,2,3 ]

where the coefficients are obtained from the element’s area (A):

[ \begin{aligned} a_i &= \frac{1}{2A}\bigl( x_{j}y_{k} - x_{k}y_{j} \bigr),\ b_i &= \frac{1}{2A}\bigl( y_{j} - y_{k} \bigr),\ c_i &= \frac{1}{2A}\bigl( x_{k} - x_{j} \bigr), \end{aligned} ]

with ((i,j,k)) being a cyclic permutation of ((1,2,3)). These shape functions satisfy the Kronecker delta property and are linear across the element.

2. Quadratic Quadrilateral Element (2D)

A bilinear quadrilateral with four corner nodes and four edge mid‑nodes uses shape functions of the form:

[ N_i(\xi,\eta) = \frac{1}{4}(1 + \xi_i \xi)(1 + \eta_i \eta)(\xi_i \xi + \eta_i \eta - 1), ]

where ((\xi,\eta)) are natural coordinates ranging from (-1) to (1), and (\xi_i,\eta_i) are the natural coordinates of node (i). This construction ensures continuity and higher accuracy compared to linear elements.

3. Higher‑Order Elements

For cubic or higher‑order elements, the shape functions are constructed similarly but involve higher‑degree polynomials. In practice, they are often generated automatically by software using Lagrange polynomials or hierarchical bases.

Shape Functions in the Galerkin Method

The Galerkin method, the most common variational formulation in FEM, seeks an approximate solution (u_h(\mathbf{x})) as:

[ u_h(\mathbf{x}) = \sum_{i=1}^{n} N_i(\mathbf{x}), u_i, ]

where (u_i) are the unknown nodal values. Substituting (u_h) into the weak form of the governing PDE and choosing test functions equal to the shape functions leads to a system of algebraic equations:

[ \mathbf{K}\mathbf{u} = \mathbf{f}, ]

where the element stiffness matrix (\mathbf{K}^{(e)}) has entries

[ K_{ij}^{(e)} = \int_{\Omega_e} \nabla N_i \cdot \mathbf{D}, \nabla N_j , d\Omega, ]

and (\mathbf{D}) is the material property tensor (e.g.Here's the thing — , conductivity, elasticity). The shape functions’ derivatives (\nabla N_i) appear explicitly, emphasizing why their smoothness and polynomial order matter for accurate integration.

Continue exploring with our guides on why are merchandising accounts closed and why is second ionization energy greater than first.

Choosing the Right Shape Functions

Accuracy vs. Cost

Linear elements are cheap but may require a fine mesh to capture curvature or gradients.
Quadratic or cubic elements provide higher accuracy for the same number of nodes, especially in problems with smooth solutions.
Mixed‑order elements (e.g., linear for pressure, quadratic for velocity in fluid dynamics) balance accuracy and computational load.

Compatibility with Boundary Conditions

Essential (Dirichlet) boundaries: Shape functions must be able to enforce prescribed nodal values directly, which is straightforward with Lagrange basis functions.
Natural (Neumann) boundaries: Shape functions’ derivatives are used; higher‑order derivatives may be needed for problems involving curvature or higher‑order PDEs.

Mesh Quality

Poorly shaped elements (e.Think about it: g. Which means , highly skewed triangles) can degrade the conditioning of the stiffness matrix. Shape functions derived in natural coordinates help mitigate this by normalizing the element geometry.

Common Pitfalls and How to Avoid Them

Using incompatible shape functions across adjacent elements
Solution: check that elements share the same interpolation order or use hierarchical bases that can adapt to varying orders.
Ignoring the partition of unity
Solution: Verify that the sum of shape functions equals one analytically or numerically.
Over‑refining the mesh without adjusting the polynomial order
Solution: Apply p‑refinement (increasing polynomial order) or hp‑refinement (combining h‑ and p‑refinement) strategically.
Neglecting numerical integration errors
Solution: Use Gaussian quadrature rules of sufficient order to integrate the product of shape functions accurately.

Practical Example: 1‑D Bar Under Axial Load

Consider a uniform bar of length (L) subjected to an axial force (F). The governing equation is

[ -\frac{d}{dx}!\left( EA \frac{du}{dx} \right) = 0, ]

with (E) the Young’s modulus and (A) the cross‑sectional area. Using linear shape functions on a single element:

[ N_1(x) = 1 - \frac{x}{L}, \quad N_2(x) = \frac{x}{L}, ]

the displacement approximation is

[ u_h(x) = N_1(x) u_1 + N_2(x) u_2. ]

The element stiffness matrix becomes

[ K^{(e)} = \frac{EA}{L} \begin{bmatrix} 1 & -1\ -1 & 1 \end{bmatrix}, ]

and the load vector accounts for boundary forces. This simple derivation showcases how shape functions directly generate the system matrix.

Frequently Asked Questions

Question	Answer
What is the difference between Lagrange and hierarchical shape functions?	Lagrange functions are defined by nodal values and are convenient for standard FEM. Hierarchical functions allow local refinement by adding higher‑order terms without altering lower‑order nodes, useful in hp-adaptive methods. That said,
Can shape functions be non‑polynomial?	Yes. Take this: spectral element methods use trigonometric or Chebyshev polynomials. Still, polynomial shape functions remain the most common due to simplicity. Think about it:
Do shape functions guarantee convergence?	Provided the mesh is refined appropriately and the chosen polynomial order satisfies the problem’s regularity, the FEM solution converges to the exact solution.
How do I choose the natural coordinates for a tetrahedral element?	Use barycentric coordinates ((\xi,\eta,\zeta)) that sum to one, mapping the tetrahedron’s vertices to ((1,0,0,0)), ((0,1,0,0)), etc.

Conclusion

Shape functions are the linchpin of the finite element method. Here's the thing — they bridge the discrete nodal representation and the continuous physical field, enabling the assembly of accurate, efficient, and versatile numerical models. Think about it: mastering their definition, properties, and application empowers engineers and scientists to tackle complex PDEs across disciplines—from structural mechanics to electromagnetics and beyond. By selecting appropriate shape functions and understanding their mathematical foundations, one ensures that FEM analyses are not only computationally feasible but also trustworthy and insightful.