This section deals with analyzing errors in finite element method. To determine when Galerkin method will produce a good approximation, abstraction is introduced.
Let B:V×V→R be bounded bilinear form and let F:V→R be bounded linear form.
It is assumed that the problem to be solved can be stated as, find u∈V such that
Example
To make sense of above abstraction, it is best to see how this is derived using a weak form of PDE as shown below.
Consider Poisson's equation given by:
where
The weak formulation involves multiplying the differential equation by a test function
Here,
Well posed problem
The abstract setting problem is considered well-posed, if for each F∈V∗ , there exists a unique solution u∈V and the mapping F−>u is bounded. V∗ here means dual space of V. Alternately, if L:V→V∗ given by <Lu,v>=B(u,v) is an isomorphism.
Example
For Dirichelet problem of Poisson's equation, we have
A generalized Garlekin method for the abstract problem begins with a finite dimensional normed vector space Vh, a bileaner form Bh:Vh×Vh→R and a linear form Fh:Vh→R and defines uh∈Vh by
Above equation can be written in the form Lhuh=Fh where Lh:Vh→V∗h given by <Lhu,v>=Bh(u,v)
If the finite dimensional problem is non-singular, then the norm of discrete solution operator known as ``stability constant'' is defined as
In this approximation of the original problem determined by V,B,F by Vh,Bh,Fh intention is that Vh in some sense approximates V and Bh,Fh approximate B,V. This is idea behind ``Consistency''.
The goal here is to approximate uh to u. This is known as ``Convergence''.
To this end, assume there is a restriction operator πh:V→Vh so that πhu is close to u.
Using the equation Lhuh=Fh, we can compute the ``consistency error'' as
Error we wish to control is
Easy to see the relation between error and consistency error.
Recall thet norm of Lh is stability constant. If we take norms both sides to above equation, we see that the norm of error is bounded by product of stability constant and norm of consistency error.
Expressing this in terms of bilinear forms the relation becomes,
Above equation, especially RHS needs some explanation.
The consistency error measures how close B_h(\pi_hu,v) to F_h(v) for all test functions v in the subspace V_h. Here F_h represents the discrete analog of forcing function. The ratio including sup means worst or max consistency error to the norm of test function v over all possible non-zero test functions in V_h.
Finite dimensional problem is non-singular iff
And the stability constant is given by \gamma^{-1}_h
Notes:
Above \gamma_h measures smallest ration of bilinear form B_h(u,v) to the product of norms of u and v overall non-zero functions u,v in the subspace V_h. Above condition shows that the bilinear form B_h(u,v) is bounded from below and has a positive lower bound. This is also called ``coercive'' over subspace V_h. Since B_h(u,v) is a matrix, above condition shows that this matrix is non-singular. For numerical methods, this means the problem is well-posed and having a continuous solution.