You are currently viewing a new version of our website. To view the old version click .
Mathematics
  • Article
  • Open Access

28 May 2019

A Numerical Approximation Method for the Inverse Problem of the Three-Dimensional Laplace Equation

and
1
School of Mathematics and Statistics, NingXia University, Yinchuan 750021, China
2
College of Mathematics and Information Science and Technology, Hebei Normal University of Science and Technology, Qinhuangdao 066004, China
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Numerical Analysis: Inverse Problems – Theory and Applications

Abstract

In this article, an inverse problem with regards to the Laplace equation with non-homogeneous Neumann boundary conditions in a three-dimensional case is investigated. To deal with this problem, a regularization method (mollification method) with the bivariate de la Vallée Poussin kernel is proposed. Stable estimates are obtained under a priori bound assumptions and an appropriate choice of the regularization parameter. The error estimates indicate that the solution of the approximation continuously depends on the noisy data. Two experiments are presented, in order to validate the proposed method in terms of accuracy, convergence, stability, and efficiency.

1. Introduction

The inverse problem of the Laplace equation appears in many engineering and physical areas, such as geophysics, cardiology, seismology, and so on [1,2,3]. It has been widely recognized that the inverse problem for the Laplace equation has a central position in all Cauchy problems of elliptic partial differential equations. The inverse problem of the Laplace equation is seriously ill-posed, where a tiny deviation in the data can cause a large error in the solution [4]. It is difficult to develop numerical solutions with conventional methods. Some different methods have been researched, such as the quasi-reversibility [5], Tikhonov regularization [6], wavelet [7], conjugate gradient [8], central difference [9], Fourier regularization [10], and mollification [11,12,13] methods.
The main procedure of the mollification method is using the kernel function to construct a mollification operator by convolution with the measurement data. Manselli, Miller [14], and Murio [15,16] constructed mollification operators by using the Weierstrass kernel to solve some inverse heat conduction problems (IHCP). There have been reports on using the Gaussian kernel to solve the Cauchy problem of elliptic equations [17,18,19,20,21]. Hào [22,23,24] adopted the Dirichlet kernel and de la Vallée Poussin kernel to solve some kinds of two-dimensional equations; including the two-dimensional Laplace equation. However, the three-dimensional case was not considered, Moreover, the analysis method used for error estimate was does not generalize to the three-dimensional case well.
Our primary interest is to solve the inverse problem of the three-dimensional Laplace equation with non-homogeneous Neumann boundary conditions. In order to guarantee solvability for the inverse problem provided, a regularization method using the bivariate de la Vallée Poussin kernel is presented.
This paper is organized as follows: In Section 2, the mathematical problem for the three-dimensional Laplace equation and its ill-posedness are illustrated. In Section 3, we introduce the bivariate de la Vallée Poussin kernel and its properties, following which our mollification regularization method is proposed. In Section 4, some stability estimate results are given, in the interior 0 < z < d and at the boundary z = d , under a priori assumptions. The numerical aspect of our proposed method is showed in Section 5. Concluding remarks are given in Section 6.

2. Mathematical Problem and the Ill-Posedness Analysis

We give thought to the following inverse problem of the three-dimensional Laplace equation with non-homogeneous Neumann boundary conditions:
u ( x , y , z ) = 0 , ( x , y ) R 2 , 0 < z < d , u ( x , y , 0 ) = g ( x , y ) , ( x , y ) R 2 , u z ( x , y , 0 ) = h ( x , y ) , ( x , y ) R 2 ,
where Δ = 2 x 2 + 2 y 2 + 2 z 2 is three-dimensional Laplace operator; and g ( x , y ) , h ( x , y ) are given vectors in L 2 ( R 2 ) . The solution u ( x , y , z ) will be determined by the noisy data g δ ( x , y ) and h δ ( x , y ) in L 2 ( R 2 ) that satisfy:
g g δ L 2 ( R 2 ) + h h δ L 2 ( R 2 ) δ ,
were δ > 0 denotes the error level, and · L 2 ( R 2 ) denotes the L 2 norm [1].
Note that the solution of the problem (1) is the sum u = u 1 + u 2 of the solutions for the following two problems:
u 1 ( x , y , z ) = 0 , ( x , y ) R 2 , 0 < z < d , u 1 ( x , y , 0 ) = g ( x , y ) , ( x , y ) R 2 , ( u 1 ) z ( x , y , 0 ) = 0 , ( x , y ) R 2 ,
and
u 2 ( x , y , z ) = 0 , ( x , y ) R 2 , 0 < z < d , u 2 ( x , y , 0 ) = 0 , ( x , y ) R 2 , ( u 2 ) z ( x , y , 0 ) = h ( x , y ) , ( x , y ) R 2 .
Therefore, in order to simplify the process of the Cauchy problem (1), we only need to solve problems (3) and (4), respectively.
For φ L 2 ( R 2 ) , the Fourier transform for a variable r = ( x , y ) R 2 is defined by
φ ^ ( ξ , z ) = 1 2 π R 2 e i ξ · r φ ( r , z ) d r ,
where ξ = ( ω , η ) R 2 and ξ · r = ω x + η y .
The inverse Fourier transform for a variable ξ = ( ω , η ) R 2 is defined by
φ ( r , z ) = 1 2 π R 2 e i ξ · r φ ^ ( ξ , z ) d ξ .
The Parseval equality [16] is as follows:
φ L 2 ( R 2 ) = φ ^ L 2 ( R 2 ) .
Adopting the Fourier transform for the variable r = ( x , y ) R 2 to problems (3) and (4), we obtain
( u 1 ) ^ z z = ( ω 2 + η 2 ) u 1 ^ , ( ω , η ) R 2 , 0 < z < d , ( u 1 ) ^ ( ω , η , 0 ) = g ^ ( ω , η ) , ( ω , η ) R 2 , ( u 1 ) ^ z ( ω , η , 0 ) = 0 , ( ω , η ) R 2 ,
and
( u 2 ) ^ z z = ( ω 2 + η 2 ) u 2 ^ , ( ω , η ) R 2 , 0 < z < d , ( u 2 ) ^ ( ω , η , 0 ) = 0 , ( ω , η ) R 2 , ( u 2 ) ^ z ( ω , η , 0 ) = h ^ ( ω , η ) , ( ω , η ) R 2 .
The solution of problem (6) is
u ^ 1 ( ω , η , z ) = g ^ ( ω , η ) cosh ( z ω 2 + η 2 ) .
Or
u 1 ( x , y , z ) = 1 2 π R 2 g ^ ( ω , η ) cosh ( z ω 2 + η 2 ) e i ξ · r d ξ .
The solution of problem (7) is
u ^ 2 ( ω , η , z ) = h ^ ( ω , η ) sinh ( z ω 2 + η 2 ) ω 2 + η 2 .
Or
u 2 ( x , y , z ) = 1 2 π R 2 h ^ ( ω , η ) sinh ( z ω 2 + η 2 ) ω 2 + η 2 e i ξ · r d ξ .
Note that cosh ( z ω 2 + η 2 ) and sinh ( z ω 2 + η 2 ) ω 2 + η 2 are unbounded with respect to the variable ( ω , η ) ; a small perturbation in the measured data g ^ ( ω , η ) and h ^ ( ω , η ) may result in a huge deviation in the solution u 1 ( x , y , z ) and u 2 ( x , y , z ) . Therefore, the problems (3) and (4) are severely ill-posed.

3. Mollification Method and Regularization Solution

3.1. Mollification Operator

The bivariate de la Vallée Poussin kernel [22] function is defined by:
V α ( x , y ) = ( cos ( α x ) cos ( 2 α x ) ) ( cos ( α y ) cos ( 2 α y ) ) α 2 x 2 y 2 ( α > 0 ) ,
where α > 0 is called the mollification radius (or mollification parameter). V α ( x , y ) has the following properties [22]:
(1)
V α ( z ) is an entire function of exponential type of degree α belong to L p ( R 2 ) ( 1 < p ) ;
(2)
1 π 2 R 2 V α ( x , y ) d x d y = 1 ;
(3)
1 π 2 R 2 | V α | d x d y < 12 ( α 1 ) ; and
(4)
V ^ α is the Fourier transform of V α ( x , y ) , satisfying:
2 π V ^ α ( ω , η ) = 1 , ( ω , η ) Δ α , Δ α : = { | ω | α , | η | α } ,
where
V ^ α ( ω , η ) = υ ( ω ) υ ( η )
and
υ ( ω ) = π 2 1 , | ω | < α , 2 ω α , α < | ω | 2 α , 0 , 2 α < | ω | ,
υ ( η ) = π 2 1 , | η | < α , 2 η α , α < | η | 2 α , 0 , 2 α < | η | .
For any function D α L 1 ( R 2 ) and f L p ( R 2 ) , 1 p , we define two-dimensional convolution [22] by
( D α f ) ( x , y ) = R 2 D α ( x , y ) f ( x x , y y ) d x d y .
It is well-known that [22]
( D α f ) ^ ( ω , η ) = 2 π D ^ α ( ω , η ) f ^ ( ω , η )
and
D α f L p ( R 2 ) D α L 1 ( R 2 ) f L p ( R 2 ) .
We define the mollification operator T α by T α : R 2 R 2
( T α g δ ) ( x , y ) = 1 π 2 ( V α g δ ) ( x , y ) , ( T α h δ ) ( x , y ) = 1 π 2 ( V α h δ ) ( x , y ) .
From (10), we have
( T α g δ ) ^ ( ω , η ) = 2 π V ^ α ( ω , η ) g ^ δ ( ω , η ) , ( T α h δ ) ^ ( ω , η ) = 2 π V ^ α ( ω , η ) h ^ δ ( ω , η ) .

3.2. Regularization Approximation Solution

Instead of solving the problems (3) and (4) with the data g δ ( x , y ) and h δ ( x , y ) , we attempt to re-construct the noisy data g δ ( x , y ) and h δ ( x , y ) by ( T α g δ ) ( x , y ) and ( T α h δ ) ( x , y ) , respectively. We obtain the problems, with the re-constructed data, as follows:
( u 1 ) x x α , δ + ( u 1 ) y y α , δ + ( u 1 ) z z α , δ = 0 , ( x , y , z ) Ω , u 1 α , δ ( x , y , 0 ) = ( T α g δ ) ( x , y ) , ( x , y ) R 2 , ( u 1 ) z α , δ ( x , y , 0 ) = 0 , ( x , y ) R 2 ,
and
( u 2 ) x x α , δ + ( u 2 ) y y α , δ + ( u 2 ) z z α , δ = 0 , ( x , y , z ) Ω , u 2 α , δ ( x , y , 0 ) = 0 , ( x , y ) R 2 , ( u 2 ) z α , δ ( x , y , 0 ) = ( T α h δ ) ( x , y ) , ( x , y ) R 2 .
The solution for problem (12) is
u ^ 1 α , δ ( ω , η , z ) = ( T α g δ ) ^ ( ω , η ) cosh ( z ω 2 + η 2 ) ,
or
u 1 α , δ ( x , y , z ) = 1 2 π R 2 ( T α g δ ) ^ ( ω , η ) cosh ( z ω 2 + η 2 ) d ω d η .
The solution to problem (13) is
u ^ 2 α , δ ( ω , η , z ) = ( T α h δ ) ^ ( ω , η ) sinh ( x ω 2 + η 2 ) ω 2 + η 2 ,
or
u 2 α , δ ( x , y , z ) = 1 2 π R 2 ( T α h δ ) ^ ( ω , η ) sinh ( x ω 2 + η 2 ) ω 2 + η 2 d ω d η .
According to (11) and the properties (2) and (3) of the kernel V α , we have the following conclusion:
Remark 1.
If g g δ L 2 ( R 2 ) δ and h h δ L 2 ( R 2 ) δ hold, then
T α g δ g L 2 ( R 2 ) 12 δ , T α h δ h L 2 ( R 2 ) 12 δ .

4. Parameter Selection and Error Estimates

Lemma 1.
For z ( 0 , d ] , the following inequalities hold
(1)
cosh ( z ω 2 + η 2 ) cosh ( d ω 2 + η 2 ) 2 e ( d z ) ω 2 + η 2 ,
(2)
cosh ( z ω 2 + η 2 ) < e z ω 2 + η 2 ,
(3)
sinh ( z ω 2 + η 2 ) sinh ( d ω 2 + η 2 ) e ( d z ) ω 2 + η 2 , and
(4)
sinh ( z ω 2 + η 2 ) ω 2 + η 2 < d e z ω 2 + η 2 .
Proof. 
Inequalities (1) and (2) are easy to obtain. From the inequalities
sinh ( z ω 2 + η 2 ) sinh ( d ω 2 + η 2 ) = e z ω 2 + η 2 e d ω 2 + η 2 · 1 e 2 z ω 2 + η 2 1 e 2 d ω 2 + η 2 e z ω 2 + η 2 e d ω 2 + η 2 ,
and the Taylor expansion
sinh ( z ω 2 + η 2 ) ω 2 + η 2 = n = 0 ( ω 2 + η 2 ) 2 n z 2 n + 1 ( 2 n + 1 ) ! d n = 0 ( z ω 2 + η 2 ) 2 n ( 2 n ) ! = d cosh ( z ω 2 + η 2 ) ,
we can arrive at (3) and (4). ☐
In the next content, we give stability convergence estimates between the exact solution for problems (3) and (4) and the regularization approximate solution of problems (12) and (13) in 0 < z < d and at the boundary z = d , respectively. Convergence estimates will be obtained when we choose a suitable regularization parameter α .

4.1. Error Estimates in the Interior

