Open Educational Resources

FEA in One Dimension: Interpolation Order

As shown in the previous chapter, the approximate methods involve assuming a particular form for the unknown variables such that the approximate solution has a finite number of unknown parameters. The approximate solution, or often termed trial function, that were used in the previous section were often polynomials which are continuous and differentiable along the whole domain (Figure 1a). The finite element analysis, however, involves using piecewise linear (piecewise affine) or piecewise nonlinear functions for the approximate solution (Figure 1b). Afterwards, a weak formulation of the problem is solved using the Virtual Work method (which as shown previously is equivalent to the Galerkin method).

Figure 1. The final displacement function as (a) the sum of continuously differentiable group of functions versus (b) the sum of a group of piecewise linear functions

Interpolation Order

In traditional finite element analysis, the values of the displacements at specific points (nodes) across the domain are the main unknowns to be calculated using the method. The displacements at intermediate locations between the nodes are interpolated according to a chosen interpolation function. The interpolation functions are classified according to their differentiability. A C_{n} interpolation function is an interpolation function that can be differentiated n times while an interpolation function that is discontinuous across nodes is termed C_{-1}. Figure 2 shows three nodes (node 1, node 2 and node 3) and three different interpolation functions for the displacement at intermediate locations between the nodes. Figure 2 illustrates discontinuous C_{-1}, continuous C_{0}, and once differentiable C_{1} interpolation functions.

Figure 2. Examples of interpolation order across nodes

Leave a Reply

Your email address will not be published. Required fields are marked *