Partial differential equations and the finite element method 3-FEA1.md

This part is devoted to introduce the Galerkin method and its important special case, the Finite element method.

Consider the general framework

Let Vbe a Hilbert space, a(.,.):V×VR a bilinear form and lV. It is our task to find uV such that
(1)

a(u,v)=l(v)

We assume that the bilinear form a(.,.) is bounded and V-elliptic, i.e., that there exist constants Cb,Cel>0 such that

|a(u,v)|CbuVvV

and
a(u,v)CelvV2

Recall that the weak problem (1) has a unique solution by the Lax-Milgram lemma.


The Galerkin method

As V is infinite dim function space. The Galerkin method is based on a sequence of finite dimensional subspaces {Vn}n=1V, VnVn+1, that fill the space V in the limit. In each finite-dimensional space Vn, problem (1) is solved exactly. It can be shown that under suitable assumptions the sequence of the approximate solutions {un}n=1 converges to the exact solution of problem (1).

Discrete problem

Find unVn such that
(2)

a(un,v)=l(v),vVn

Lemma 1 (Unique solvability) Problem (2) has a unique solution unVn,.

Proof: Recall Lax-Milgram lemma : Let V be a Hilbert space, a(.,.):V×VR a bounded V-elliptic bilinear form and lV Then there exists a unique solution to the problem

a(u,v)=l(v)
.

Suppose space V has a finite basis {vn}n=1Nn, then

un=j=1Nnyjvj

where yjs are unknown coefficients.
a(un,vi)=j=1Nnyja(vj,vi)=l(vI)

Denote Sn={a(vj,vi)}i,j=1N, Fn={l(vi)}, Yn={yj}, then
(3)
SnYn=Fn
.

Lemma 2 (Positive definiteness of Sn) Let Vn be a Hilbert space and a(.,.):V×VRa bilinear V-elliptic form. Then the stiffness matrix Sn , of the discrete problem (3) is positive definite.

About the error uun

Lemma 3 (Orthogonality of error for elliptic problems) Let uV be the exact solution of the continuous problem (I ) and un the exact solution of the discrete problem (3).
Then the error en=uun, satisjies

a(uun,v)=0,vVn
.
Proof:Because VnV, then
a(uun,v)=a(u,v)a(un,v)=0.

Remark 1 (Geometrical interpretation) If the bilinear form a(.,.) is symmetric, it induces an energetic inner product, then

(en,v)e=0,vVn
,

i.e., that the error of the Galerkin approximation en=uun is orthogonal to the Galerkin subspace Vn in the energetic inner product. Hence the approximate solution u, E V, is an orthogonal projection of the exact solution u onto the Galerkin subspace Vn in the energetic inner product, and thus it is the nearest element in the space Vn to the exact solution u in the energy norm,

uune=infvVnuve

Partial differential equations and the finite element method 3-FEA1.md


FEA

Let ΩRd , where d is the spatial dimension, be an open bounded set. If the Hilbert space V consists of functions defined in Ω and the Galerkin subspaces Vn comprise piecewise-polynomial functions, the Galerkin method is called the Finite element method (FEM).

Consider the model equation

(a1u)+a0u=f,

where fL2(Ω), in a bounded interval Ω=(a,b)R, equipped with the homogeneous Dirichlet boundary conditions. At the beginning let a1 and a0 be constants and assume a simple load function of the form f(x)=1.

The Galerkin procedure assumes a sequence of finite-dimensional subspaces

V1V2V

Consider a partition

a=x0(n)<x1(n)<<xMn(n)=b

and define the finite element mesh
\mathcal {T}_n=\{K_1^{(n),K_2^{(n),\ldots,K_{M_n}^{(n)\}

The open intervals

K_i^{(n)=(x_{i-1}^{(n)},x_i^{(n)})
are called finite elements, and the value
h(n)=max(xi(n)xi1(n))

is said to be the mesh diameter.

The piecewise linear basis functions vj, satisfy vj(xi)=δij.

Then by (3), we can get un.