An Adaptive Least-Squares Mixed Finite Element Method for Fourth Order Parabolic Problems

A least-squares mixed finite element (LSMFE) method for the numerical solution of fourth order parabolic problems analyzed and developed in this paper. The Ciarlet-Raviart mixed finite element space is used to approximate. The a posteriori error estimator which is needed in the adaptive refinement algorithm is proposed. The local evaluation of the least-squares functional serves as a posteriori error estimator. The posteriori errors are effectively estimated. The convergence of the adaptive least-squares mixed finite element method is proved.


Introduction
A general theory of the least-squares method has been developed by A. K. Aziz, R. B. Kellogg and A. B.
Stephens in [1].The most important advantage leads to a symmetric positive definite problem.In the least-squares mixed finite element approach, a least-squares residual minimization is introduced.This method has an advantage which is not subject to the LBB [1] condition.The mixed finite element methods of least-squares type have been the object of many studies recently (see, e.g.Stokes Equation [2], Elliptic Problem [3], Newtonian Fluid Flow Problem [4], Transmission Problems [5], Sobolev Equations [6], Parabolic Problems [7] et al.).The adaptive least-squares mixed finite element method have been studied in recent several years (see, e.g. the linear elasticity [8]), but the research of adaptive method about fourth order parabolic problems is not common.
Adaptive methods are now widely used in the scientific computation.In this paper, we are interested in the adaptive least-squares mixed finite element method for fourth order parabolic problems, fourth order parabolic problems are fundamental partial differential equations.It occurs in various areas of applied mathematics and science.Our emphasis in this paper is on the performance of an adaptive refinement strategy based on the a posteriori error estimator inherent in the least-squares formulation by the local evaluation of the functional.During the last 15 -20 years a big amount of work has been devoted to a posteriori error estimation problem, i.e., computing reliable bounds on the error of given numerical approximation to the solution of partial differential equations using only numerical solution and the given data.In order to operate the a posteriori error estimator should be neither under nor overestimate the error.The a posteriori error is effectively estimated, and proved the convergence of the adaptive least-squares mixed finite element method in this paper.
An outline of the paper is as follows.The least-squares formulation of fourth order parabolic problems is described in Section 2. It includes continuous and coercivity properties of the least-squares variational formulation.Appropriate spaces for the finite element approximation and a generalization of the coercivity shown in Section 2 to the discrete form is discussed in Section 3. In Section 4, a posteriori error estimators which are needed in an adaptive refinement algorithm are composed with the least-squares functional, and posteriori errors are effectively estimated.The convergence of the adaptive leastsquares mixed finite element method is shown in Section 5. Finally, we summarize our findings and present conclusions in Section 6.In this paper, we define C to be a generic positive constant.

A Least-Squares Formulation of Fourth Order Parabolic Problems
We start from the equations of fourth order parabolic problems in the form: where is a bounded domain, with boundary .We shall consider an adaptive least-squares mixed finite element method for (1)- (4).
We introduce the Sobolev spaces: Now, let us define the least-squares problem: find where , .
We introduce the least-squares functional: Taking variations in (10) with respect to q and v, the where Theorem 2.1.The bilinear form is continuous and coercive.In other words, there exist positive constants , ; , , ; , , Proof: 1) For the upper bound we have: Since the bilinear form is symmetric, this is sufficient for the upper bound in Theorem 2.1.
2) For the lower bound.B q v q v v q q v q q v q v q v v q q q q v q v q q q q q v v q v v v q q q q v q q so we can select the positive constants The proof of Theorem 2.1 is therefore completed.Theorem 2.2.The Equations ( 5)-( 9) has a unique solution, and the solution is Proof: From Theorem 2.1, we know that the bilinear form is coercive and bounded on , ; ,

Finite Element Approximation
In principle, the LSMFE approach simply consists of minimizing (12) in finite-dimensional subspaces and .Suitable spaces are based on a triangulation h of and consist of piecewise polynomials with sufficient continuity conditions.

   
, let be a class qusi-uniform regular partition of h P  .

, ; , ,
. The proof is the same as the Theorem 2.1, we omit the proof.

Postieriori Error Estimation
One of the main motivations for using least-squares finite element approaches is the fact that the element-wise evaluation of the functional serves as an a posteriori error estimator.
A posteriori estimate attempt to provide quantitatively accurate measures of the discretization error through the socalled a posteriori error estimators which are derived by using the information obtained during the solution process.In recent years, the use of a posteriori error estimators has become an efficient tool for assessing and controlling computational errors in adaptive computations [10].Now we define the least-squares functional: so we define the posteriori estimator as following: Theorem 4.1.The least-squares functional constitutes an a posteriori error estimator.In other words, for .
From Theorem 3.1, we have: Remark: The mesh is adapted and based on a posteriori error estimate of the fourth order elliptic problems.
Based on the computed a posteriori error estimator  , we use a mesh optimization procedure to compute the size of elements in the new mesh.Adaptive refinement strategies consist in refining those triangles with the largest values of  .

Convergence Analysis of Adaptive Least-Squares Mixed Finite Element Method
We now briefly introduce the main idea of adaptive leastsquares mixed finite element methods through local refinement.Given an initial triangulation 0 , we shall generate a sequence of nested conforming triangulations using the following loop from k we first solve ( 5)-( 9) to get k on k P .The error is estimated using k and to mark a set of k that are to be refined.Triangles are refined in such a way that the triangulation is still shape regular and conforming.
Let 0 be an initial shape regular triangulation, let k P  be a solution of ( 5)-( 9) in the loop.We have the following theorem: So the adaptive least-squares mixed finite element method is converged.

Summary and Conclusions
We describe an adaptive least-squares mixed finite element procedure for solving the fourth order parabolic problems in this paper, and the procedure uses a leastsquares mixed finite element formulation and adaptive refinement based on a posteriori error estimate.The methods were applied to study the continuous and coercivity of the fourth order parabolic problems.
In this paper, we applied relatively standard a posteriori error estimation techniques to adaptively solve the fourth order parabolic problems and shown the convergence of the adaptive least-squares mixed finite element method.
The a posteriori error estimator is essential part of the ESTIMATE step.The a posteriori error estimator is usually split into local error indicators and they are then employed to make local modifications by dividing the elements whose error indicator is large and possibly coarsening the elements whose error indicator is small.The convergence of local refinement algorithms based on the repetition of loop

From
Let k  be a solution obtained in the loop in the algorithm, then there exists a constants -Theorem 4.1, we obtain the following inequality: The bilinear h is continuous and coercive, i.e., there exist positive constants h  and h  such that