Next Article in Journal
BroadBand-Adaptive VMD with Flattest Response
Previous Article in Journal
Improved Beluga Whale Optimization for Solving the Simulation Optimization Problems with Stochastic Constraints
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Method for a Cauchy Problem for Multi-Dimensional Laplace Equation with Bilateral Exponential Kernel

School of Mathematics and Statistics, Ningxia University, Yinchuan 750021, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(8), 1855; https://doi.org/10.3390/math11081855
Submission received: 16 March 2023 / Revised: 7 April 2023 / Accepted: 7 April 2023 / Published: 13 April 2023

Abstract

:
This study examined a Cauchy problem for a multi-dimensional Laplace equation with mixed boundary. This problem is severely ill-posed in the sense of Hadamard. To solve this problem, a mollification approach is suggested based on a bilateral exponential kernel and this is a new approach. The stable error estimates are obtained under the priori and posteriori rule, in which the numerical findings are much influenced by the unknown a priori information. An error estimate between the exact and regular solution is given. A numerical experiment of interest reveals that our procedure is efficient and stable for perturbation noise in the data.

1. Introduction

The Laplace equation’s inverse problem appears in numerous engineering and physical areas, for example, cardiology, geophysics, seismology, and so on [1,2,3]. The Cauchy problem of the Laplace equation plays a crucial role in all inverse problems of elliptic partial differential equations. Particularly, the Cauchy problem for the multi-dimensional Laplace equation. The Laplace equation’s inverse problem is severely ill-posed in the sense of Hadamard, where a tiny deviation in the data can cause a substantial error in the solution [4]. Thus, we require to use a regularization method to solve the ill-posed problem. Several approaches have been provided. The readers can consult the Tikhonov regularization [5], quasi-reversibility [6], wavelet [7], conjugate gradient [8], the central difference [9], Fourier regularization [10], and mollification [11,12,13] methods, etc.
The primary step of the mollification method is to build a mollification operator by convolving a kernel function with the determined data. Manselli, Miller [14] and Murio [15,16] constructed mollification operators using the Weierstrass kernel to address some inverse heat conduction problems (IHCP). The Cauchy problem of an elliptic equation employing the Gaussian kernel function has been reported [17,18,19,20,21]. Hào [22,23,24] adopted the de la Vallée Poussin kernel and Dirichlet kernel to solve some types of two-dimensional equations, such as the two-dimensional Laplace equation. However, the multi-dimensional case was not considered. Furthermore, the analytical methods employed for error estimation do not generalize well to multi-dimensional cases. In our practical application, we often need to consider the application of the Laplace equation in multi-dimensional cases. This is why we adopt the mollification method based on the bilateral exponential kernel to solve the multi-dimensional Laplace problem. The refs. [25,26] are related to the work.
The primary aim of this study is to solve the multi-dimensional Laplace equation’s inverse problem with mixed boundary conditions. To guarantee solvability for the inverse problem offered, a regularization method using the bilateral exponential kernel is presented and we will show that our approach is stable and effective in 0 < x < 1 and at boundary x = 1 .
The study is organized as follows: In Section 2, the ill-posed of the problem (1) is illustrated. In Section 3, we introduce the bilateral exponential kernel and its certain properties and suggest our mollification method. In Section 4, some error estimate findings are given in 0 < x < 1 and x = 1 . The efficiency of the approach is depicted in Section 5 through numerical experiments. Section 6 presents the summary and conclusions.

2. Model Problem and Its Ill-Posedness

We consider the following Cauchy problem for a multi-dimensional Laplace equation with a mixed boundary condition:
Consider the following:
Δ u ( x , y ) = 0 , 0 < x < 1 , y R n , u ( 0 , y ) = φ ( y ) , y R n , u x ( 0 , y ) = ψ ( y ) , y R n .
where Δ = 2 y 1 2 + 2 y 2 2 + + 2 y n 2 is a multi-dimensional Laplace operator. We need to obtain the solution u ( x , y ) from the data φ ( y ) , ψ ( y ) , but φ ( y ) , ψ ( y ) can only be measured and there are measurement errors. We know some data functions φ δ ( y ) , ψ δ ( y ) such that
φ δ φ δ , ψ δ ψ δ .
Here, constant δ > 0 represents the level of error,
f ( . ) H p : = ( + ( 1 + ξ 2 ) p | f ^ ( ξ ) | 2 d ξ ) 1 2 .
f ^ ( ξ ) is the Fourier transform of function f ( y ) for the y R n ,
f ^ ( ξ ) = 1 ( 2 π ) n / 2 R n f ( y ) e i ξ . y d y , y R n .
The inverse Fourier transform of function f ( y ) is
f ( y ) = 1 ( 2 π ) n / 2 R n f ^ ( ξ ) e i ξ . y d ξ .
If p = 0 , then H 0 ( R n ) = L 2 ( R n ) .
Obviously, the solution of the problem (1) is the sum of solutions for the following two Cauchy problems:
Δ u 1 ( x , y ) = 0 , 0 < x < 1 , y R n , u 1 ( 0 , y ) = φ ( y ) , y R n , ( u 1 ) x ( 0 , y ) = 0 , y R n
and
Δ u 2 ( x , y ) = 0 , 0 < x < 1 , y R n , u 2 ( 0 , y ) = 0 , y R n , ( u 2 ) x ( 0 , y ) = ψ ( y ) , y R n
Using the Fourier transform for the variable y R n to the problems (3) and (4), we obtain
( u 1 ) ^ x x = ξ 2 u ^ 1 , 0 < x < 1 , ξ R n , u 1 ^ ( 0 , ξ ) = φ ^ ( ξ ) , ξ R n , ( u 1 ^ ) x ( 0 , ξ ) = 0 , ξ R n
and
( u 2 ) ^ x x = ξ 2 u 2 ^ , 0 < x < 1 , ξ R n , u 2 ^ ( 0 , ξ ) = 0 , ξ R n , ( u 2 ^ ) x ( 0 , ξ ) = ψ ^ ( ξ ) , ξ R n
The solution of problem (5) is
u ^ 1 ( x , ξ ) = cosh ( x | ξ | ) φ ^ ( ξ ) .
So, the solution of problem (3) is
u 1 ( x , y ) = 1 ( 2 π ) n 2 R n cosh ( x | ξ | ) φ ^ ( ξ ) e i ξ . y d ξ .
Similarly, for problem (6), the solution is
u ^ 2 ( x , ξ ) = sinh ( x | ξ | ) | ξ | ψ ^ ( ξ ) .
For problem (4), the solution is
u 2 ( x , y ) = 1 ( 2 π ) n 2 R n sinh ( x | ξ | ) | ξ | ψ ^ ( ξ ) e i ξ . y d ξ .
Obviously, the cosh ( x | ξ | ) and sinh ( x | ξ | ) | ξ | are unbounded with respect to variable ξ , and a small perturbation in the measured data φ δ ( y ) and ψ δ ( y ) may cause a dramatically large error in the solutions u 1 ( x , y ) , u 2 ( x , y ) . So problem (1) is severely ill-posed.

