Scribd
Upload
121 views4 pages

Finite Element Method

The finite element method (FEM) is a numerical technique used to solve partial differential equations. It involves dividing a domain into small elements and approximating the solution within each element using interpolation functions. This transforms continuous problems into discrete algebraic equations that can be solved using techniques like matrix algebra. Key steps include developing the weak form integral equations, discretizing the domain and equations, and using solvers to determine the unknown variable values at nodes within each element.

Uploaded by

Rhea Mamba
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
121 views4 pages

Finite Element Method

The finite element method (FEM) is a numerical technique used to solve partial differential equations. It involves dividing a domain into small elements and approximating the solution within each element using interpolation functions. This transforms continuous problems into discrete algebraic equations that can be solved using techniques like matrix algebra. Key steps include developing the weak form integral equations, discretizing the domain and equations, and using solvers to determine the unknown variable values at nodes within each element.

Uploaded by

Rhea Mamba
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Finite Element Method

The finite element method (FEM) is a numerical technique for solving problems which are

described by partial differential equations or can be formulated as functional minimization. A

domain of interest is represented as an assembly of finite elements. Approximating functions in

finite elements are determined in terms of nodal values of a physical field which is sought. A

continuous physical problem is transformed into a discretized finite element problem with

unknown nodal values. For a linear problem a system of linear algebraic equations should be

solved. Values inside finite elements can be recovered using nodal values. (Nikishkov, 2004)

Concept of Finite Element Method

Figure 1. (a) A general two-dimensional domain of field variable (x, y). (b) A three-node
finite element defined in the domain. (c) Additional elements showing a partial finite
element mesh of the domain. (Hutton, 2004)
Boundary value problems are also called field problems. The field is the domain of interest and most often
represents a physical structure. The field variables are the dependent variables of interest governed by
the differential equation. The boundary conditions are the specified values of the field variables (or
related variables such as derivatives) on the boundaries of the field.

For simplicity, at this point, we assume a two-dimensional case with a single field variable  (x, y) to be

determined at every point P (x, y) such that a known governing equation (or equations) is satisfied exactly
at every such point.

A finite element is not a differential element of size dx ×dy. A node is a specific point in the finite element
at which the value of the field variable is to be explicitly calculated.

The values of the field variable computed at the nodes are used to approximate the values at non-nodal
points (that is, in the element interior) by interpolation of the nodal values. For the three-node triangle
example, the field variable is described by the approximate relation

 x, y   N1x, y 1  N 2x, y  2  N 3x, y 3

where  1,  2, and  3 are the values of the field variable at the nodes, and N1, N2, and N3 are the

interpolation functions, also known as shape functions or blending functions.

In the finite element approach, the nodal values of the field variable are treated as unknown constants
that are to be determined. The interpolation functions are most often polynomial forms of the
independent variables, derived to satisfy certain required conditions at the nodes.

The interpolation functions are predetermined, known functions of the independent variables; and these
functions describe the variation of the field variable within the finite element. (Hutton, 2004)

Degrees of Freedom

Again a two-dimensional case with a single field variable  (x, y). The triangular element described

is said to have 3 degrees of freedom, as three nodal values of the field variable are required to describe
the field variable everywhere in the element (scalar). In general, the number of degrees of freedom
associated with a finite element is equal to the product of the number of nodes and the number of values
of the field variable (and possibly its derivatives) that must be computed at each node. (Hutton, 2004)
Weak Form

One of the first steps in FEM is to identify the PDE associated with the physical

phenomenon. The PDE (or differential form) is known as the strong form and the integral form is

known as the weak form. Consider the simple PDE as shown below. The equation is multiplied by

a trial function v(x) on both sides and integrated with the domain

u" x   f  x 

 u"x  x   f x  x 
Now, using integration of parts, the LHS of the above equation can be reduced to

u ' x   x 0   u ' x  ' x    f  x  x 


1

As it can be seen, the order of continuity required for the unknown function u(x) is reduced

by one. The earlier differential equation required u(x) to be differentiable at least twice while the

integral equation requires it to be differentiable only once. The same is true for multi-dimensional

functions, but the derivatives are replaced by gradients and divergence.

Discretization

Once the integral or weak form has been set up, the next step is the discretization of the

weak form. The integral form needs to be solved numerically and hence the integration is converted

to a summation that can be calculated numerically. In addition, one of the primary goals of

discretization is also to convert the integral form to a set of matrix equations that can be solved

using well-known theories of matrix algebra. The unknown functional u(x) are calculated at the

nodal points. Interpolation functions are defined for each element to interpolate, for values inside
the element, using nodal values. These interpolation functions are also often referred to as shape

or ansatz functions. Thus the unknown functional u(x) can be reduced to

nen
u x    N i u i
n 1

where nen is the number of nodes in the element, Ni and ui are the interpolation function and

unknowns associated with node i, respectively.

Solvers

Once the matrix equations have been established, the equations are passed on to a solver

to solve the system of equations. Depending on the type of problem, direct or iterative solvers are

generally used.

You might also like