As the name implies, finite elements use basis sets that are compactly supported. There are some nice advantages of FEM:
(1) mathematical- you are forced to think from the outset what function spaces you are using and in what sense, then, is a computed solution ``close'' to the exact solution, i.e. the spaces have built-in norms. A second mathematical aspect is that in casting the problem mathematically, one is forced to seriously consider whether the partial differential equation, or ordinary differential equation, is well-posed. That is not to say that you can use the analysis of Galerkin and the proceed to implement the approximate solution by some non-Galerkin technique.
(2) computationally - the technique allows us to obtain the solution everywhere in the domain, not just at grid locations. This, in contrast to a spectral (a special collocation case) or finite-difference technique, where you are approximating the solution at a finite set of grid locations. That is not to say that you can circumvent this issue by careful interpolation, but this is already provided by the Galerkin technique (and more importantly, you know an error estimate everywhere in the domain). Perhaps the most important advantage is that the technique lends itself very naturally to tiling very complex domains with elements that fit more naturally than simple uniform or rectangular lattices. It is thus very popular in boundary value problems (and eigenvalue problems) that come from very complex structures, such as bridges, buildings,structural components of vehicles, etc. This has been made considerably easier to do lately, with the availability of very smart automated mesh generation packages (well, in 2d...but things are getting better in 3d), which take care of the most tedious and difficult part of the implementation of the method.
Again, here we focus only on elliptic problems with simple boundary conditions.
Dirichlet Model Problem
Consider
A reminder:
| grad |
![]() | ||
![]() |
Weak Formulation (WF): Find
, vanishing on
, such
that
Derivation:
Use the divergence theorem (integration by parts in
multi-dimensions). For
and
,
grad
Let
grad
yields (113), using
on
.
More precisely: for the SF we require
differentiable, and
twice differentiable, i.e.
and
. For the WF we require
integrable and
grad
grad
integrable.
A little detour: we remind ourselves that a function space
is comprised of the set of functions
for which
Example: Take the function
and ask for what values of
is
an element of
over the whole real line. If
and
are real,
The Sobolev Space is a function space defined by the integrability
of its elements. The Sobolev space
is defined as
Theorem: If
and
satisfies the SF then
satisfies the WF.
The proof is above.
Theorem: The WF has a unique solution.
The Variational Problem (V): Find
such that
grad
Theorem
satisfies the WF if and only if
satisfies the variational problem.
Proof: suppose
satisfies the WF. Let's evaluate
grad
grad
grad
gradRemark: For non-self-adjoint problems, can have WF but no VF. Note, however, that any linear second order SF problem can be put in self adjoint form (see Sturm-Liouville theory).
The problem
Exercise Let
grad
Theorem: If
satisfies the VF, then
satisfies
the WF.
Proof: Choose any
, and consider a real quantity
and
, defined as
grad
grad
In what follows we will define
![]() |
The numerical approximation of the VF problem is called the Rayleigh-Ritz Method and it can be summarized as follows: Choose a
subspace
, where
is finite dimensional
subspace. Then, finding the
that minimizes
yields
an approximation to
, if
is ``sufficiently large.''
This could be called the VF
problem.
The numerical approximation of the WF problem can be done using
Galerkin techniques. Briefly, use a finite dimensional set of basis for
. Supposing
dim
,
then, every function
in
can be written as
What happens if the problem is instead nonlinear? for example, suppose we want to solve
grad
Exercise Set up the WF problem and its Galerkin
approximation for
Model Problem with Neumann Boundary Conditions
If
then the partial derivatives up to order
are
defined on
and are
functions there. However,
partials of order
cannot be sensibly defined on
.
So to define a space of functions that is
such that
of these functions are zero on the boundary is
nonsensical.
Instead, let
.We show that this is a good function space for
the trial functions:
grad
grad
Remark: we say that
is a
natural boundary condition, whereas
is an essential boundary condition.
Exercise Set up the WF problem and its Galerkin
approximation for
An Error Estimate: for the problem posed in (114): take
, then
Theorem For any
, as above,
Furthermore, if
are piecelinear hat functions,
Worked Two-Dimensional Example Calculation Here we will work through a two-dimensional calculation. We will assume that you will be doing all of the work. We'll provide you with some answers for what you should get along the way.
We'll solve
![]() |
We will assume in this example that
,
, and
. We will take the inner radius to be
and the outer one to be
. Here
, and
. The Laplacian in polar coordinates, applied to some function
, reads
We will tile the domain with 8 triangular elements. Each node point in the figure is numbered.
To label node points we will use a local and a global scheme.
A single index will denote a node in the global scheme as
given in the figure. A double index will denote the local
scheme. In this local scheme the node points are numbered
,
,
going in counterclockwise direction where
is the element number.
For example, in element
V the local nodes 51, 52, 53 correspond to the global nodes 2, 7,
8, respectively.
We will use piecewise bilinear elements.
hence our approximation will have
global
continuity.
Construction of the elements Let
![]() |
![]() |
The other two basis functions that are nonzero in the
-th element
are
where
and the indicial operations are taken
with
counterclockwise local
numbering assumed.
We want an approximation of the solution in the form
Using (118) and (120) we rewrite (119) as follows
![\begin{multline*}
\int_{\Omega^e} \nabla \phi_l \cdot \nabla \phi_m \mathrm{d}...
...+2})(y_{m+1}-y_{m+2})
+(x_{l+2}-x_{l+1})(x_{m+2}-x_{m+1})
\Big]
\end{multline*}](img1694.png)
![]() |
To solve the given problem, follow these steps:
| node number | coordinates |
| 1 | (0, 2) |
| 2 | (1.4142, 1.4142) |
| 3 | (2, 0) |
| 4 | (1, 0) |
| 5 | (0.7071, 0.7071) |
| 6 | (0, 1) |
| 7 | (0.75, 1.299) |
| 8 | (1.299, 0.75) |
| element number | nodes |
| I | 1,7,2 |
| II | 1,6,7 |
| III | 6,5,7 |
| IV | 2,7,8 |
| V | 5,8,7 |
| VI | 3,2,8 |
| VII | 5,4,8 |
| VIII | 4,3,8 |
As all stiffness matrices are symmetric only the upperdiagonal part
is given.
Element I Element II
| 0.4116 | -0.7897 | 0.3781 |
| 2.1224 | -1.3327 | |
| 0.9546 |
| 0.4346 | -0.2353 | -0.1993 |
| 0.7026 | -0.4673 | |
| 0.6667 |
Element III Element IV
| 0.4086 | -0.2426 | -0.1659 |
| 0.7563 | -0.5136 | |
| 0.6796 |
| 0.7045 | -0.3523 | -0.3523 |
| 0.5311 | -0.1789 | |
| 0.5311 |
Element V Element VI
| 0.8646 | -0.4323 | -0.4323 |
| 0.5051 | -0.0728 | |
| 0.5051 |
| 0.4116 | 0.3781 | -0.7897 |
| 0.9546 | -1.3327 | |
| 2.1224 |
Element VII Element VIII
| 0.7563 | -0.2426 | -0.5136 |
| 0.4086 | -0.1659 | |
| 0.6796 |
| 0.7026 | -0.2353 | -0.4673 |
| 0.4346 | -0.1993 | |
| 0.6667 |
| 0.8462 | 0.3781 | 0 | 0 | 0 | -0.2353 | 0.989 | 0 |
| 2.6137 | 0.3781 | 0 | 0 | 0 | -1.685 | -1.685 | |
| 0.8462 | -0.2353 | 0 | 0 | 0 | 0.989 | ||
| 1.1112 | -0.2426 | 0 | 0 | -0.6332 | |||
| 2.3772 | -0.2426 | -0.9459 | -0.9549 | ||||
| 1.1112 | -0.6332 | 0 | |||||
| 4.5059 | -0.2517 | ||||||
| 4.5049 |
The only contribution comes from the second node.
We will integrate the boundary terms over the arc of the
circle. If many points on the arc are used the difference
between integration along the arc to integration
along the triangle edges is small and the integrals are much
more convenient along the arcs. Let us just consider element
VI which will give us
because of symmetry. Using polar
coordinates we have
and we can interpolate
linearly which will gives us
All nodes except 2, 7, 8 have zero function value. Therefore the
stiffness matrix reduces to a
matrix and we end up with
the following system of equations:
We obtain
,
,
.
Our approximation is, not surprisingly, poor. However, only three
free nodes were included in the calculation.
More elements are needed for a better result.