Abstract
In this work, we focus on the Cauchy problem for the Poisson equation in the two dimensional domain, where the initial data is disturbed by random noise. In general, the problem is severely ill-posed in the sense of Hadamard, i.e., the solution does not depend continuously on the data. To regularize the instable solution of the problem, we have applied a nonparametric regression associated with the truncation method. Eventually, a numerical example has been carried out, the result shows that our regularization method is converged; and the error has been enhanced once the number of observation points is increased.
1. Introduction
The Cauchy problem for the Poisson equation of elliptic type has been applied to a wide range of science and technology fields. It arises, for instance, to describe some phenomena relating to physics [1,2], and biology [3]. In this paper, we are interested in finding a solution of the Cauchy problem for the Poisson equation
where , and is a given real number.
In reality, the exact values of the functions are not available, we only know the observations themselves, instead. As is well-known, observational data are always discrete sets obtained from temporal and spatial measurements, and containing errors. Some previous studies by many authors are often assumed that the error is deterministic , such as [4,5], etc. However, there are the errors which come from uncontrollable sources, such as volcanic activity, wind, rain, snow, humidity, radiation, etc., then the errors are random. It is reasonable to assume that the observed value of follow the random models
where , and is grid points in . Here is a positive constant, are Brownian motions, and random variables and are mutually independent and identically distributed; and ; and are unknown positive constants which are bounded by constants and , respectively; i.e., and .
A small perturbation in the given Cauchy data may cause a very large error on the solution of Problem (1). This implies that the problem (1) associated with random models (2)–(4) is ill-posed in the sense of Hadamard. Hence, some regularization methods should be applied. This problem has not been studied before, and that is the motivation for us to conduct this paper. Our main goal is to apply the nonparametric regression method for approximating the functions . Then we produce an estimate for for .
This paper is organized as follows. In Section 2, we define some notations. The discretization form of Fourier coefficients is introduced in Section 3. Section 4 is devoted to the ill-posedness of the problem. In Section 5, we construct an estimator which is called the regularized solution. An upper bound of the estimation error is also described in this section. Finally, a numerical result is presented in Section 7.
2. Some Notions and the Solution of Problem
2.1. Some Notions
In this section, we present some notions which are useful for our main results. We first designate the space. The Dirichlet Laplacian operator is defined by
Since A is a linear, densely defined self-adjoint and positive definite elliptic operator on the connected bounded domain with Dirichlet boundary condition. By the spectral theory, it is easy to show that the eigenvalues of A are given by . The corresponding eigenfunctions are denote by for all , where . Thus the eigenpairs , satisfy
The functions are normalized so that is an orthonormal basis of . According to the characterization of Hilbert basis, for any integer , the set
is an -dimensional subspace of . From [6] (Lemma 1.10), we give the projection of onto finite dimensional subspaces , as follows:
For any positive numbers , and E, we denote the Sobolev class of functions by
2.2. The Solution of Problem
Lemma 1.
3. Discretization Form of the Fourier Coefficients
In this section, we consider the discretization form of the Fourier coefficients, we first state the Lemmas below (see [7], page 145) which derive certain orthogonality results concerning the sine functions over uniform design.
Lemma 2.
Let with and , then for all we have
If then we have
Lemma 3.
For and , with and , if we denote
then we have
For and , we have
Proof.
This Lemma is derived from Lemma 2. □
Lemma 4.
Assume that . For and , we set
with are grid points of Ω. The Fourier coefficients of the function can be represented as
where consists of the terms:
which are defined as:
and
Proof.
Remark 1.
Let us now consider the term
in Lemma 3. The hidden ideal inside is that the Fourier coefficients is approximated by which is the function of the data set. So is a different between them; also is called a residual. Naturally, it must converge to zero as tend to infinity.
We obtain the upper boundary of in the following Lemma:
Lemma 5.
Suppose that , . Then there exists a constant independent of such that
Proof.
From (14), the triangle inequality implies
The first term is bounded by
and the second term is estimated as follows
Similarly, we also have
Therefore, there exists a constant number in such a way that
such that (20) is verified. □
Lemma 6.
Assume that . For and , we set
with are grid points of Ω. The Fourier coefficients of the function can be represented as
where is
and
and
Lemma 7
(Upper boundary of residual ). Suppose that for all , and that ; . Let us recall that defined by (22). Then there exists a generic constant which is independent of such that
Lemma 8.
For any integer such that and , the solution u can be represented as follows
4. The Ill-Posedness of the Problem
Based on above fundamental, we can now consider the ill–posedness of our problem. We investigate a model with concrete data and prove the instability of the solution in the case of random noise data. We divide our task into two parts.
Part 1. Small change in the data: If , , and then problem (1) has the unique solution . Let us take the following random observation data:
where are Brownian motions, and . Next, we consider the mean square error between g and its estimation, (see Lemma 9), which is characterized by . Firstly, the Paserval’s identity give us
Secondly, since , we have for all or . Hence, taking expectation both sides of (24), we obtain
On the other hand and from (13) give us . Thus
Finally, if we set and , then
Doing the same manner as above, we also have
and
Part 2. Large change in the solution: We shall construct the solution of problem (1) with respect to the random data. Noting that is a trigonometric polynomial with order less than n (with respect to the variable x) and less than m (with respect to the variable y). Using (31) with , , and we have
we deduce
Since for all , we deduce
Therefore, we get the inequality expectation
Here, we need to estimate the terms , and . By using the Parseval’s identity, we first see that
Since the noises are mutually independent and identically distributed , we obtain for all or . In addition, from (13) given that
Hence
Next, we estimate . Applying similar transform as in the previous step, we get
and we also have
Finally, the Parseval’s identity implies that
and using the Hölder’s inequality, we obtain
From the properties of Brownian motion, we known that for all or and , thus
Substituting (26)–(28) into (25), we have
and then
As tend to infinity, it shows that
whereas
From the above proposition, we see that a small change in the data leads to a significant change in the solution of the problem. Thus, we can conclude that the problem (1) is ill-posed in the Hadamard sense. Hence, a regularization is in order.
5. Regularization and Error Estimate
5.1. Nonparametric Estimate for Functional Data
In this section, we consider a nonparametric regression model which are developed when the predictor is a function valued random variable ; ; , based on a representation of the unknown regression function by the model
where are as in the introduction, are independent and identically distributed random variables with distribution . Our goal in this section is to find an estimated function for from random data at grid points .
The finite dimensional subspace , , of is closed [8] (page 362). Moreover, the projection Theorem [9] (page 130) leads to the following Corollary.
Corollary 1.
Let be a closed subspace of the Hilbert space . For each there is unique closest function such that
In the statistic sense, the function f is unknown, we only know its observed values, , at discrete points . The estimate function for f in subspace is
The Lemma below gives us a result of the function which satisfies (29).
Lemma 9.
Problem (29) has a unique solution
Proof.
Since , its Fourier expansion has a form
then Equation (29) becomes
Let the variables function
Here, our goal is to find such that has the minimum value. A necessary and sufficient condition to get that point is
for all , . Based on (13), we obtain
Hence, the estimate function for f is
as desired. □
5.2. Regularized Solution
In reality, we only have observation values of the functions at grid points instead of known . Using Lemma 9, the estimation of is
Choosing two integer numbers in such a way that , , we will find a solution of the problem on the subspace such that
Using Lemma 8, we deduce that the system (30) has a unique solution
5.3. Convergence Estimate
The main result in this section is to study the convergence rate of the estimator. We recall the regularized solution of the problem (1) as shown above:
which is constructed from the observation data at grid points , ; of unknown functions , respectively. The theorem below will show that a suitable choosing regularization parameter is necessary.
Theorem 1 (Convergence estimate for the regularized solution).
Let , , and , , . Assume that problem (1) has unique solution . For large enough,
there is a constant Ψ such that
Remark 2.
Let us consider the equality By choosing the integer number such that
where is integer number which is a truncation of a real number x. The mean squared error, is of order .
Proof.
We have
Here, we find the upper bounds for , , and to by six steps below. We first proceed to step 1.
Step 1. Estimate : Using the fact that
the Parseval’s identity implies that
Since the noises are mutually independent and identically distributed , we obtain for all or . Hence
In addition, we also have
and . Thus
Step 2. Estimate : Applying a similar manner as in Step 1, we have
and the Parseval’s identity give us
Because of mutually independent and identically properties of normal distribution, we have
Step 3. Estimate :
From the Parseval’s identity, we obtain
and using the Hölder’s inequality, we get
From the properties of Brownian motion, we know that for all or and . Hence
Step 4. Estimate and . The Parseval’s identity implies that
Moreover, Lemma 5 also give us the upper bound. We deduce
By a similar transform, as above, we get
Step 5. Estimate . Applying the Parseval’s identity, we have
and using the Hölder’s inequality, we have
The Lemma 7 give us the upper bound of . Hence
Step 6. Estimate :
If the condition (33) holds, then by combining six steps above, we obtain
where
This completes the proof. □
6. Numerical Example
6.1. The Ill-Posedness of the Problem
In this subsection, we implement the numerical experiment to illustrate the ill-posedness of the problem which presented in Section 4. For convenience, let us assign the change in the data as following
the change in the solution
In this situation, we set , , and . Observation value of , g, h follow the random models, see Figure 1,
Figure 1.
The exact data and their observation value at time .
The value of and are given in Table 1. Through this result, we clearly see that the smaller , the larger will be, when increases from 5 to 50.
Table 1.
A small change in the data result in a large change in the solution.
6.2. Convergence Behavior of the Regularized Solution
In this section, we present an example in order to illustrate the efficiency of the proposed methods. We consider following Cauchy problem:
where , and . This system has the exact solution .
The observation data at grid points ; ; of functions are
for all ; . For fixed t, the matrix form of the regularized solution will be
the elements of are computed as
The errors are esimated by
In this numerical example, we keep the fixed value of regularization parameters with . We carried out the numerical calculations for two cases with different observation points; the first one for , and another one for . From Table 2, it shows that the error is reduced once the spatial observation points are increased; on the other hand the convergence rate has been increased once time t tends to 0. This reflects the behavior of the rate of convergence in Theorem 1. For a more intuitive look, in Figure 2, we show the 3D graphs of the exact solution and regularized solution at , where we chose and .
Table 2.
Numerical errors
Figure 2.
3D graphs of exact solution at time , and the regularized solution for the regularization parameters of and .
7. Conclusions
In this work, we considered the problem of finding the solution for the 2-D inhomogeneous elliptic equation with initial data and source pertubed by random noise. We first estimate the initial functions and source function using the nonparametric least square regression method in statistic manner. Then we approximated Fourier coefficients by which is the function of the data set. This problem is ill-posed, hence a regularization is needed. Eventually, we have carried out the numerical example, and validated the regularized solution against the exact solution, it shows the numerical errors have been reduced once the number of spatial observation points is increased; on the other hand the convergence rate is increased once t tends to zero.
Author Contributions
All authors contributed equally to this work, as well as to its preparation. They have read and approved the final manuscript.
Funding
This research was funded by National Research Foundation of Korea grant number NRF-2015R1D1A1A01060880. The third author would like to thank to the support from the National Research Foundation of Korea grant (NRF-2015R1D1A1A01060880).
Acknowledgments
Many thanks to Professor Nguyen Huy Tuan for discussing and helping to develop this paper. The authors also would like to thank the anonymous reviewers for their valuable and constructive comments to improve our manuscript.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Lavrentev, M.M.; Romanov, V.G.; Shishatskii, S.P. Ill-posed Problems of Mathematical Physics and Analysis; Translations of Mathematical Monographs; American Mathematical Society: Providence, RI, USA, 1986; Volume 64. [Google Scholar]
- Heyvaerts, J.; Lasry, J.M.; Schatzman, M.; Witomski, P. Solar flares: A non linear eigenvalue problem in an unbounded domain. In Bifurcation and Nonlinear Eigenvalue Problems; Lecture Notes in Mathematics 782; Springer: Berlin, Germany, 1980; pp. 160–191. [Google Scholar]
- Johnson, C.R. Computational and numerical methods for bioelectric field problems. Crit. Rev. Biomed. Eng. 1997, 25, 1–81. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Tuan, N.H.; Thang, L.D.; Khoa, V.A. A modified integral equation method of the nonlinear elliptic equation with globally and locally Lipschitz source. Appl. Math. Comput. 2015, 256, 245–265. [Google Scholar] [CrossRef] [Scilit]
- Tuan, N.H.; Binh, T.T.; Viet, T.Q.; Lesnic, D. On the Cauchy problem for semilinear elliptic equations. J. Inverse Ill-Posed Probl. 2016, 24, 123–138. [Google Scholar] [CrossRef] [Scilit]
- Haase, M. Functional Analysis: An Elementary Introduction; American Mathematical Society: Providence, RI, USA, 2014. [Google Scholar]
- Eubank, R.L. Nonparametric Regression and Spline Smoothing; CRC Press: Boca Raton, FL, USA, 1999. [Google Scholar]
- Salsa, S. Partial Differential Equations in Action From Modelling to Theory; Springer: Berlin, Germany, 2008. [Google Scholar]
- Hunter, J.K.; Nachtergaele, B. Applied Analysis; World Scientific Publishing Company: Singapore, 2001. [Google Scholar]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