3. Bilateral Exponential Kernel and Auxiliary Results

The multi-dimensional even bilateral exponential function is defined as:
V μ ( x ) : = μ 2 e μ | x | , 0 < μ < 1 , x R n .
and there is
R n V μ ( x ) d x : = R n μ 2 e μ | x | d x = 1 , 0 < μ < 1 .
Here, 0 < μ < 1 is called a regularization parameter and we define the regularization operator ω μ as the following:
ω μ f ( x ) : = V μ f ( x ) = R n V μ ( t ) f ( x t ) d t = R n V μ ( x t ) f ( t ) d t .
Fourier transform of V μ ( x ) is
V ^ μ ( ξ ) = R n μ 2 e μ | x | e i ξ x d x = μ 2 μ 2 + ξ 2 .
Lemma 1.
Letting V , f L 2 ( R n ) , we have
( V f ) ^ ( ξ ) = ( 2 π ) n / 2 V ^ ( ξ ) f ^ ( ξ ) .
We reconstruct the function φ δ ( y ) , ψ δ ( y ) by ( V μ φ δ ) ( y ) , ( V μ ψ δ ) ( y ) , respectively, to solve the problems (3) and (4) with the data φ δ ( y ) , ψ δ ( y ) and have the following two problems with modified data:
Δ u 1 μ , δ ( x , y ) = 0 , 0 < x < 1 , y R n , u 1 μ , δ ( 0 , y ) = ( V μ φ δ ) ( y ) , y R n , ( u 1 μ , δ ) x ( 0 , y ) = 0 , y R n
and
Δ u 2 μ , δ ( x , y ) = 0 , 0 < x < 1 , y R n , u 2 μ , δ ( 0 , y ) = 0 , y R n , ( u 2 μ , δ ) x ( 0 , y ) = ( V μ ψ δ ( y ) , y R n
The solution of problem (15) can be formulated in the frequency domain:
u ^ 1 μ , δ ( x , ξ ) = ( V μ φ δ ^ ) ( ξ ) cosh ( x | ξ | ) = ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 φ ^ δ ( ξ ) cosh ( x | ξ | ) .
Similarly, the solution of problem (16) is:
u ^ 2 μ , δ ( x , ξ ) = ( V μ ψ δ ^ ) ( ξ ) sinh ( x | ξ | ) | ξ | = ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) sinh ( x | ξ | ) | ξ | .
Thus, the regularization approximation solution of problem (1) in the frequency domain is:
u ^ μ , δ ( x , ξ ) = ( V μ φ δ ^ ) ( ξ ) cosh ( x | ξ | ) + ( V μ ψ δ ^ ) ( ξ ) sinh ( x | ξ | ) | ξ |
Equivalently,
u μ , δ ( x , y ) = 1 ( 2 π ) n / 2 R n [ ( V μ φ δ ^ ) ( ξ ) cosh ( x | ξ | ) + ( V μ ψ δ ^ ) ( ξ ) sinh ( x | ξ | ) | ξ | ] e i ξ x d ξ .
Lemma 2
(see [27]). For 0 < x 1 , ξ > 0 then the following inequalities hold:
( 1 ) cosh ( x | ξ | ) e x | ξ | ; ( 2 ) sinh ( x | ξ | ) | ξ | e x | ξ | ; ( 3 ) cosh ( x | ξ | ) cosh | ξ | 2 e ( 1 x ) | ξ | ; ( 4 ) sinh ( x | ξ | ) sinh | ξ | e ( 1 x ) | ξ | .
Lemma 3.
If 0 < μ < 1 , then the following inequalities hold:
sup ξ R | ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 | max { ( 2 π ) n / 2 μ p , ( 2 π ) n / 2 μ 2 } .
Proof. 
Define
E ( ξ ) : = ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 .
The proof of the above inequality is divided into three cases:
(i): If | ξ | ξ 0 = 1 μ , we have
| E ( ξ ) | | ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 | | ( 2 π ) n / 2 μ 2 μ 2 ξ p | ( 2 π ) n / 2 ξ 0 p = ( 2 π ) n / 2 μ p .
(ii): If 1 < | ξ | < ξ 0 ,
| E ( ξ ) | = | ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 | ( 2 π ) n / 2 μ 2 ξ p + 2 ( 2 π ) n / 2 μ 2 .
(iii): If | ξ | 1 ,
| E ( ξ ) | = | ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 | | ξ 2 2 μ 2 ξ 2 | | 1 2 μ 2 | ( 2 π ) n / 2 μ 2 .
From the above, the Lemma is proved. □

