Bilinear square finite element 2026-10-31
A bilinear square finite element uses polynomials of degree at most one separately in each coordinate and takes values at the four corners as degrees of freedom. On the unit square its nodal shape functions are , , , and , in anticlockwise corner order. Each is a tensor product of one-dimensional linear shape functions. A function in this space need not be affine, since has total degree two. On a physical square of side , its Laplacian stiffness matrix has diagonal entries , adjacent-corner entries and opposite-corner entries . Its Robin boundary condition edge matrix has the two-node block for a unit boundary coefficient.
Isoparametric finite element 2026-10-31
An isoparametric finite element uses the same reference shape functions to interpolate its geometry and its unknown field. With reference functions and physical nodes , the geometry map is and the physical functions are . The map must be one-to-one and have a nonvanishing Jacobian determinant. For bilinear quadrilaterals, compatible common edges have affine geometry maps and identical linear field traces, giving a continuous conforming finite element space. On a general quadrilateral the pulled-back functions need not be polynomials in physical coordinates.
Work in the usual bounded Lipschitz, polygonally triangulated setting in which Sobolev traces and conforming meshes are defined. Choose an lift of the smooth boundary data. Multiplying the Poisson equation by and integrating by parts gives the weak formulationThe test function has zero trace, so the boundary flux term vanishes. This formulation only needs first weak derivatives.
Let be the conforming finite element space of continuous functions affine on each triangle, and its zero-boundary subspace. Choose a nodal interpolation of the boundary lift and seek satisfying the same identity for every . General smooth boundary data need not be exactly representable by boundary piecewise linear functions; this is the usual discrete boundary approximation.
With nodal shape functions , interior coefficients satisfyHere and index interior and boundary vertices. Finite element assembly sums the triangle contributions.
Take a translated lower triangle with local vertices . Its local functions are , , . Their gradients are constant and the area is , giving the stiffness matrixTranslations preserve this matrix, while rotations or a different local vertex order permute its entries. The coupling across the hypotenuse is zero.
Each interior grid vertex belongs to six triangles. Summation gives diagonal value 4 and coupling to each of its four horizontal and vertical neighbors. Both positive-diagonal edge couplings vanish. Thus, before prescribed boundary values are removed, an interior equation has the five-point stencilThere is no factor in the assembled variational matrix; that factor belongs to a differently normalized finite-difference equation.
If and , lexicographic ordering makes the Dirichlet-reduced matrix block tridiagonal with diagonal blocks and neighboring blocks . A row with all four neighboring nodes unknown has five nonzeros: 4 once and four times. Rows adjacent to the boundary have fewer unknown-neighbor entries; their exact count is . Removed boundary contributions appear on the right, rather than as new nonzeros.
The bilinear square finite element contains the terms . In anticlockwise corner order beginning at , its shape functions areThe mass matrix has entries . Each product separates into one-dimensional factors, with and . Diagonal, adjacent-corner and opposite-corner entries are respectively , , . ThusNumber global grid nodes by , with , and . For an interior node, four elements contribute to its diagonal, two to each axial neighbour and one to each diagonal neighbour. Its global row therefore has the nine-point stencilIn the stated ordering the axial entries occur at columns and ; the four diagonal ones occur at . No boundary degrees of freedom have been removed.
For general valid quadrilaterals, use an isoparametric finite element. Map the unit square to an element by and define physical shape functions . Require a one-to-one nondegenerate map and compatible common edges. On a shared edge the map and the trace of each shape function are linear between the same endpoints; the neighbouring traces therefore agree. The assembled functions are continuous and lie in , giving a conforming finite element space. On a non-parallelogram the pulled-back functions are generally not bilinear polynomials in the physical coordinates themselves.
Use the usual bounded Lipschitz domain assumptions so that the Sobolev trace is defined. Multiplication by and Green's first identity giveThe Robin boundary condition substitutes in the boundary integral. The resulting Weak formulation of the Robin Poisson problem is therefore: find such thatThe boundary values in the integral mean Sobolev traces; no classical normal derivative is required of the weak solution. For uniqueness, subtract two solutions and test by their difference . This yields . Thus , so is constant on each connected component, and its vanishing boundary Sobolev trace makes each constant zero. The weak solution is unique.
For a bilinear square finite element with corners numbered anticlockwise from the lower-left corner, introduce local coordinates , . The four shape functions areThe local stiffness matrix has entries . The factor from the area element cancels the two factors from the gradients. Symmetry leaves three types: diagonal, adjacent corners, and opposite corners. For representatives,ConsequentlyFor an element whose left edge lies on , the boundary term in the weak formulation adds . Only and are nonzero on that edge. Integrating , and gives the extra contributionIts entries are added at the corresponding global node numbers during finite element assembly. Additional boundary edges contribute their own analogous edge matrices. The Robin boundary condition is represented by these integrals, so boundary nodes remain unknowns.
Shape function 2026-10-31
A shape function is a local basis function associated with a degree of freedom of a finite element. For nodal degrees of freedom it is one at its own node and zero at the other nodes, allowing local interpolation from the nodal values. For a bilinear square finite element, the four products of linear coordinate functions provide the nodal shape functions.