The convergence estimates for the proposed regularization method, in the case of 0 < z < d , will be given in this section, and we obtain the approximation results as following:
Theorem 1.
Let u 1 ( x , y , z ) and u 1 α , δ ( x , y , z ) be the exact solution and the approximation solution for problem (1) with the exact input data g ( x , y ) and mollified data, respectively. Assume the a priori bounds u 1 ( · , · , d ) L 2 ( R 2 ) E and g g δ L 2 ( R 2 ) δ hold. We have the following estimate:
u 1 u 1 α , δ L 2 ( R 2 ) < 118 E e ( d z ) α + 36 δ e 4 z α .
If α is selected as
α = 1 4 d ln ( E / δ ) ,
we have
u 1 u 1 α , δ L 2 ( R 2 ) < 118 E ( 3 d + z ) / 4 d δ ( d z ) / 4 d + 36 E z / d δ 1 z / d ,
where E is a finite positive constant.
Proof. 
From Parseval’s equality (5) and the properties of double integrals, we have
u 1 u 1 α , δ L 2 ( R 2 ) 2 = u ^ 1 u ^ 1 α , δ L 2 ( R 2 ) 2 = k = 1 25 D k | u ^ 1 u ^ 1 α , δ | 2 d ω d η = k = 1 16 D k | u 1 ^ | 2 d ω d η + k = 17 25 D k | u ^ 1 u ^ 1 α , δ | 2 d ω d η E 2 k = 1 16 ( sup D k | A ( ω , η ) | ) 2 + k = 17 25 D k | ( g ^ ( T α g δ ) ^ ) B ( ω , η ) | 2 d ω d η .
Here, R 2 = k = 1 25 D k (see Figure 1) and
A ( ω , η ) = cosh ( z ω 2 + η 2 ) cosh ( d ω 2 + η 2 ) , B ( ω , η ) = cosh ( z ω 2 + η 2 ) , ( ω , η R ) .
Figure 1. For every D k ( k = 1 , 2 , , 25 )
Furthermore,
k = 17 25 D k | ( g ^ ( T α g δ ) ^ ) B ( ω , η ) | 2 d ω d η = D 17 | ( g ^ ( 2 ω α ) ( 2 η α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 18 | ( g ^ ( 2 η α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 19 | ( g ^ ( 2 ω α ) ( 2 η α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 20 | ( g ^ ( 2 ω α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 21 | ( g ^ ( 2 ω α ) ( 2 η α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 22 | ( g ^ ( 2 η α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 23 | ( g ^ ( 2 ω α ) ( 2 η α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 24 | ( g ^ ( 2 ω α ) g ^ δ ) B ( ω , η ) | 2 d ω d η + D 25 | ( g ^ g ^ δ ) B ( ω , η ) | 2 d ω d η .
It is easy to verify that 9 < ( 2 ω α ) ( 2 η α ) < 16 , ( ω , η ) D 17 ,
D 17 = ( 2 α , α ) × ( 2 α , α ) .
From Minkowski’s inequality, we have
( D 17 | ( g ^ ( 2 ω α ) ( 2 η α ) g ^ δ ) B ( ω , η ) | 2 d ω d η ) 1 / 2 = ( g ^ ( 2 ω α ) ( 2 η α ) g ^ δ ) B ( ω , η ) L 2 ( D 17 ) g ^ B ( ω , η ) L 2 ( D 17 ) + 16 ( g ^ δ g ^ + g ^ ) B ( ω , η ) L 2 ( D 17 ) 17 g ^ B ( ω , η ) L 2 ( D 17 ) + 16 ( g ^ δ g ^ ) B ( ω , η ) L 2 ( D 17 ) 17 E sup D 17 | A ( ω , η ) | + 16 δ sup D 17 | B ( ω , η ) | .
Using a similar analysis, we can obtain the integral estimates of the other D k ( k = 18 , , 24 ) .
Utilizing the inequality A + B + C < A + B + C ( A > 0 , B > 0 , C > 0 ) , we have
u 1 u 1 α , δ L 2 ( R 2 ) = u ^ 1 u ^ 1 α , δ L 2 ( R 2 ) E k = 1 16 sup D k | A ( ω , η ) | + k = 17 25 ( D k | ( g ^ ( T α g δ ) ^ ) B ( ω , η ) | 2 d ω d η ) 1 / 2 .
According to (1) and (2) of Lemma 1, we obtain
u 1 u 1 α , δ L 2 ( R 2 ) 2 E ( 4 e 2 2 ( d z ) α + 8 e 5 ( d z ) α + 4 e 2 ( d z ) α ) + ( 34 E e ( d z ) 2 α + 16 δ e 2 2 z α ) + ( 10 E e ( d z ) α + 4 δ e 5 z α ) + ( 10 E e ( d z ) 2 α + 4 δ e 2 2 z α ) + ( 4 E e ( d z ) α + δ e 5 z α ) + ( 4 E e ( d z ) 2 α + δ e 2 2 z α ) + ( 4 E e ( d z ) α + δ e 5 z α ) + ( 10 E e ( d z ) 2 α + 4 δ e 2 2 z α ) + ( 10 E e ( d z ) α + 4 δ e 5 z α ) + δ e 2 z α 118 E e ( d z ) α + 36 δ e 2 2 z α < 118 E e ( d z ) α + 36 δ e 4 z α .
Taking parameter α to be α = 1 4 d ln ( E / δ ) , we arrive at (16). ☐
Similarly, the error estimate for problem (4) can be obtained in the following way.
Theorem 2.
Let u 2 ( x , y , z ) and u 2 α , δ ( x , y , z ) be the exact solution and approximation solution for problem (4) with the exact input data h ( x , y ) and mollified data, respectively. Assume that the a priori bounds u 2 ( · , · , d ) L 2 ( R 2 ) E and h h δ L 2 ( R 2 ) δ hold, we have
u 2 u 2 α , δ L 2 ( R 2 ) < 59 E e ( d z ) α + 36 d δ e 4 z α .
If α is chosen as in (15), then we have
u 2 u 2 α , δ L 2 ( R 2 ) < 59 E ( 3 d + z ) / 4 d δ ( d z ) / 4 d + 36 d E z / d δ 1 z / d .
As for our problem (1), combining the results of Theorems 1 and 2 and the Minkowski inequality, we have the error estimate, as follows:
Theorem 3.
Let u ( x , y , z ) and u α , δ ( x , y , z ) be the exact solution and regular solution for problem (1). Assume that condition (2) and max { u 1 ( · , · , d ) L 2 ( R 2 ) , u 2 ( · , · , d ) L 2 ( R 2 ) } E hold. Then, we have
u u α , δ L 2 ( R 2 ) < 177 E e ( d z ) α + 36 ( d + 1 ) δ e 4 z α .
If α is chosen as in (15), then we have
u u α , δ L 2 ( R 2 ) < 177 E ( 3 d + z ) / 4 d δ ( d z ) / 4 d + 36 ( d + 1 ) E z / d δ 1 z / d .

4.2. Error Estimates at the Boundary

The estimates (14), (17), and (19) give no information about the error estimates at z = d , as the constraints u 1 ( · , · , d ) L 2 ( R 2 ) E and u 2 ( · , · , d ) L 2 ( R 2 ) E are too weak for this purpose. Therefore, to ensure stability of the solution u 1 ( x , y , z ) , u 2 ( x , y , z ) at z = d , we need the Sobolev space H p ( R 2 ) ( p 0 ) [1],
H p ( R 2 ) = { φ ( x , y ) L 2 ( R 2 ) : φ H p ( R 2 ) < } ,
where · H p ( R 2 ) is defined by
φ ( · , · , d ) H p ( R 2 ) = ( 1 + ω 2 + η 2 ) p / 2 φ ^ ( ω , η , d ) L 2 ( R 2 ) .
If p = 0 , then H 0 = L 2 ( R 2 ) .
Theorem 4.
Let u 1 ( x , y , d ) and u 1 α , δ ( x , y , d ) be the exact and regularization solutions, respectively, of problem (3) at z = d . Suppose that the a priori bounds u 1 ( · , · , d ) H p ( R 2 ) E p ( p > 0 ) and g g δ L 2 ( R 2 ) δ hold. Then, we have the following inequality
u 1 ( · , · , d ) u 1 α , δ ( · , · , d ) L 2 ( R 2 ) < 59 E p ( 1 + α 2 ) p / 2 + 36 δ e 4 d α .
If the regular parameter α is selected as
α = 1 8 d ln ( E p / δ ) ,
then we have
u 1 ( · , · , d ) u 1 α , δ ( · , · , d ) L 2 ( R 2 ) < 59 E p ( 8 d ln ( E p / δ ) ) p + 36 E p 1 / 2 δ 1 / 2 ,
where E p is a positive constant only depending on p.
Proof. 
From Parseval’s equality (5), we have
u 1 ( · , · , d ) u 1 α , δ ( · , · , d ) L 2 ( R 2 ) 2 = u 1 ^ ( · , · , d ) u 1 ^ α , δ ( · , · , d ) L 2 ( R 2 ) 2 = k = 1 25 D k | u 1 ^ ( · , · , d ) u 1 ^ α , δ ( · , · , d ) | 2 d ω d η = k = 1 16 D k | u ^ ( · , · , d ) | 2 d ω d η + k = 17 25 D k | u 1 ^ ( · , · , d ) u 1 ^ α , δ ( · , · , d ) | 2 d ω d η ,
where D k ( k = 1 , 2 , , 25 ) are same as in Theorem 1. Let
R ( ω , η ) = 1 ( 1 + ω 2 + η 2 ) p / 2 ( ω , η R ) .
Using the properties of the double integral, and the inequality A + B + C < A + B + C ( A > 0 , B > 0 , C > 0 ) , we have
u 1 ( · , · , d ) u 1 α , δ ( · , · , d ) L 2 ( R 2 ) E k = 1 16 sup D k | R ( ω , η ) | + k = 17 25 ( D k | u 1 ^ ( · , · , d ) u 1 ^ α , δ ( · , · , d ) | 2 d ω d η ) 1 / 2 .
Using a similar method as in Theorem 1 and the monotonicity of the function R ( ω , η ) , we obtain
u 1 ( · , · , d ) u 1 α , δ ( · , · , d ) L 2 ( R 2 ) < 59 E p ( 1 + α 2 ) p / 2 + 36 δ e 4 d α .
If we chose α as α = 1 8 d ln ( E p / δ ) and utilize inequality 1 + α 2 > α 2 , then (23) can be obtained. ☐
Similar to Theorem 4, the error estimate for problem (4) can be obtained as follows.
Theorem 5.
Let u 2 ( x , y , d ) and u 2 α , δ ( x , y , d ) be the exact and regularization solutions, respectively, for problem (4) at z = d . Suppose that the a priori bounds u 2 ( · , · , d ) H p ( R 2 ) E p and h h δ L 2 ( R 2 ) δ hold. Then, we have the following inequality
u 2 ( · , · , d ) u 2 α , δ ( · , · , d ) L 2 ( R 2 ) < 59 E p ( 1 + α 2 ) p / 2 + 36 d δ e 4 d α .
If the regularization parameter α is chosen as in (22), then
u 2 ( · , · , d ) u 2 α , δ ( · , · , d ) L 2 ( R 2 ) < 59 E p ( 8 d ln ( E p / δ ) ) p + 36 d E p 1 / 2 δ 1 / 2 .
Thus, as for problem (1), using the results of Theorems 4 and 5 and the Minkowski inequality, we have the stable error estimate, as follows:
Theorem 6.
Let u ( x , y , d ) and u α , δ ( x , y , d ) be the exact and regularization solutions, respectively, for problem (1) at z = d . Suppose that condition (2) and max { u 1 ( · , · , d ) H p ( R 2 ) , u 2 ( · , · , d ) H p ( R 2 ) } E p ( p > 0 ) hold. We have the convergence estimate, as follows:
u ( · , · , d ) u α , δ ( · , · , d ) L 2 ( R 2 ) < 118 E p ( 1 + α 2 ) p / 2 + 36 ( d + 1 ) δ e 4 d α .
If the regularization parameter α is selected as in (22), then
u ( · , · , d ) u α , δ ( · , · , d ) L 2 ( R 2 ) < 118 E p ( 8 d ln ( E p / δ ) ) p + 36 ( d + 1 ) E p 1 / 2 δ 1 / 2 .
Remark 2.
In this part, we consider the stable error estimates in the cases 0 < z < d and z = d , respectively. In the interior, 0 < z < d , the a priori bound for u ( · , · , d ) L 2 ( R 2 ) is sufficient, and the convergence estimate converges quickly to zero as δ 0 + . However, for the case z = d , although a stronger a priori bound for u ( · , · , d ) H p ( R 2 ) ( p > 0 ) is imposed, the error estimate is only of logarithmic type, with order ( ln ( E p / δ ) ) p ( p > 0 ) .

5. Numerical Examples

We performed two numerical examples to verify the accuracy and stability of our proposed method. Our tests were carried out in the MATLAB R2014b software.
In the numerical examples, we selected the discrete interval to be D = [ 6 γ , 6 + γ ] × [ 6 γ , 6 + γ ] ( γ = 1 × 10 3 ) and the measurement data ϕ δ ( x , y ) was obtained as the following
ϕ δ ( x , y ) = ϕ + ϵ ( 2 r a n d n ( s i z e ( ϕ ) ) 1 ) ,
where
ϕ = ( ϕ ( x i , y j ) ) N × N , x i = 6 + 12 ( i 1 ) N 1 , y j = 6 + 12 ( j 1 ) N 1 , i , j = 1 , 2 , , N .
The error level δ is given by
δ = ϕ ϕ δ l 2 ( D ) = 1 N × N i = 1 N j = 1 N ( ϕ ( x i , y j ) ϕ δ ( x i , y j ) ) 2 .
In the following numerical implementations, we need to take the two-dimensional discrete Fourier transform of the data vector ϕ δ ( x , y ) and the two-dimensional discrete inverse Fourier transform. We take d = 1 , N = 15 , and fix the reconstructed position z = 0.3 . The a priori mollification parameter α was determined by (15) and (22), where φ ( · , · , d ) l 2 ( D ) = E and φ ( · , · , d ) H p ( D ) = E p . We define the relative error between the exact solution u and its approximate solution u α , δ as:
r e l ( u ) = u u α , δ l 2 ( D ) u l 2 ( D ) .
Example 1.
We chose the function g ( x , y ) = x y e x 2 y 2 as the exact data for problem (3).
Example 2.
We chose the function h ( x , y ) = e 36 36 + x 2 36 36 + y 2 as the exact data for problem (4).
We use different perturbation noise levels at the boundary z = 1 with p = 0.5 and p = 3 , respectively, in Table 1 and Table 2. Note that the results for the relative error r e l ( u ) at z = 1 depended on the error level, δ , and p.
Table 1. Example 1: Relative Error at z = 1 , p = 0.5 and p = 3 .
Table 2. Example 2: Relative Error at z = 1 , p = 0.5 and p = 3 .
Figure 2 and Figure 3 show the re-constructed solution and exact solution of Example 1, corresponding to noise levels of δ = 1 × 10 10 and δ = 2 × 10 8 , with z = 0.3 and z = 1 , respectively. Figure 4 shows the corresponding error between (a) and (b) in Figure 2 and Figure 3.
Figure 2. Example 1: δ = 1 × 10 10 , z = 0.3 : (a) Exact solution, and (b) approximation solution.
Figure 3. Example 1: For δ = 2 × 10 8 , z = 1 : (a) Exact solution, and (b) approximation solution.
Figure 4. Example 1: (a) The error between (a) and (b) in Figure 2, and (b) the error between (a) and (b) in Figure 3.
Figure 5 and Figure 6 show the regularization solution and exact solution of Example 2, corresponding to noise levels of δ = 1 × 10 10 and δ = 2 × 10 8 with z = 0.3 and z = 1 , respectively. Figure 7 shows the corresponding error between (a) and (b) in Figure 5 and Figure 6.
Figure 5. Example 2: δ = 1 × 10 10 , z = 0.3 : (a) Exact solution, and (b) approximation solution.
Figure 6. Example 2: For δ = 2 × 10 8 , z = 1 : (a) Exact solution, and (b) approximation solution.
Figure 7. Example 2: (a) The error between (a) and (b) in Figure 5, and (b) the error between (a) and (b) in Figure 6.
In the two examples, we note that the methods which we adopted are stable and effective.

6. Conclusions

In this article, we use a regularization method to solve two Cauchy problems for the three-dimensional Laplace equation. Stable approximate estimates are obtained under a priori bound assumptions and an appropriate choice of the regular parameter. Two numerical examples are investigated to verify the stability of our presented method.
We consider stability error estimates in the cases 0 < z < d and z = d , respectively. In the interior, 0 < z < d , the convergence estimate is O ( δ λ ) ( λ > 0 ) , which quickly converges to zero as δ 0 + . However, at the boundary, z = d , the error estimate is of logarithmic type with order ( ln ( E p / δ ) ) p ( p > 0 ) . In future work, we hope to find a new a priori assumption method, in order to obtain an error estimation which achieves better results.

Author Contributions

All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.

Funding

Thanks to the National Science Foundation of China (11161036). Thanks to the Natural Science Research Foundation of Ningxia Province, China (NR17260)(NR160117).

Acknowledgments

The authors are deeply indebted to the anonymous referees for their very careful reading and valuable comments and suggestions which immensely improved the previous version of our manuscript.

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Tikhonov, A.N.; Arsenin, V.Y. Solutions of Ill-Posed Problems; Winson: Washington, DC, USA, 1977; pp. 10–80. [Google Scholar]
  2. Colli-Franzone, P.; Magenes, E. On the inverse potential problem of electrocardiology. Calcolo 1980, 10, 459–538. [Google Scholar]
  3. Alessandrini, G. Stable determination of a crack from boundary measurements. Proc. R. Soc. Edinb. 1993, 123, 497–516. [Google Scholar] [CrossRef]
  4. Hadamard, J. Lectures on the Cauchy Problem in Linear Partial Differential Equations; Yale University Press: New Haven, CT, USA, 1923. [Google Scholar]
  5. Klibanov, M.V.; Santosa, F. A computational quasi-reversibility method for Cauchy problems for Laplace equation. SIAM J. Appl. 1991, 56, 1653–1675. [Google Scholar] [CrossRef]
  6. Reinhardt, H.J.; Han, H.; Hào, D.N. Stability and regularization of a discrete approximation to the Cauchy problem for Laplace’s equation. SIAM J. Numer. Anal. 1999, 36, 890–905. [Google Scholar] [CrossRef]
  7. Wang, W.F.; Wang, J.R. Wavelet solution to the three-Dimensional Cauchy problem for Laplace equation. J. Math. 2012, 36, 239–248. [Google Scholar]
  8. Hào, D.N.; Lesnic, D. The Cauchy problem for Laplace’s equation via the conjugate gradient method. IMA J. Appl. Math. 2000, 65, 199–217. [Google Scholar] [CrossRef]
  9. Xiong, X.T.; Fu, C.L. Central difference regularization method for the Cauchy problem of the Laplace’s equation. Appl. Math. Comput. 2006, 181, 675–684. [Google Scholar] [CrossRef]
  10. Fu, C.L.; Li, H.F.; Qian, Z.; Xiong, X.T. Fourier regularization method for solving a Cauchy problem for the Laplace equation. Inverse Probl. Sci. Eng. 2008, 16, 159–169. [Google Scholar] [CrossRef]
  11. Li, Z.P.; Fu, C.L. A mollification method for a Cauchy problem for the Laplace equation. Appl. Math. Comput. 2011, 217, 9209–9218. [Google Scholar] [CrossRef]
  12. Ang, D.D.; Nghia, N.H.; Tam, N.C. Regularized solutions of a Cauchy Problem for Laplace Equation in an irregular layer: A three dimensional model. Acta Math. Vietnam. 1998, 23, 65–74. [Google Scholar]
  13. Cheng, J.; Hon, Y.C.; Wei, T.; Yamamoto, M. Numerical computation of a Cauchy Problem for Laplace’s equation. Zammz. Angew. Math. Mech. 2001, 81, 665–674. [Google Scholar] [CrossRef]
  14. Manselli, P.; Miller, K. Calculation of the surface temperature and heat flux on one side of a wall from measurements on the opposite side. Ann. Mat. Pura Appl. 1980, 123, 161–183. [Google Scholar] [CrossRef]
  15. Murio, D.A. Numerical method for inverse transient heat conduction problems. Rev. De La Unión Matemátic Argentina 1981, 30, 25–46. [Google Scholar]
  16. Murio, D.A. On the estimation of the boundary temperature on a sphere from measurements at its center. J. Comp. Appl. Math. 1982, 8, 111–119. [Google Scholar] [CrossRef]
  17. Hao, C.; Li, F.X.; Fu, C.L. A mollification regularization method for the Cauchy problem of an elliptic equation in a multi-dimensional case. Inverse Probl. Sci. Eng. 2010, 18, 971–982. [Google Scholar]
  18. Xiong, X.T.; Shi, W.X.; Fan, X.Y. Two numerical methods for a Cauchy problem for modified Helmholtz equation. Appl. Math. Model. 2011, 35, 4915–4920. [Google Scholar] [CrossRef]
  19. Yang, F.; Fu, C.L.; Li, X.X. A mollification regularization method for identifying the time-dependent heat source problem. J. Eng. Math. 2016, 100, 67–80. [Google Scholar] [CrossRef]
  20. Xiong, X.T.; Mao D, L.; Cao, X.X. A mollification method for solving the Cauchy problem for the modified Helmholtz equation. J. Northwest Univ. (Nat. Sci.) 2018, 53, 1–7. [Google Scholar]
  21. Ern, A.; Guermond, J.L. Mollification in strongly Lipschitz domains with application to continuous and discrete de Rham complexes. Comput. Methods Appl. Math. 2016, 16, 51–75. [Google Scholar] [CrossRef]
  22. Hào, D.N. A mollification method for ill-posed problems. Numer. Math. 1994, 68, 469–506. [Google Scholar]
  23. Hào, D.N. A mollification method for a Noncharacteristic Cauchy Problem for a Parabolic Equation. Math. Anal. Appl. 1996, 199, 873–909. [Google Scholar] [CrossRef]
  24. Hào, D.N.; Hien, P.M.; Sahli, H. Stability results for a Cauchy problem for an elliptic equation. Inverse Probl. 2007, 23, 421–461. [Google Scholar] [CrossRef]

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.