4. Regularization and Error Estimates

4.1. An a Priori Approach for Problem (1)

In the following, we will give stable error estimates between the regularization approximate solution and the exact solution for problem (1) in 0 < x < 1 and at x = 1 , respectively.
We need to follow a priori bound
u 1 ( 1 , . ) H 0 ( R n ) E , u 2 ( 1 , . ) H 0 ( R n ) E ,
here, E is a positive constant.
In this part, we will give the stable convergence estimate findings in the case of 0 < x < 1 .
Theorem 1.
When 0 < x < 1 , u ( x , y ) is the exact solution of problem (1), and u μ , δ ( x , y ) is the regular approximation solution of problem (1). The inequalities (2) and (17) hold, then we have
u u μ , δ 3 2 E ( 2 π ) n / 2 μ ( x 1 ) e + 2 ( 2 π ) n / 2 μ x e δ .
When the regularization parameter μ is chosen as
μ = δ E ,
we have
u u μ , δ 3 2 ( 2 π ) n / 2 ( x 1 ) δ e + 2 ( 2 π ) n / 2 δ 2 x e E 0 a s δ 0 .
Proof. 
Using the triangle inequality, we have
u u μ , δ u 1 u 1 μ , δ + u 2 u 2 μ , δ .
According Parseval equality and Lemma 2, there is
u 1 u 1 μ , δ = u ^ 1 u ^ 1 μ , δ u ^ 1 u ^ 1 μ , 0 + u ^ 1 μ , 0 u ^ 1 μ , δ = ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) φ ^ ( ξ ) cosh ( x | ξ | ) + ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 cosh ( x | ξ | ) ( φ ^ ( ξ ) φ δ ( ξ ) ^ ) = ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) cosh ( x | ξ | ) 1 cosh ( | ξ | ) u ^ 1 ( 1 , ξ ) + ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 cosh ( x | ξ | ) δ E sup ξ R n | ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) cosh ( x | ξ | ) cosh ( | ξ | ) | + δ sup ξ R n | ( ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 cosh ( x | ξ | ) ) | E sup ξ R n | ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) 2 e ( 1 x ) | ξ | | + δ sup ξ R n | ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 e x | ξ | | E sup ξ R n | A ( ξ ) | + δ sup ξ R n | B ( ξ ) |
| A ( ξ ) | | ( 2 π ) n / 2 μ 2 ( μ 2 + ξ 2 ) μ 2 + ξ 2 ) 2 e ( 1 x ) | ξ | | | ( 2 π ) n / 2 μ 1 ξ e ( 1 x ) ξ | .
Letting
t 1 ( ξ ) = 1 ξ e ( 1 x ) ξ ,
when t 1 ( ξ ) = 0 , we obtain
ξ = 1 ( x 1 ) .
By verifying that ξ = 1 ( x 1 ) is the maximum point of the function 1 ξ e ( 1 x ) ξ , and since the maximum point is unique, we can obtain
| A ( ξ ) | ( 2 π ) n / 2 μ ( x 1 ) e .
Similarly,
| B ( ξ ) | ( 2 π ) n / 2 μ e x ξ ξ
Letting
t 2 ( ξ ) = e x ξ ξ ,
we have
t 2 ( ξ ) = x e x ξ ξ e x ξ ξ 2 .
Letting t 2 ( ξ ) = 0 , we obtain
ξ = 1 x .
ξ = 1 x is the maximum point of the function, and since the maximum point is unique, we can obtain
| B ( ξ ) | ( 2 π ) n / 2 μ t 2 ( 1 x ) ( 2 π ) n / 2 μ x e .
Combining the estimates of (22) and (23), we obtain
u 1 u 1 μ , δ E ( 2 π ) n / 2 μ ( x 1 ) e + δ ( 2 π ) n / 2 μ x e .
In the same way, there is
u 2 u 2 μ , δ = u ^ 2 u ^ 2 μ , δ u ^ 2 u ^ 2 μ , 0 + u ^ 2 μ , 0 u ^ 2 μ , δ = ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ψ ^ ( ξ ) sinh ( x | ξ | ) | ξ | + ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 sinh ( x | ξ | ) | ξ | ( ψ ^ ( ξ ) ψ δ ( ξ ) ^ ) = ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) sinh ( x | ξ | ) | ξ | | ξ | sinh ( | ξ | ) u ^ 2 ( 1 , ξ ) + ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 sinh ( x | ξ | ) | ξ | δ E sup ξ R n ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) sinh ( x | ξ | ) sinh ( | ξ | ) + δ sup ξ R n ( ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 sinh ( x | ξ | ) | ξ | E sup ξ R n | ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) e ( 1 x ) | ξ | | + δ sup ξ R n | ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 e x | ξ | | E sup ξ R n | C ( ξ ) | + δ sup ξ R n | D ( ξ ) |
Similarly, we obtain
| C ( ξ ) | = 1 2 | A ( ξ ) | 1 2 ( 2 π ) n / 2 μ ( x 1 ) e , | D ( ξ ) | = | B ( ξ ) | ( 2 π ) n / 2 μ x e
u 2 u 2 μ , δ E 1 2 ( 2 π ) n / 2 μ ( x 1 ) e + δ ( 2 π ) n / 2 μ x e .
Combining the results of (24) and (25), we obtain (18). The proof of the theorem is completed. □
When x = 1 , we propose a stronger priori bound as follows:
u ( 1 , . ) H p E p .
Theorem 2.
When x = 1 , u ( x , y ) and u μ , δ ( x , y ) is the exact and the regular approximation solution of problem (1). The inequalities (2) and (26) hold, then we have
u u μ , δ 2 E p max { ( 2 π ) n / 2 μ p , ( 2 π ) n / 2 μ 2 } + 2 ( 2 π ) n / 2 μ e δ .
When the regularization parameter μ chosen as
μ = δ E p ,
we have the following error estimates:
u u μ , δ 2 E p max { ( 2 π ) n / 2 ( δ E p ) p , ( 2 π ) n / 2 ( δ E p ) 2 } + 2 ( 2 π ) n / 2 e δ 2 E p 0 a s δ 0 .
Proof. 
Using the triangle inequality, we have
u ( 1 , . ) u μ , δ ( 1 , . ) u 1 ( 1 , . ) u 1 μ , δ ( 1 , . ) + u 2 ( 1 , . ) u 2 μ , δ ( 1 , . ) .
According Parseval equality and Lemma 2, there is
u 1 ( 1 , . ) u 1 μ , δ ( 1 , . ) = u ^ 1 ( 1 , . ) u ^ 1 μ , δ ( 1 , . ) u ^ 1 ( 1 , . ) u ^ 1 μ , 0 ( 1 , . ) + u ^ 1 μ , 0 ( 1 , . ) u ^ 1 μ , δ ( 1 , . ) = ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) φ ^ ( ξ ) cosh ( | ξ | ) + ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 cosh ( | ξ | ) ( φ ^ ( ξ ) φ δ ( ξ ) ^ ) = ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 ( 1 + ξ 2 ) p 2 u ^ 1 ( 1 , ξ ) + ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 cosh ( | ξ | ) δ E p sup ξ R n | μ 2 + ξ 2 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 1 ξ p | + δ sup ξ R n | ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 e | ξ | | E p sup ξ R n | E ( ξ ) | + δ sup ξ R n | F ( ξ ) |
Using Lemma 3, we known
| E ( ξ ) | max { ( 2 π ) n / 2 μ p , ( 2 π ) n / 2 μ 2 } .
| F ( ξ ) | ( 2 π ) n / 2 μ e | ξ | ξ
Letting t 3 ( ξ ) = e ξ ξ , we have t 3 ( ξ ) = 0 and we obtain
ξ = 1 .
Clearly , ξ = 1 is the maximum point of the function, and since the maximum point is unique, we can obtain
| F ( ξ ) | ( 2 π ) n / 2 μ e .
Combining the estimates of (31) and (32), we obtain
u 1 ( 1 , . ) u 1 μ , δ ( 1 , . ) E p max { ( 2 π ) n / 2 μ p , ( 2 π ) n / 2 μ 2 } + ( 2 π ) n / 2 μ e δ .
Similarly, taking a similar process of the error estimate as u 1 ( 1 , . ) u 1 μ , δ ( 1 , . ) , we can obtain
u 2 ( 1 , . ) u 2 μ , δ ( 1 , . ) E p max { ( 2 π ) n / 2 μ p , ( 2 π ) n / 2 μ 2 } + ( 2 π ) n / 2 μ e δ .
Combining the findings of (33) and (34), we obtain (27). The theorem’s proof is completed. □

