Next: 4.2 The open boundary
Up: 4. The finite element
Previous: 4. The finite element
  Contents
The solution of Poisson's equation (
), which is required to calculate the demagnetizing field
, has to be solved for a given magnetization distribution
. We write Poisson's equation in a more general form
 |
(4.1) |
In order to apply the finite element method, we have to find a so-called ``weak'' or variational formulation.
But first we have to define the vector spaces, in which we are searching for a solution [33]. Given a bounded domain
, we denote by
the space of quadratically integrable functions defined on
. The usual inner product
induces the norm
and
becomes a Hilbert space. The space
consists of those functions in
, whose (weak) derivative of order one also lie in
. The
-inner product is defined as
The space
belongs to a family of function spaces known as Sobolev spaces. They can be physically interpreted as the space of functions of finite energy with respect to the problem under consideration. In this sense, it is the correct space in which to seek solutions of the weak formulation.
Further, we define the trial space
and the test space or weighting space
The functions in
are called test functions.
To derive the weak formulation we multiply Poisson's equation (
) with a test function
and integrate over the solution domain
Integration by parts gives
where
denotes the surface normal on the boundary
. If appropriate boundary conditions define the values of
(Dirichlet boundary conditions) or of its derivatives
(Neumann boundary conditions) on the boundary, we can simplify (since
vanishes, where Dirichlet boundary conditions apply)
 |
(4.2) |
The variational formulation of (
) can then be stated in the following general form: Find
such, that
 |
(4.3) |
where the bilinear form
and the linear functional
are given by
 |
(4.4) |
We can homogenize the Dirichlet boundary condition
by which the trial space, in which the solution
is sought, becomes equivalent to the test space
. Without loss of generality, we can thus assume that we seek the solution in the space
. It is noted, that the weak form is a generalization of the classical formulation. Therefore, the solution of the weak formulation need not be a classical solution at the same time.
Not only Poisson's equation, but a large number of boundary value problems lead to symmetric and positive definite bilinear forms. Also for (
) we find
and
In this case the weak formulation is equivalent to a minimization problem.
is the sought solution, if it minimizes the functional
can often be interpreted as an energy functional.
In the context of Poisson's equation for the demagnetizing field (
), this functional gives the energy of the magnetization distribution
in the magnetic field
Minimization of this functional with respect to
reduces
to the stray field energy
and makes
equal to the self demagnetizing field
[34].
In general, the trial and test space
is too large and complex to deal with numerically. Thus, the Galerkin discretization seeks an approximation of the solution
by restricting it to a finite dimensional subspace
. We rewrite the weak formulation (
) as follows: Find
such, that
 |
(4.5) |
The exact solution
shall be approximated by a linear combination of trial functions
from a finite dimensional subspace
of
If we insert this expansion in (
), we obtain
 |
(4.6) |
Since each basis function
lies in
, relation (
) holds trivially for
. Conversely, if relation (
) holds for each basis function
, then it also holds for all
. Hence it is sufficient to determine the coefficients
of
such, that
 |
(4.7) |
Therefore we arrive at a linear system of algebraic equations, which can be solved with any standard method, such as the Gauß method, by Cholesky decomposition or iterative schemes like the conjugate gradient method.
The finite element method is a particular Galerkin method [35], which uses piecewise polynomial functions to construct the finite dimensional subspace
. The solution domain is divided into many small subdomains, referred to as elements. In two space dimensions these elements are usually triangles (fig.
) or convex quadrilaterals, while in three dimensions tetrahedra, prisms and hexahedra are commonly employed. This subdivision process is usually called triangulation. The collection of all elements is referred to as the finite element mesh or grid.
Figure:
Triangulation of a 2D domain
[Polygonal domain]
![\includegraphics[scale=0.4]{fig/Ex1.0.eps}](img177.gif)
[Triangulation]
|
In the finite element method the basis functions
(fig.
) are chosen in such a way, that
- The support
of each basis function, i.e. the closure of the set, where
is nonzero, is small in the sense, that it consists of only a few (connected) elements. (fig.
)
- Globally, each function
has a simple description in terms of
so called degrees of freedom which uniquely characterize
. Each basis function is characterized by possessing exactly one nonvanishing degree of freedom.
Figure:
Nodal basis functions
[Nodal basis function  ]
![\includegraphics[scale=0.6]{fig/Ex1.3.eps}](img182.gif)
[Nodal basis function  ]
|
As the support is restricted to a very small local area, the integrals occurring in (
) need only be computed over the small support of each basis function. In fact, most of the integrals are zero, and so the matrix of the linear system of algebraic equations is very sparse.
Figure:
Common support of two basis functions
[Support of basis function  ]
![\includegraphics[scale=0.25]{fig/Ex1.5.eps}](img185.gif)
[Support of basis function  ]
![\includegraphics[scale=0.25]{fig/Ex1.6.eps}](img186.gif)
[Common support of  and  ]
|
Next: 4.2 The open boundary
Up: 4. The finite element
Previous: 4. The finite element
  Contents
Werner Scholz
2000-05-16