Nonlinear finite elements/Solution of Poisson equation
From Wikiversity
[edit] Construction of Approximate Solutions
If we know that the problem is well-posed but does not have a closed form solution, we can go ahead and try to get an approximate solution. The finite element method is one way of getting at approximate solutions (among many other numerical methods).
The finite element method starts off with the variational form (or the weak form) of the BVP. The method is a special case of a class of methods called Galerkin methods.
[edit] Finite element solution for the Poisson equation
Recall the variational boundary value problem for the Poisson equation:
The space
is continuous and an infinite number of functions could be chosen from this space of functions. In the finite element method, we choose a trial function from the space of approximate solutions
where
. A defining feature of these approximate trial solutions is that they are associated with a mesh or discretization of the domain Ω. These functions also have the feature that they are finite dimensional with each dimension being associated with a node on the mesh.
Assume that we are given
. Let us choose a weighting function
that satisfies vh = 0 on ΓT. We can choose another function
as our trial solution. Since the boundary condition on ΓT is T = 0, both vh and Th can have the same form. In the next section, we will look at the general form of the heat equation where
on the boundary.
In finite element methods we choose trial solutions Th of the form
where T1, T2,
, Tn are nodal temperatures which are constant on
. The functions
form a basis that spans the subspace
and are known as basis functions or shape functions. Note that n is the total number of nodes minus the number of nodes on ΓT where T is specified.
Since the functions vh come from the same space of functions, we can represent them as
where b1, b2,
, bn are arbitrary constant on
with the restriction that vh = 0 on ΓT.
If we plug in these finite dimensional forms of v and T into the variational BVP, we get an approximate form of the variational BVP which can be stated as:
After substituting the expressions for vh and Th in the variational BVP we get
where,
In matrix form, we have
where
,
is a
symmetric matrix,
is a
vector, and
is a
vector.
Since
can be arbitrary, equation (38) can be further simplified to the form
This system of equations has a solution since
is positive-definite and therefore has an inverse. Once the Tis are known, the approximate solution can be found using
The functions
have special forms in the finite element method that have the property that the quality of the approximation improves with an increase in the dimension n of the basis.


![\begin{align}
0 & = \int_{\Omega} \boldsymbol{\nabla} T_h\bullet\boldsymbol{\nabla} v_h~dV -
\int_{\Omega} f~v_h~dV \\
& = \int_{\Omega} \boldsymbol{\nabla} (T_1 N_1+\dots+T_n N_n)\bullet
\boldsymbol{\nabla} (b_1 N_1+\dots+b_n N_n)~dV -
\int_{\Omega} f~(b_1 N_1+\dots+b_n N_n)~dV \\
& = \int_{\Omega} (T_1\boldsymbol{\nabla} N_1+\dots+T_n\boldsymbol{\nabla} N_n)\bullet
(b_1\boldsymbol{\nabla} N_1+\dots+b_n\boldsymbol{\nabla} N_n)~dV
- \int_{\Omega} f~(b_1 N_1+\dots+b_n N_n)~dV \\
& = \sum_{i,j=1}^n K_{ij} T_i b_j - \sum_{j=1}^n f_j b_j \\
& = \sum_{j=1}^n b_j \left[\sum_{i=1}^n K_{ij} T_i - f_j\right] \\
\end{align}](http://upload.wikimedia.org/math/9/d/6/9d6259bbd08bde1917466d63554e773f.png)

![\text{(38)} \qquad
\mathbf{b}^{T} \left[\mathbf{K} \mathbf{T} - \mathbf{f}\right] = \mathbf{0}](http://upload.wikimedia.org/math/2/5/5/255fd76491de117f2ed2caedfda06f26.png)



