Next Article in Journal
Goodness of Fit Tests for the Log-Logistic Distribution Based on Cumulative Entropy under Progressive Type II Censoring
Next Article in Special Issue
A Modified Asymptotical Regularization of Nonlinear Ill-Posed Problems
Previous Article in Journal
A Hybrid Framework Combining Genetic Algorithm with Iterated Local Search for the Dominating Tree Problem
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Regularization Method to Solve a Cauchy Problem for the Two-Dimensional Modified Helmholtz Equation

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.
Mathematics 2019, 7(4), 360; https://doi.org/10.3390/math7040360
Submission received: 31 January 2019 / Revised: 6 April 2019 / Accepted: 16 April 2019 / Published: 20 April 2019
(This article belongs to the Special Issue Numerical Analysis: Inverse Problems – Theory and Applications)

Abstract

:
In this paper, the ill-posed problem of the two-dimensional modified Helmholtz equation is investigated in a strip domain. For obtaining a stable numerical approximation solution, a mollification regularization method with the de la Vallée Poussin kernel is proposed. An error estimate between the exact solution and approximation solution is given under suitable choices of the regularization parameter. Two numerical experiments show that our procedure is effective and stable with respect to perturbations in the data.

1. Introduction

The inversion problem on mathematical physics equations is an important branch in mathematics. The inversion of surface parameters in remote sensing science, the invention and application of CT in medical imaging, the reconstruction of optical signals and the geomorphological exploration in geological exploration are all related to such inversion problems [1].
There are many research methods and results for the Helmholtz equation for a positive wave number. The Helmholtz equation of a pure imaginary wave number is called the modified Helmholtz equation (also known as the Yukawa equation). It usually appears in the semi-implicit time-discrete heat equation and is also used to describe the physical phenomena of wave dispersion and diffusion [2]. A number of numerical solutions in the direct problem for the modified Helmholtz equation have been proposed [3,4], however, its inverse problem is severely ill-posed or improperly-posed in the viewpoint of Hadamard [5], the Cauchy problem suffers from the instability of the solution in the sense that a minor disturbance in the input data may cause a tremendous deviation in the solution [6]. To establish an accurate, stable, reliable and fast numerical algorithm for the Cauchy problem is a considerably interesting topic. It is impossible to solve this problem by using classical numerical methods, such as the finite element method (FEM), finite difference method (FDM) and finite volume method (FVM). It requires special techniques, and some different approaches had been given of an account of on the published literature, for instance, the Landweber method with boundary element method (BEM) [7], the conjugate gradient method [8], the method of fundamental solutions (MFS) [9], the Fourier regularization method [10], the truncation method [11] and the mollification method [12,13].
The kernel functions, such as Féjer kernel, Weierstrass kernel, Bessel-MacDonald kernel, de la Vallée Poussin kernel, Dirichlet and Krein kernel have a wide range of applications [12]. Manselli, Miller [13] and Murio [14] adopted the mollification method with the Weierstrass kernel to construct regularization operators to solve some inverse problems, but their methods were suitable for the case of Hilbert space L 2 ( R ) , furthermore they could not find appropriate regularization parameters. Hào [15] generalized their works, not only in Hilbert spaces, but also in Banach spaces with de la Vallée Poussin kernel and Dirichlet kernel. He applied the mollification method to concrete problems, such as the Cauchy problem of the Laplace equation, numerical differentiation and some parabolic equations. In recent years, inspired by Murio’s work [16], there are some research results for the mollification method with Gaussian kernel to solve Cauchy problem of elliptic equations [17,18,19].
In this paper, a mollification regular method with the de la Vallée Poussin kernel is introduced to solve the Cauchy problem for a Helmholtz-type equation; our approximation is to transform the ill-posed problem into a well-posed problem by convoluting the de la Vallée Poussin function and the measured data. We consider the following two problems:
u ( x , y ) k 2 u ( x , y ) = 0 , 0 < x < d , y R , u ( 0 , y ) = f ( y ) , y R , u x ( 0 , y ) = 0 , y R , u ( d , y ) = h 1 ( y ) , y R ,
and
v ( x , y ) k 2 v ( x , y ) = 0 , 0 < x < d , y R , v ( 0 , y ) = 0 , y R , v x ( 0 , y ) = g ( y ) , y R , v ( d , y ) = h 2 ( y ) , y R ,
where = 2 x 2 + 2 y 2 is a two-dimensional Laplace operator, f ( y ) , g ( y ) are given vectors in L 2 ( R ) , and h 1 ( y ) , h 1 ( y ) L 2 ( R ) are unknown vectors. The constant k ( k > 0 ) is the wave number.
Let w = u + v , where u and v are solution of problems (1) and (2), respectively. Then w is the solution of the following Cauchy problem with the inhomogeneous Neumann boundary condition:
w ( x , y ) k 2 w ( x , y ) = 0 , 0 < x < d , y R , w ( 0 , y ) = f ( y ) , y R , w x ( 0 , y ) = g ( y ) , y R , w ( d , y ) = h ( y ) , y R ,
where h ( y ) = h 1 ( y ) + h 2 ( y ) .
We assume that all the functions involved are L 2 functions in ( , ) , Additionally suppose that input functions f ( y ) , g ( y ) and its measurement data f δ ( y ) , g δ ( y ) satisfy
max { f f δ , g g δ } δ ,
where δ > 0 denotes noise level, and · denotes the L 2 norm.
Assume there exits a constant E > 0 , such that the following a priori bound holds:
max { h 1 ( · ) , h 2 ( · ) } E .
The rest of this paper is organized as follows. In Section 2, we illuminate the ill-posed nature of problems (1) and (2), the de la Vallée Poussin kernel and some properties are presented to obtain the regularization solution. In Section 3, some error estimates are given for 0 < x < d and at the boundary x = d under the suitable choices of regularization parameter. Section 4 is the numerical aspect of our proposed algorithm. Some conclusions are given in Section 5.

2. Description of the Problem and Mollification Method

Let us introduce the Sobolev space H r ( R ) [15] with r 0 , and if r = 0 , then H 0 = L 2 ( R ) , H r = { f ( y ) L 2 ( R ) : f H r < } , where
f H r : = ( R | f ^ ( ξ ) | 2 ( 1 + ξ 2 ) r d ξ ) 1 / 2
with the Fourier transform
f ^ ( ξ ) = 1 2 π R e i ξ · y d y , ( ξ R )
Additionally, the inverse Fourier transform for the variable ξ R
f ( y ) = 1 2 π R e i ξ · y f ^ ( ξ ) d ξ .
In this paper, we denote · : = · 0 .
For any function φ L 1 ( R ) and f L p ( R ) , 1 p , the convolution is defined by [15]
φ f = 1 2 π + φ ( x y ) f ( y ) d y = 1 2 π + φ ( y ) f ( x y ) d y .
It is well known that [16]
( φ f ) ^ ( ξ ) = φ ^ ( ξ ) f ^ ( ξ ) ,
and
φ f p 1 2 π φ 1 f p ,
and the Parseval equality [15]
f = f ^ , f , f ^ L 2 ( R ) .

2.1. Ill-posed Analysis

Applying the Fourier transform to problems (1) and (2). with respect to the variable y, we obtain the following problems:
u ^ x x ( x , ξ ) + ( i ξ ) 2 u ^ ( x , ξ ) k 2 u ^ ( x , ξ ) = 0 , 0 < x < d , ξ R ; u ^ ( 0 , ξ ) = f ^ ( ξ ) , ξ R ; u ^ x ( 0 , ξ ) = 0 , ξ R .
and
v ^ x x ( x , ξ ) + ( i ξ ) 2 v ^ ( x , ξ ) k 2 v ^ ( x , ξ ) = 0 , 0 < x < d , ξ R ; v ^ ( 0 , ξ ) = 0 , ξ R ; v ^ x ( 0 , ξ ) = g ^ ( ξ ) , ξ R .
The solution of problem (11) is
u ^ ( x , ξ ) = f ^ ( ξ ) cosh ( x ξ 2 + k 2 ) .
or equivalently,
u ( x , y ) = 1 2 π + f ^ ( ξ ) cosh ( x ξ 2 + k 2 ) e i ξ y d ξ .
The solution of problem (12) is
v ^ ( x , ξ ) = g ^ ( ξ ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 .
or equivalently,
v ( x , y ) = 1 2 π + g ^ ( ξ ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 e i ξ y d ξ .
When x = d , we have
u ^ ( d , ξ ) = f ^ ( ξ ) cosh ( d ξ 2 + k 2 ) , v ^ ( d , ξ ) = g ^ ( ξ ) sinh ( d ξ 2 + k 2 ) ξ 2 + k 2 .
Apparently, the factors cosh ( x ξ 2 + k 2 ) and sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 are unbounded with respect to variable ξ , a small perturbation in the measured data g ^ ( ξ ) and h ^ ( ξ ) may arouse a tremendously large error in the solutions u ( x , y ) and v ( x , y ) , respectively. Therefore, problems (1), (2) and (3) are severely ill-posed [5].

2.2. Mollification Method

This paper is devoted to establishing a mollification method, constructing mollification operator by convolution with the de la Vallée Poussin kernel and measurement data, as thus the ill-posed problems are transformed into well-posed problems.
The function
V α ( t ) = cos ( α t ) cos ( 2 α t ) α t 2 .
is called the de la Vallée Poussin kernel [15]. Here, α ( α > 0 ) is called mollification radius or mollification parameter, and V α ( x ) has the following properties [15].
(1) V α ( t ) is an exponential type entire function of degree 2 α relative variable t, bounded and summable on R ;
(2) V ^ α is the Fourier transform of V α ( t ) and satisfies
2 π V ^ α = 1 , | ξ | < α , 2 α ξ α , α < | ξ | 2 α , 0 , | ξ | > 2 α ;
(3) 1 π + V α ( t ) d t = 1 ;
(4) 1 π + | V α ( t ) | d t < 2 3 ( α 1 ) .
We define the operator T α by T α : R R
( T α f δ ) ( t ) = 1 π + V α ( t y ) f δ ( y ) d y = 2 π ( V α f δ ) ( t ) ,
Utilizing (8), we have
( T α f δ ) ^ ( ξ ) = 2 / π V ^ α ( ξ ) f ^ δ ( ξ ) ,
The Cauchy problems (1) and (2) can be stabilized, if instead of attempting to find the values of the function f δ ( y ) , g δ ( y ) , we shall reconstruct the δ mollification of the function f δ ( y ) , g δ ( y ) , given by ( T α f δ ) ( y ) , ( T α g δ ) ( y ) . We have the following problems with the mollified data:
u x x α , δ + u y y α , δ k 2 u α , δ = 0 , 0 < x < d , y R , u α , δ ( 0 , y ) = ( T α f δ ) ( y ) , y R , u x α , δ ( 0 , y ) = 0 , y R ,
and
v x x α , δ + v y y α , δ k 2 v α , δ = 0 , 0 < x < d , y R , v α , δ ( 0 , y ) = 0 , y R , v x α , δ ( 0 , y ) = ( T α g δ ) ( y ) , y R ,
where u α , δ and v α , δ denote the solution of problems (13) and (14), respectively.
The solution of problem (13) is
u ^ α , δ ( x , ξ ) = ( T α f δ ) ^ ( ξ ) cosh ( x ξ 2 + k 2 ) ,
equivalently
u α , δ ( x , y ) = 1 2 π + ( T α f δ ) ^ ( ξ ) cosh ( x ξ 2 + k 2 ) e i ξ y d ξ .
The solution of problem (14) is
v ^ α , δ ( x , ξ ) = ( T α g δ ) ^ ( ξ ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 ,
equivalently
v α , δ ( x , y ) = 1 2 π + ( T α g δ ) ^ ( ξ ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 e i ξ y d ξ .
According to the property (3) of kernel function V α , we have
T α f δ ( y ) f ( y ) = 1 π + V α ( s ) ( f δ ( y s ) f ( y ) ) d s .
From (9) and property (4) of V α , we get
T α f δ f 2 V α 1 · f f δ 2 < 2 3 δ .
Remark 1.
Assumption that condition (4) is valid, when α 1 , we have
T α f δ f 2 < 2 3 δ , T α f δ f 2 < 2 3 δ .

3. Error Estimate and Parameter Selection

Lemma 1.
For 0 < x d , the following inequalities hold.
(1) sinh ( x ξ 2 + k 2 ) sinh ( d ξ 2 + k 2 ) e ( d x ) | ξ | ;
(2) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 d e x ( | ξ | + k ) ;
(3) cosh ( x ξ 2 + k 2 ) cosh ( d ξ 2 + k 2 ) 2 e ( d x ) | ξ | ;
(4) cosh ( x ξ 2 + k 2 ) e x ( | ξ | + k ) .
Proof. 
Using inequality | ξ | < ξ 2 + k 2 < | ξ | + k , the proofs of (3) and (4) can be obtained. Therefore, we only prove (1) and (2).
From inequality,
sinh ( x ξ 2 + k 2 ) sinh ( d ξ 2 + k 2 ) = e x ξ 2 + k 2 e d ξ 2 + k 2 · 1 e 2 x ξ 2 k 2 1 e 2 d ξ 2 k 2 e x ξ 2 + k 2 e d ξ 2 + k 2 ,
inequality (1) can be arrived at.
By the Taylor’s expansion,
sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 = 1 ξ 2 + k 2 n = 0 ( x ξ 2 + k 2 ) 2 n + 1 ( 2 n + 1 ) ! = n = 0 ( ξ 2 + k 2 ) 2 n x 2 n + 1 ( 2 n + 1 ) ! d n = 0 ( x ξ 2 + k 2 ) 2 n ( 2 n ) ! = d cosh ( x ξ 2 + k 2 ) ,
we obtain (2). □
In the following, we will give error estimate for u u α , δ , v v α , δ and w w α , δ in 0 < x < d and at boundary x = d , respectively. The convergence results will be obtained while we choose a suitable regular parameter α .

3.1. Approximation Theorems

In this section, we shall give the stable estimates of the proposed regularization method for the case of 0 < x < d .
Theorem 1.
Let u ( x , y ) be the exact solution of problem (1) with the exact input data f ( y ) , and let u α , δ ( x , y ) be the regularized solution of problem (13) with the noisy data f δ ( y ) . Assume that conditions (4) and (5) hold, we have the following estimate:
u u α , δ < 12 E e ( d x ) α + 7 δ e x ( 2 α + k ) .
Furthermore, if we select regular parameter α as
α = 1 2 d ln ( E / δ ) ,
we obtain
u u α , δ < 12 E ( d + x ) / 2 d δ ( d x ) / 2 d + 7 e x k E x / d δ 1 x / d .
Proof. 
Suppose that conditions (4) and (5) hold, using Parseval formula (10), we have
u u α , δ 2 = u ^ u ^ α , δ 2 = 2 α | P ( ξ ) f ^ ( ξ ) | 2 d ξ + 2 α α | P ( ξ ) ( f ^ ( ξ ) 2 α ξ α f ^ δ ( ξ ) ) | 2 d ξ + α α | P ( ξ ) ( f ^ ( ξ ) f ^ δ ( ξ ) | 2 d ξ + α 2 α | P ( ξ ) ( f ^ ( ξ ) 2 α ξ α f ^ δ ( ξ ) ) | 2 d ξ + 2 α + | P ( ξ ) f ^ ( ξ ) | 2 d ξ ,
where
P ( ξ ) = cosh ( x ξ 2 + k 2 ) , ( ξ R ) .
If ξ [ α , 2 α ] , then 0 < ξ α α < 1 .
According to Minkowski inequality, there is
( α 2 α | P ( ξ ) ( f ^ ( ξ ) 2 α ξ α f ^ δ ( ξ ) ) | 2 d ξ ) 1 / 2 = | | P ( ξ ) ( f ^ ( ξ ) f ^ δ ( ξ ) + ξ α α f ^ δ ( ξ ) ) | | H 0 [ α , 2 α ] P ( ξ ) ( f ^ ( ξ ) f ^ δ ( ξ ) H 0 [ α , 2 α ] + P ( ξ ) f ^ δ ( ξ ) H 0 [ α , 2 α ] 2 P ( ξ ) ( f ^ ( ξ ) f ^ δ ( ξ ) H 0 [ α , 2 α ] + P ( ξ ) f ^ ( ξ ) H 0 [ α , 2 α ] 2 P ( ξ ) ( f ^ ( ξ ) f ^ δ ( ξ ) + A ( ξ ) h 1 ^ ( ξ ) 2 δ sup | ξ | [ α , 2 α ] | P ( ξ ) | + E sup | ξ | [ α , 2 α ] | A ( ξ ) | ,
where,
A ( ξ ) = cosh ( x ξ 2 + k 2 ) cosh ( d ξ 2 + k 2 ) , ( ξ R ) .
Therefore, we have
u u α , δ 2 = u ^ u ^ α , δ 2 2 E 2 ( sup | ξ | 2 α | A ( ξ ) | ) 2 + ( 4 δ sup ξ [ 2 α , α ] | P ( ξ ) | + 3 E sup ξ [ 2 α , α ] | A ( ξ ) | ) 2 + δ 2 ( sup ξ [ α , α ] | P ( ξ ) | ) 2 + ( 2 δ sup ξ [ α , 2 α ] | P ( ξ ) | + E sup ξ [ α , 2 α ] | A ( ξ ) | ) 2 .
From items (3) and (4) of Lemma 1, we have
u u α , δ 2 8 E 2 e ( d x ) 4 α + ( 4 δ e x ( 2 α + k ) + 6 E e ( d x ) α ) 2 + δ 2 e 2 x ( α + k ) + ( 2 δ e x ( 2 α + k ) + 2 E e ( d x ) α ) 2 .
Using inequality A + B < A + B ( A > 0 , B > 0 ) , we obtain
u u α , δ < 4 E e ( d x ) 2 α + 4 δ e x ( 2 α + k ) + 6 E e ( d x ) α + δ e x ( α + k ) + 2 δ e x ( 2 α + k ) + 2 E e ( d x ) α < 12 E e ( d x ) α + 7 δ e x ( 2 α + k ) .
Choosing the parameter α as (16), then (17) holds. □
Similarly, we have the following error estimate for problem (2).
Theorem 2.
Let v ( x , y ) be the exact solution of problem (2) with the exact input data g ( y ) , and let v α , δ ( x , y ) be the regularized solution of problem (14) with the noisy data g δ ( y ) . Assume that conditions (4) and (5) hold, we have the following estimate:
v v α , δ < 6 E e ( d x ) α + 7 d δ e x ( 2 α + k ) .
Furthermore, if we select regular parameter α as (16), then
v v α , δ < 6 E ( d + x ) / 2 d δ ( d x ) / 2 d + 7 d e x k E x / d δ 1 x / d .
Moreover, according to the results of Theorems 1 and 2 and Minkowski inequality, we get the Theorem 3 as follows.
Theorem 3.
Let w ( x , y ) be the exact solution of problem (3) with the exact input data f ( y ) , g ( y ) , and let w α , δ ( x , y ) be its approximate solution with the noisy data f δ ( y ) , g δ ( y ) . Assume that conditions (4) and (5) hold, we have the following estimate:
w w α , δ < 18 E e ( d x ) α + 7 ( d + 1 ) δ e x ( 2 α + k ) .
Furthermore, if we select regular parameter α as (16), then
w w α , δ < 18 E ( d + x ) / 2 d δ ( d x ) / 2 d + 7 ( d + 1 ) e x k E x / d δ 1 x / d .

3.2. Approximation Estimate at Boundary

Note that the error estimates in above section only solve our problems for 0 < x < d and do not give any useful information at x = d . In order to obtain the stability estimates of problems (1) and (2) at x = d , we need a stronger a priori assumption instead of (5):
max { h 1 ( · ) H r , h 2 ( · ) H r } E r , r > 0 ,
where constant E r > 0 dependents only on r.
Theorem 4.
Let u ( d , y ) be the solution of the Cauchy problem (1) and u α , δ ( d , y ) be solution of modified problem (13) at x = d . Suppose that conditions (4) and (22) hold, we have
u ( d , · ) u α , δ ( d , · ) < 6 E r ( 1 + α 2 ) r / 2 + 7 δ e d ( 2 α + k ) .
If we select
α = 1 4 d ln ( E r / δ ) ,
there is
u ( d , · ) u α , δ ( d , · ) < 6 E r ( 4 d ln ( E r / δ ) ) r + 7 E r 1 / 2 e d k δ 1 / 2 .
Proof. 
From equality (10), adoption similar analysis method with Theorem 1, we have
u ( d , · ) u α , δ ( d , · ) 2 = u ^ ( d , · ) u ^ α , δ ( d , · ) 2 = 2 α | 1 ( 1 + ξ 2 ) r / 2 ( 1 + ξ 2 ) r / 2 u ^ ( d , ξ ) | 2 d ξ + 2 α α | P ( ξ ) ( f ^ ( ξ ) 2 α ξ α f ^ δ ( ξ ) ) | 2 d ξ + α α | P ( ξ ) ( f ^ ( ξ ) f ^ δ ( ξ ) | 2 d ξ + α 2 α | P ( ξ ) ( f ^ ( ξ ) 2 α ξ α f ^ δ ( ξ ) ) | 2 d ξ + 2 α + | 1 ( 1 + ξ 2 ) r / 2 ( 1 + ξ 2 ) r / 2 u ^ ( d , ξ ) | 2 d ξ 2 E r 2 ( sup | ξ | 2 α | B ( ξ ) | ) 2 + ( 4 δ sup ξ [ 2 α , α ] | P ( ξ ) | + 3 E r sup ξ [ 2 α , α ] | B ( ξ ) | ) 2 + δ 2 ( sup ξ [ α , α ] | P ( ξ ) | ) 2 + ( 2 δ sup ξ [ α , 2 α ] | P ( ξ ) | + E r sup ξ [ α , 2 α ] | B ( ξ ) | ) 2 ,
where
B ( ξ ) = 1 ( 1 + ξ 2 ) r / 2 , P ( ξ ) = cosh ( d ξ 2 + k 2 ) , ( ξ R ) .
Applying (4) of Lemma 1, we have
u ( d , · ) u α , δ ( d , · ) < 6 E r ( 1 + α 2 ) r / 2 + 7 δ e d ( 2 α + k ) .
Taking regularization parameter α as (24), then (25) holds. □
Similarly, combining (2) of Lemma 1, we have error estimation of problem (2) at boundary x = d .
Theorem 5.
Let v ( d , y ) be the solution of the Cauchy problem (2) and v α , δ ( d , y ) be the solution of modified problem (14) at x = d . Suppose that conditions (4) and (22) hold, we have
v ( d , · ) v α , δ ( d , · ) < 6 E r ( 1 + α 2 ) r / 2 + 7 d δ e d ( 2 α + k ) .
If we select α as (24), then
v ( d , · ) v α , δ ( d , · ) < 6 E r ( 4 d ln ( E r / δ ) ) r + 7 d E r 1 / 2 e d k δ 1 / 2 .
According the results of Theorem 4, Theorem 5 and Minkowski inequality, we get the following approximate estimate of problem (3).
Theorem 6.
Let w ( d , y ) be the solution of the Cauchy problem (3) and w α , δ ( d , y ) be its approximation solution at x = d . Suppose that conditions (4) and (22) hold, we have
w ( d , · ) w α , δ ( d , · ) < 12 E r ( 1 + α 2 ) r / 2 + 7 ( d + 1 ) δ e d ( 2 α + k ) .
If we select α as (24), then
w ( d , · ) w α , δ ( d , · ) < 12 E r ( 4 d ln ( E r / δ ) ) r + 7 ( d + 1 ) E r 1 / 2 e d k δ 1 / 2 .

4. Numerical Aspect

In this section, in order to test the feasibility and stability of our method, two numerical results are proposed. Numerical experiments are performed by MATLAB R2014b (MathWorks, Natick, MA, USA).
In the numerical examples, we select the discrete interval as 2 π y 2 π , the measurement data f δ ( y ) and g δ ( y ) are obtained as follows
f δ ( y ) = f + ϵ r a n d n ( s i z e ( f ) ) ,
where
f = ( f ( y 1 ) , f ( y 2 ) , , f ( y N ) ) , y 2 = 2 π + 4 π ( i 1 ) N 1 , i = 1 , 2 , , N .
Function ’ r a n d ( · ) ’ generates arrays of random numbers whose elements are normally disturbed with mean 0, variance ϵ 2 = 1 .
The error level δ is given by
δ = f f δ = 1 N i = 1 N ( f ( y i ) f δ ( y i ) ) 2 .
In numerical examples, we need to take the discrete Fourier transform of the data vector f δ as follows
f ^ δ ( ξ ) = h 2 π i = 1 N f δ ( y i ) e i ξ y i , π h ξ π h , h = 2 π N 1 .
And the discrete Fourier transform of u ^ α , δ ,
u α , δ ( x , y i ) = h ξ 2 π m = 1 N 1 u ^ α , δ ( x , y i ) e i ξ m y i .
where ξ m = π h + m h ξ , m = 1 , 2 , , N 1 , h ξ = 2 π h ( N 1 ) , and N is the total test points at y-axis.
To measure the accuracy of the numerical solution u α , δ , we define relative error r e l ( u ) between the exact solution u and approximate solution u α , δ :
r e l ( u ) = u u α , δ u
In following numerical experiments, we always take N = 30 , d = 1 , and fix the reconstructed position x = 0.2 , the a priori mollification parameter α is determined by (16).
Example 1.
It’s easy to verify that function
v ( x , y ) = sin ( y / 2 ) sinh ( x 1 / 4 + k 2 ) 1 / 4 + k 2
is the exact solution of problem (2), where g ( y ) = sin ( y ) .
Example 2.
Apparently, the function
u ( x , y ) = cos ( y 4 ) cosh ( x 1 16 + k 2 )
is the exact solution of problem (1), where f ( y ) = cos ( y 4 ) .
To verify the stability of our method, different noisy levels for δ = 1 × 10 3 , 1 × 10 4 , 1 × 10 5 , 1 × 10 6 are presented, respectively. Table 1 and Table 2 show the results associated with different error levels δ of Example 1 and 2. Note that the relative error depends not only on error level δ but also on wave number k. However, due to the characteristic of the selected parametric formula, the numerical results show that the optimal range of error level within 10 5 and 10 3 .
Figure 1 shows the reconstructed solution and exact solution for Example 1 corresponding to noise levels δ = 1 × 10 6 , δ = 1 × 10 3 with k = 0.8 and k = 10 , respectively. Figure 2 shows the reconstructed solution and exact solution for Example 2 corresponding to noise levels δ = 1 × 10 3 with k = 0.8 . and k = 5 . Note that the proposed method is effective and stable to noisy data.
Remark 2.
In above two examples, the value of wave number k which we take is relatively small. In fact, when k [ 0 , 10 ] , the result is still valid, when k > 10 , the relative error will gradually increase, and the fitting effect will become more and more undesirability. Moreover, if we take N to be odd, there will be singularities, in this case, instead of [ 2 π , 2 π ] , we consider interval [ 2 π e p s , 2 π + e p s ] , where e p s = 10 8 is the number of disturbance.

5. Conclusions

In this paper, a mollification method with the de la Vallée kernel for solving a Cauchy problem of the Helmholtz-type equation in a strip domain is proposed; the stable approximate estimates are obtained. Two numerical examples are investigated, and the relative errors between the regularization solution and the exact solution are presented. The numerical examples do verify the numerical efficiency and stability of our method. Furthermore, the accuracy of the procedure is quite acceptable, if noise levels are within 10 5 and 10 3 .
However, the selection of regular parameters in this paper depends on the given function. In fact, we always obtain discrete data onto observation, the formulas for calculating parameters α in this paper are no longer applicable. At this time, we use the Golden Section Search method to calculate parameters α , which we will use in later papers.

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. Wang, Y.F.L. Computational Methods for Applied Inverse Problems; Anatoly, G., Yang, C., Eds.; Higher Education Press: Beijing, China, 2012; pp. 30–72. ISBN 9787040344998. [Google Scholar]
  2. Bayliss, A.; Goldstein, C.; Turkel, E.T. An iterative method for Helmholtz equztion. J. Comput. Phys. 1983, 49, 443–457. [Google Scholar] [CrossRef]
  3. Benamou, J.D.; Desprès, B.T. A domain decomposition method for the Helmholtz equation and related optimal control problems. J. Comput. Phys. 1996, 6, 1–30. [Google Scholar] [CrossRef]
  4. Ihlengurg, F.; Babuska, I.T. Finite element solution of the Helmholtz equation with high wave number Part two: The h-p version of the FEM. Siam J. Numer. Anal. 1997, 34, 315–358. [Google Scholar] [CrossRef]
  5. Hadamard, J.L. Hep Word’s Classics. In Lectures on the Cauchy’s Problem in Linear Partial Differential Equations; Yale University Press: New Haven, CT, USA, 2007; pp. 10–120. ISBN 9787040448047. [Google Scholar]
  6. Kirsch, A.L. An Introduction to the Mathematical Theory of Inverse Problems, 2nd ed.; Applied Mathematical Sciences: New York, NY, USA, 2011; pp. 73–169. ISBN 978-1-4419-8473-9. [Google Scholar]
  7. Marin, L.; Elliott, L.; Heggs, P.J.T. BEM solution for the Cauchy problem associated with Helmholtz-type equations by the Landerweber method. Eng. Anal. Bound Elem. 2004, 28, 1025–1034. [Google Scholar] [CrossRef]
  8. Marin, L.; Elliott, L.; Heggs, P.J.T. Conjugate gradient-boudary element solution to the Cauchy problem for Helmholtz-type equations. Comput. Mech. 2003, 31, 367–377. [Google Scholar] [CrossRef]
  9. Marin, L.; Lesnic, D.T. The method of fundamental solutions for Cauchy problem associated with two-dimensional Helmholtz-type equations. Comput. Struct. 2005, 83, 267–278. [Google Scholar] [CrossRef]
  10. Feng, X.L.; Fu, C.L.; Cheng, H.T. The Fourier regularization method for solving the Helmholtz equations. Appl. Num. Math. 2011, 59, 2625–2640. [Google Scholar] [CrossRef]
  11. Yang, F.; Zhang, P.; Li, X.X.T. The truncation method for the Cauchy problem of the in homogeneous Helmholtz equation. Appl. Anal. 2017, 68, 1–14. [Google Scholar] [CrossRef]
  12. Nikol’skii, S.M.L. Approximation of Functions of Several Variables and Imbedding Theorems; Springer: New York, NY, USA, 1975; pp. 34–320. ISBN 9783642657139. [Google Scholar]
  13. Manselli, P.; Miller, K.T. Calculation of the surface temperature and heat flux on one side of a wall from measurements on the apposite side. Ann. Mat. Pura Appl. 1980, 123, 161–183. [Google Scholar] [CrossRef]
  14. Murio, D.A.T. 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] [Green Version]
  15. Hào, D.N.T. A mollification method for ill-posed problems. Numer. Math. 1994, 68, 469–506. [Google Scholar] [CrossRef] [Green Version]
  16. Murio, D.A.L. The Mollification Method and the Numerical Solution of Ill-Posed Problems; John Wiley and Sons Inc.: Hoboken, NJ, USA, 2011; pp. 23–56. ISBN 0471594083. [Google Scholar]
  17. Cheng, H.; Feng, X.L.; Fu, C.L.T. 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. Li, Z.P.; Fu, C.L.T. A mollification method for a Cauchy problem for the Laplace equation. Appl. Math. Comput. 2011, 217, 9209–9218. [Google Scholar] [CrossRef]
  19. 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]
Figure 1. Example 1: The comparison of numerical effects between the exact solution and the approximate solution: (a) For the case k = 0.8 , δ = 1 × 10 6 ; (b) For the case k = 10 , δ = 1 × 10 3 .
Figure 1. Example 1: The comparison of numerical effects between the exact solution and the approximate solution: (a) For the case k = 0.8 , δ = 1 × 10 6 ; (b) For the case k = 10 , δ = 1 × 10 3 .
Mathematics 07 00360 g001
Figure 2. Example 2: The comparison of numerical effects between exact solution and the approximate solution: (a) For the case k = 0.8 , δ = 1 × 10 3 ; (b) For the case k = 5 , δ = 1 × 10 3 .
Figure 2. Example 2: The comparison of numerical effects between exact solution and the approximate solution: (a) For the case k = 0.8 , δ = 1 × 10 3 ; (b) For the case k = 5 , δ = 1 × 10 3 .
Mathematics 07 00360 g002aMathematics 07 00360 g002b
Table 1. The relative error r e l ( v ) of Example 1.
Table 1. The relative error r e l ( v ) of Example 1.
δ 1 × 10 3 1 × 10 4 1 × 10 5 1 × 10 6
r e l ( v ) ( k = 0.5 ) 0.23940.23970.23990.1238
r e l ( v ) ( k = 3 ) 0.20110.20100.20080.2428
Table 2. The relative error r e l ( u ) of Example 2.
Table 2. The relative error r e l ( u ) of Example 2.
δ 1 × 10 3 1 × 10 4 1 × 10 5 1 × 10 6
r e l ( u ) ( k = 0.5 ) 0.0015450.00016020.00012030.1038
r e l ( u ) ( k = 3 ) 0.0013830.00020110.074170.5989

Share and Cite

MDPI and ACS Style

He, S.; Feng, X. A Regularization Method to Solve a Cauchy Problem for the Two-Dimensional Modified Helmholtz Equation. Mathematics 2019, 7, 360. https://doi.org/10.3390/math7040360

AMA Style

He S, Feng X. A Regularization Method to Solve a Cauchy Problem for the Two-Dimensional Modified Helmholtz Equation. Mathematics. 2019; 7(4):360. https://doi.org/10.3390/math7040360

Chicago/Turabian Style

He, Shangqin, and Xiufang Feng. 2019. "A Regularization Method to Solve a Cauchy Problem for the Two-Dimensional Modified Helmholtz Equation" Mathematics 7, no. 4: 360. https://doi.org/10.3390/math7040360

APA Style

He, S., & Feng, X. (2019). A Regularization Method to Solve a Cauchy Problem for the Two-Dimensional Modified Helmholtz Equation. Mathematics, 7(4), 360. https://doi.org/10.3390/math7040360

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