using Gronwall’s inequality  , we have
then from the above inequality (2.19), the stability result (2.16) can be obtained. □
3. Convergence Estimate
In this section, under an a-priori bound assumption for the exact solution a convergence estimate of Hölder type for the regularization method is derived. The corresponding result is shown in Theorem 3.1.
Theorem 3.1. Suppose that f satisfies the uniform Lipschitz condition (1.2), and u given by (2.1) is the exact solution of problem (1.1), defined by (2.4) is the regularization solution, the measured data satisfies (2.3). If the exact solution u satisfies
and the regularization parameter is chosen as
then for fixed, we have the following convergence estimate
here, , is given in Theorem 2.2.
Proof. Denote be the solution of problem (2.4) with exact data. We know that
From Theorem 2.2, for, we have
By (2.1), (2.4), (2.7), (2.8), we have
For, we get
use Gronwall’s inequality  , it can be obtained that
From (3.2), (3.4), (3.5), (3.7) and (2.3), we can obtain the convergence result (3.3). □
4. Numerical Experiments
In this section, we verify the accuracy and efficiency of our given regularization method by the following numerical example
here we take, , , then and.
It is clear that is an exact solution of problem (4.1), thus
,. We choose the measured
data as, where is an error level, and
Let for, the regularization solution with
can be computed by the following iteration scheme
For a fixed, in order to make the sensitivity analysis for numerical results, we define the relative root mean square error between the exact and approximate solutions as
We adopt the above given algorithms to compute the regularization solution at with,
for Taking for the numerical results for and at, are shown in Figure 1 and Figure 2, respectively. For, the relative root mean square errors for the various error levels and regularization parameters at are shown in Table 1. In the computational procedure, the regulari- zation parameter is chosen by (3.2), and is computed by (4.2).
From Figure 1 and Figure 2 and Table 1, it can be observed that our regularization method is effective and stable. Meanwhile we note that the smaller is, the better the calculation effect is. Table 1 shows that the numerical results become worse when y approaches to 1, which is a common phenomenon in the computation of ill-posed Cauchy problems for the elliptic equation.
(a) (b)(c) (d)
Figure 1. Exact and regularized solutions at. (a); (b); (c); (d).
(a) (b)(c) (d)
Figure 2. Exact and regularized solutions at. (a); (b); (c); (d).
Table 1. The relative root mean square errors for various and the regularization parameters at.
We use a filtering function method to solve a Cauchy problem for semi-linear elliptic equation. The results of the well-posedness for the approximation problem are given. Under the a-priori bound assumption, the conver- gence estimate of Hölder type has been derived. Finally, we compute the regularization solution by constructing an iterative scheme. Some numerical results show that this method is stable and feasible.
The authors would like to thank the reviewers for their constructive comments and valuable suggestions that improve the quality of our paper. The work described in this paper was supported by the SRF (2014XYZ08, 2015JBK423), NFPBP (2014QZP02) of Beifang University of Nationalities, the SRP of Ningxia Higher School (NGY20140149) and SRP of State Ethnic Affairs Commission of China (14BFZ004).
Cite this paper
HongwuZhang,XiaojuZhang, (2015) Filtering Function Method for the Cauchy Problem of a Semi-Linear Elliptic Equation. Journal of Applied Mathematics and Physics,03,1599-1609. doi: 10.4236/jamp.2015.312184