4.2. An a Posteriori Approach for Problem (1)

According to Morozov inconsistency principle [28], the posterior regularization parameter selection rule is given, that is, the solution μ of the following equation is chosen as the posterior regularization parameter: For u 1 ( x , y ) , we define
( 2 π ) n / 2 μ 2 μ 2 + ξ 2 φ ^ δ ( ξ ) φ ^ δ ( ξ ) = τ δ .
Similarly, for u 2 ( x , y )
( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ψ ^ δ ( ξ ) = τ δ .
here τ > 0 is constant.
Lemma 4.
If δ > 0 , then the functions q 1 ( μ ) = ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 φ ^ δ ( ξ ) φ ^ δ ( ξ ) , q 2 ( μ ) = ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ψ ^ δ ( ξ ) have the following properties:
( 1 ) q 1 ( μ ) , q 2 ( μ ) a r e c o n t i n u o u s f u n c t i o n s ; ( 2 ) lim μ + q 1 ( μ ) = φ ^ δ , lim μ + q 2 ( μ ) = ψ ^ δ ; ( 3 ) q 1 , q 2 a r e a s t r i c t l y i n c r e a s i n g f u n c t i o n s .
The proof of this lemma is similar to the literature [29]. We omit the proof here.
Lemma 5.
There are the following inequalities:
( 2 π ) n / 2 μ 2 μ 2 + ξ 2 φ ^ δ ( ξ ) φ ^ ( ξ ) ( τ + 1 ) δ , ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ψ ^ ( ξ ) ( τ + 1 ) δ
Proof. 
( 2 π ) n / 2 μ 2 μ 2 + ξ 2 φ ^ δ ( ξ ) φ ^ ( ξ ) = ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 φ ^ δ ( ξ ) φ ^ δ ( ξ ) + φ ^ δ ( ξ ) φ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 φ ^ δ ( ξ ) φ ^ δ ( ξ ) + φ ^ δ ( ξ ) φ ^ ( ξ ) τ δ + δ = ( τ + 1 ) δ
Similarly, we obtain
( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ψ ^ ( ξ ) ( τ + 1 ) δ
Lemma is proved. □
Lemma 6.
If μ 1 is the solution of (35), and μ 2 is the solution of (36), letting μ = max { μ 1 , μ 2 } , then the following inequality holds:
μ ( 18 2 3 E p ( τ 1 ) δ ) 1 2
To prove Lemma 6, we use the following two inequalities:
e x s 2 cosh ( x s ) e x s ;
cosh ( x ) ( sinh x x ) 3
Proof. 
When equalities (35) and (2) hold, using triangle inequality, there is:
τ δ = ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 φ ^ δ ( ξ ) φ ^ δ ( ξ ) = ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) φ ^ δ ( ξ ) = ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) φ ^ δ ( ξ ) ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) φ ^ ( ξ ) + ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) φ ^ ( ξ ) ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) ( φ ^ δ ( ξ ) φ ^ ( ξ ) ) + ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) φ ^ ( ξ ) δ + ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 ( 1 + ξ 2 ) p 2 u 1 ( 1 . ) cosh | ξ | δ + sup ξ R n | ( 1 ( 2 π ) n / 2 μ 1 2 μ 1 2 + ξ 2 ) 1 cosh | ξ | ( 1 + ξ 2 ) p 2 | E p δ + sup ξ R n | ξ 2 μ 1 2 2 e | ξ | | E p δ + 4 E p μ 1 2
thus, we have
μ 1 2 ( E p ( τ 1 ) δ ) 1 2 .
Similarly, when equalities (36) and (2) hold, using triangle inequality, we obtain the error estimate as follows:
μ 2 ( 18 2 3 E p ( τ 1 ) δ ) 1 2 .
Combining the error estimates (39) and (40), Lemma 6 is proved. □
Theorem 3.
Let u ( x , y ) be the exact solution of problem (1), and u μ , δ ( x , y ) be the regular approximation solution of problem (1). The inequalities (2), (26) and (37) hold, then we have
u u μ , δ ( ( 2 π ) n / 2 μ 2 e 2 x 2 ( p + 2 ) 2 8 δ + 2 ( x e 2 ) p E p ) 2 p + 2 ( ( τ + 1 ) δ ) 2 p 2 + p
When regularization parameter μ is chosen as (38), we have
u u μ , δ ( ( 2 π ) n / 2 9 2 3 E p ( τ 1 ) e 2 x 2 ( p + 2 ) 2 4 + ( x e 2 ) p E p ) 2 p + 2 ( ( τ + 1 ) δ ) 2 p 2 + p 0 a s δ 0 .
Proof. 
Using triangle inequality, we have
u u μ , δ u 1 u 1 μ , δ + u 2 u 2 μ , δ .
From Parseval equality and Lemma 2, we have
u ^ 2 u ^ 2 μ , δ 2 = ψ ^ ( ξ ) sinh ( x | ξ | ) | ξ | ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 sinh ( x | ξ | ) | ξ | ψ ^ δ ( ξ ) 2 = sinh ( x | ξ | ) | ξ | ( ψ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 2 = R n ( sinh ( x | ξ | ) | ξ | ) 2 ( ψ ^ ( ξ ) 2 ( 2 π ) n / 2 μ μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 4 p + 2 ( ψ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 2 ( 1 2 p + 2 ) [ R n ( ( sinh ( x | ξ | ) | ξ | ) 2 ( ψ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 4 p + 2 ) p + 2 2 d ξ ] 2 p + 2 [ R n ( ( ψ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 2 ( 1 2 p + 2 ) ) p + 2 p d ξ ] p p + 2 = [ ( sinh ( x | ξ | ) | ξ | ) p + 2 ( ψ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 2 d ξ ] 2 p + 2 × [ ( ψ ^ ( ξ ) 2 ( 2 π ) n / 2 μ μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 2 d ξ ] p p + 2 = ( sinh ( x | ξ | ) | ξ | ) p + 2 2 ( ψ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ) 4 p + 2 ψ ^ ( ξ ) ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) 2 p p + 2 ( ( sinh ( x | ξ | ) | ξ | ) p + 2 2 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ δ ( ξ ) ( sinh ( x | ξ | ) | ξ | ) p + 2 2 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ ( ξ ) + ( sinh ( x | ξ | ) | ξ | ) p + 2 2 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ψ ^ ( ξ ) ( sinh ( x | ξ | ) | ξ | ) p + 2 2 ψ ^ ( ξ ) ) 4 p + 2 ( ( τ + 1 ) δ ) 2 p p + 2 ( sup | ( sinh ( x | ξ | ) | ξ | ) p + 2 2 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 | δ + ( sinh ( x | ξ | ) | ξ | ) p 2 ( 1 ( 2 π ) n / 2 μ 2 μ 2 + ξ 2 ) ( 1 + ξ 2 ) p 2 ( 1 + ξ 2 ) p 2 u ^ 2 ( 1 , . ) ) 4 p + 2 ( ( τ + 1 ) δ ) 2 p p + 2 δ | P ( ξ ) | + Q ( ξ ) E p 4 p + 2 ( ( τ + 1 ) δ ) 2 p 2 + p
| P ( ξ ) | ( e x ξ ) p + 2 2 ( 2 π ) n / 2 μ 2 ξ 2 ( 2 π ) n / 2 μ 2 e ( p + 2 ) x ξ 2 ξ 2
Letting t 4 ( ξ ) = e ( p + 2 ) x ξ 2 ξ 2 , when t 4 ( ξ ) = 0 , we have ξ = 4 ( p + 2 ) x .
Thus,
| P ( ξ ) | ( 2 π ) n / 2 μ 2 t 4 ( 4 ( p + 2 ) x ) = ( 2 π ) n / 2 μ 2 e 2 x 2 ( p + 2 ) 2 16 .
| Q ( ξ ) | e p x ξ 2 ξ p
Letting
t 5 = e p x ξ 2 ξ p ,
t 5 = 0 , we have
ξ = 2 x .
| Q ( ξ ) | t 5 ( 2 x ) = ( x e 2 ) p .
So, we obtain
u ^ 2 u ^ 2 μ , δ 2 ( ( 2 π ) n / 2 μ 2 e 2 x 2 ( p + 2 ) 2 16 δ + ( x e 2 ) p E p ) 4 p + 2 ( ( τ + 1 ) δ ) 2 p 2 + p .
Similarly, taking a process of the error estimate as u ^ 2 u ^ 2 μ , δ 2 , we have
u ^ 1 u ^ 1 μ , δ 2 ( ( 2 π ) n / 2 μ 2 e 2 x 2 ( p + 2 ) 2 16 δ + ( x e 2 ) p E p ) 4 p + 2 ( ( τ + 1 ) δ ) 2 p 2 + p .
Finally, Equation (41) is obtained from Equations (43) and (44). Theorem 3 is proved. □

5. Numerical Aspects

We want to discuss some numerical aspects of the suggested approach in this section, and the numerical experiment is conducted using MATLAB R2017b. In the following experiment, we select the discrete interval as [ 10 , 10 ] × [ 10 , 10 ] and we always take N = 101 .
The measurement data
φ δ = φ + ϵ ( 2 r a n d n ( s i z e ( φ ) ) 1 ) .
Function ’rand(.)’ generates arrays of random numbers in which its elements are normally disturbed with mean 0 , variance ϵ 2 = 1 . Let u and u μ , δ be the exact solution and the regular approximate solution of following example, and the error norm is defined by
δ = φ φ δ = 1 N × N i = 1 N j = 1 N ( φ φ δ ) 2 .
Let
r e l ( u ) = u u μ , δ u .
be the relative error between the exact solutions and approximate solutions of following examples (Algorithm 1).
Algorithm 1 Algorithm of the numerical method
1. In MATLAB R2017b, graphs corresponding to exact solutions are drawn for different examples;
2. Fourier transform and mollification method are used to construct regular solutions based on bilateral exponential functions;
3. Draw the graph of the regular solution corresponding to the exact solution;
4. Draw the error graph between the exact solution and the corresponding regular solution.
Example 1.
We take function φ ( x , y ) = x y e x 2 y 2 , as the exact data of problem (3), and take the wave number.
For numerical Examples 1 and 2, we perform the investigation, respectively, under the prior and the posterior regularization rule, and the analysis reveals that our approach is stable and effective. In the posterior regularization rule, the dichotomy method is employed to solve Equations (35) and (36), where τ = 1.1 .
Table 1 illustrates the findings of Example 1 at x = 0.2 associated with various error levels δ , where r e l ( u ) depicts the relative error between the exact solution and bilateral exponential kernel regularization solution.
We compared our approach with the approach in reference [30], and Table 1 shows the findings. Table 1, the approximate findings of our regularization approach based on the bilateral exponential kernel are superior to the approach in reference [30] under either the prior or posterior rule.
Figure 1, Figure 2, Figure 3, Figure 4 and Figure 5 are the comparison between the exact solution, approximate solution, and error under prior rule, from which we can see that our approach is stable and effective.
Figure 6, Figure 7, Figure 8, Figure 9, Figure 10 and Figure 11 are the comparison between the exact solution, approximate solution, and error under the posterior rule. The figure shows that our approach is also stable and effective under the posterior rule.
Figure 1 depicts the exact solution and approximate solution for x = 0.2 , δ = 1 × 10 2 . Figure 2 and Figure 3 show the relationship between the approximate solution and error under different δ = 1 × 10 3 , δ = 1 × 10 4 . Figure 4 and Figure 5 show the relationship between the approximate solution and error when x = 0.5 , δ = 1 × 10 5 , δ = 1 × 10 6 .
Figure 6 shows the exact solution and approximate solution when x = 0.2 and δ = 1 × 10 2 . Figure 7 and Figure 8 show the relationship between the approximate solution and error under different δ = 1 × 10 3 , δ = 1 × 10 4 . Figure 9, Figure 10 and Figure 11 show the relationship between the approximate solution and error when x = 0.5 , δ = 1 × 10 5 , δ = 1 × 10 7 , δ = 1 × 10 8 .
Table 1 and Figure 1, Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8, Figure 9, Figure 10 and Figure 11 show that the findings of relative error r e l ( u ) depend not only on error level δ , but also on x. Our findings are stable and effective under both the prior and posterior rule.
Example 2.
We take function φ ( y , z ) = e 36 36 + y 2 36 36 + z 2 , as the exact data of problem (4).
From Table 2, we can see our approach is better than the approach of the study [30] at x = 1 . The relative error of our approach is smaller than that in reference [30], the approximate effect is better, and the approach is more stable. Table 2 also reveals that the approach in this study is stable for p = 0.5 and p = 3 , respectively.
Figure 12, Figure 13 and Figure 14 show the relationship between the exact solution, approximate solution and error under the prior rule. Figure 12 reveals the exact solution and approximate solution when x = 0.3 and δ = 1 × 10 4 . Figure 13 reveals the approximate solution and the error between the exact solution and the approximate solution when x = 0.3 and δ = 1 × 10 5 . Figure 14 illustrates the approximate solution and the error between the approximate solution and the exact solution when x = 0.3 and δ = 1 × 10 6 . The above figures show that our approach is stable and effective under the prior rule, and the error decreases as the value of δ decreases.
Figure 15, Figure 16 and Figure 17 illustrate the relationship between the exact solution, approximate solution and error under a posterior rule. Figure 15 shows the exact and approximate solution when x = 0.3 and δ = 1 × 10 4 ; Figure 16 shows the approximate solution and the error between the exact solution and the approximate solution when x = 0.3 and δ = 1 × 10 5 ; and Figure 17 illustrates the approximate solution and the error between the approximate solution and the exact solution when x = 0.3 and δ = 1 × 10 6 . As can be seen from the above figures, our approach is also stable and effective under the posterior rule, and the error reduces as δ reduces.
The above is a graphical representation of the exact solution, approximate solution, and the error analysis under the priori regularization parameter choice rule and posterior regularization parameter choice rule. The above figures show that our regularization approach is stable and effective under both the prior and posterior rule, whether in the interval 0 < x < 1 or on the boundary x = 1 .

6. Conclusions

In this study, we suggest a novel regularization method based on the bilateral kernel, to solve a Cauchy problem for a multi-dimensional Laplace equation in the mixed boundary. The error estimates are given under the prior and posterior rule. The numerical examples above show that it is feasible to solve the Cauchy problem for the multi-dimensional Laplace equation in the mixed boundary. The stable approximate estimates are obtained. Numerical examples show the numerical stability of the proposed method. Furthermore, our approach is superior to the paper [30] and the accuracy of the procedure is quite acceptable.

Author Contributions

Writing—original draft, X.L.; Funding acquisition, X.F. All authors have read and agreed to the published version of the manuscript.

Funding

The current project is funded by the National Natural Science Foundation of China (No. 11961054) and Natural Science Foundation of Ningxia (No. NZ16011).

Acknowledgments

We wish to express appreciation for the referees and the editor for carefully reading the manuscript as well as providing valuable suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

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. 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]
  6. 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]
  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. ZAMM J. Appl. 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. Unión Matemática Argent. 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. Comput. 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] [CrossRef]
  18. Engl, H.W.; Hanke, M.; Neubauer, A. Regularization of Inverse Problems; Kluwer Academic: Dordrecht, The Netherlands, 1996; Volume 35, pp. 4915–4920. [Google Scholar]
  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]
  25. Kumar, H.K.; Jiwari, R. A hybrid approach based on Legendre wavelet for numerical simulation of Helmholtz equation with complex solution. Int. J. Comput. Math. 2022, 99, 2221–2236. [Google Scholar] [CrossRef]
  26. Kumar, H.K.; Jiwari, R. A note on numerical solution of classical Darboux problem. Math. Methods Appl. Sci. 2021, 44, 12998–13007. [Google Scholar] [CrossRef]
  27. Xiong, X.T.; Shi, W.X.; Fan, X.Y. Two mumerical methods for a Cauchy problem for modified Helmholtz equation. Appl. Math. Model. 2011, 35, 4951–4964. [Google Scholar] [CrossRef]
  28. Engl, H.W.; Hanke, M.; Neubauer, A. Regularization of Inverse Problem; Kluwer Academic: Boston, MA, USA, 1996. [Google Scholar]
  29. Kirsch, A. An Introduction to the Mathematical Theory of Inverse Problems; Springer: New York, NY, USA, 1996. [Google Scholar]
  30. He, S.Q.; Feng, X.F. A numerical Approximation Method for the Inverse Problem of the Three-Dimensional Laplace Equation. Mathematics 2019, 7, 487. [Google Scholar] [CrossRef]
Figure 1. (a) The exact solution and (b) the regularized solution when x = 0.2 , δ = 1 × 10 2 under prior rule.
Figure 1. (a) The exact solution and (b) the regularized solution when x = 0.2 , δ = 1 × 10 2 under prior rule.
Mathematics 11 01855 g001
Figure 2. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.2 , δ = 1 × 10 3 under prior rule.
Figure 2. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.2 , δ = 1 × 10 3 under prior rule.
Mathematics 11 01855 g002
Figure 3. (a) The regularized solution and (b) error when x = 0.2 , δ = 1 × 10 4 under prior rule.
Figure 3. (a) The regularized solution and (b) error when x = 0.2 , δ = 1 × 10 4 under prior rule.
Mathematics 11 01855 g003
Figure 4. (a) The exact solution and (b) the regularized solution when x = 0.5 , δ = 1 × 10 5 under prior rule.
Figure 4. (a) The exact solution and (b) the regularized solution when x = 0.5 , δ = 1 × 10 5 under prior rule.
Mathematics 11 01855 g004
Figure 5. (a) The regularized solution when x = 0.5 , δ = 1 × 10 6 , (b) The regularized solution when x = 0.5 , δ = 1 × 10 7 under prior rule.
Figure 5. (a) The regularized solution when x = 0.5 , δ = 1 × 10 6 , (b) The regularized solution when x = 0.5 , δ = 1 × 10 7 under prior rule.
Mathematics 11 01855 g005
Figure 6. (a) The exact solution and (b) the regularized solution when x = 0.2 , δ = 1 × 10 2 under the posterior rule.
Figure 6. (a) The exact solution and (b) the regularized solution when x = 0.2 , δ = 1 × 10 2 under the posterior rule.
Mathematics 11 01855 g006
Figure 7. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.2 , δ = 1 × 10 3 under the posterior rule.
Figure 7. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.2 , δ = 1 × 10 3 under the posterior rule.
Mathematics 11 01855 g007
Figure 8. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.2 , δ = 1 × 10 4 under the posterior rule.
Figure 8. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.2 , δ = 1 × 10 4 under the posterior rule.
Mathematics 11 01855 g008
Figure 9. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.5 , δ = 1 × 10 5 under the posterior rule.
Figure 9. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.5 , δ = 1 × 10 5 under the posterior rule.
Mathematics 11 01855 g009
Figure 10. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.5 , δ = 1 × 10 7 under the posterior rule.
Figure 10. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.5 , δ = 1 × 10 7 under the posterior rule.
Mathematics 11 01855 g010
Figure 11. (a) The regularized solution and (b) error between regularized and exact solution when x = 1 , δ = 0.5 × 10 8 under the posterior rule.
Figure 11. (a) The regularized solution and (b) error between regularized and exact solution when x = 1 , δ = 0.5 × 10 8 under the posterior rule.
Mathematics 11 01855 g011
Figure 12. (a) The exact solution and (b) the regularized solution when x = 0.3 , δ = 1 × 10 4 under a priori rule.
Figure 12. (a) The exact solution and (b) the regularized solution when x = 0.3 , δ = 1 × 10 4 under a priori rule.
Mathematics 11 01855 g012
Figure 13. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 5 under a priori rule.
Figure 13. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 5 under a priori rule.
Mathematics 11 01855 g013
Figure 14. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 6 under a priori rule.
Figure 14. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 6 under a priori rule.
Mathematics 11 01855 g014
Figure 15. (a) The exact solution and (b) the regularized solution when x = 0.3 , δ = 1 × 10 4 under posterior rule.
Figure 15. (a) The exact solution and (b) the regularized solution when x = 0.3 , δ = 1 × 10 4 under posterior rule.
Mathematics 11 01855 g015
Figure 16. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 5 under posterior rule.
Figure 16. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 5 under posterior rule.
Mathematics 11 01855 g016
Figure 17. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 6 under posterior rule.
Figure 17. (a) The regularized solution and (b) error between regularized and exact solution when x = 0.3 , δ = 1 × 10 6 under posterior rule.
Mathematics 11 01855 g017
Table 1. Comparison between different regular solutions at x = 0.2.
Table 1. Comparison between different regular solutions at x = 0.2.
δ Dirichlet rel ( u ) Poussin rel ( u ) Posterior rel ( u ) Prior rel ( u )
1 × 10 2 1.31276.89720.66650.7610
1 × 10 3 0.13110.97660.06790.0648
1 × 10 4 0.02210.13840.00660.0074
1 × 10 5 0.01140.04676.9309 × 10 4 6.4534 × 10 4
Table 2. Comparison between different regular solutions at x = 1.
Table 2. Comparison between different regular solutions at x = 1.
p δ Dirichlet rel ( u ) Posterior rel ( u ) Prior rel ( u )
0.51 × 10 8 0.24045.9947 × 10 4 6.212 × 10 4
0.51 × 10 9 0.05095.6870 × 10 5 5.9805 × 10 5
31 × 10 6 0.26840.06190.0590
31 × 10 7 0.09050.00560.0057
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Lv, X.; Feng, X. Numerical Method for a Cauchy Problem for Multi-Dimensional Laplace Equation with Bilateral Exponential Kernel. Mathematics 2023, 11, 1855. https://doi.org/10.3390/math11081855

AMA Style

Lv X, Feng X. Numerical Method for a Cauchy Problem for Multi-Dimensional Laplace Equation with Bilateral Exponential Kernel. Mathematics. 2023; 11(8):1855. https://doi.org/10.3390/math11081855

Chicago/Turabian Style

Lv, Xianli, and Xiufang Feng. 2023. "Numerical Method for a Cauchy Problem for Multi-Dimensional Laplace Equation with Bilateral Exponential Kernel" Mathematics 11, no. 8: 1855. https://doi.org/10.3390/math11081855

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop