238
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Numerical method for a Cauchy problem for multi-dimensional Helmholtz equation

ORCID Icon & ORCID Icon
Article: 2321450 | Received 20 Jul 2023, Accepted 15 Feb 2024, Published online: 11 Mar 2024

Abstract

The main focus of this research is to address the Cauchy problem of the multi-dimensional Helmholtz equation with mixed boundary conditions. This problem is known to be ill-posed according to Hadamard's definition. To tackle this issue, we propose the mollification regularization method based on exponential decay. Using prior rule and posterior rule to create a regular approximation solution and convergence of the solution is also provided. Furthermore, the proposed method is shown to be robust against data disruption noise, making it a reliable approach for solving the Cauchy problem of the multi-dimensional Helmholtz equation with mixed boundary conditions.

Mathematics Subject Classifications:

1. Introduction

The inverse problem of the Helmholtz equation has found numerous applications in various fields such as geomorphology, quality exploration, remote sensing research, and optical signal processing. These applications span across technologies like microwave, radar, sonar, and laser. Given its significance, finding a numerical solution for the Helmholtz equation has been a prominent research area for almost 50 years. The specific form of the solution depends on the boundary conditions, which can be Dirichlet, Neumann, or a combination of both. However, according to Hadamard, the problem is considered extremely ill-posed. This means that even small changes in the input data can lead to significant changes in the solution. Therefore, it is crucial to develop an algorithm that is precise, stable, reliable, and efficient for solving the Cauchy problem associated with the Helmholtz equation.

The uniqueness and stability of the inverse Helmholtz problem have been investigated by several researchers [Citation1–6]. In order to solve this problem numerically, various methods have been proposed. These include the Fourier transform [Citation7–9], the continuation approach [Citation10], the linear sampling technique [Citation11,Citation12], the Landweber regular method (BEM) [Citation13], the Tikhonov regular method [Citation14], and the mollification regularization method [Citation15]. These numerical methods for addressing the inverse problem of the Helmholtz equation and applied in various research studies.

While the multi-dimensional Helmholtz equation is used in various applications, there has been relatively limited research specifically focussed on the multi-dimensional Helmholtz equation. Many existing numerical methods for solving the Helmholtz equation are primarily developed for one-dimensional or two-dimensional problems and may not be easily generalized to the multi-dimensional case. The multi-dimensional Helmholtz equation presents additional challenges due to the increased complexity of the problem. The higher dimensionality introduces more variables and parameters, making it more difficult to find efficient and accurate numerical solutions. As a result, there is a need for further research and development of numerical methods that are specifically to address the multi-dimensional Helmholtz equation. It can be seen from the references that the exponential decay kernel has great advantages in dealing with the inverse problems of fractional partial differential equations. Unfortunately, it has not been found that an exponential decay kernel is used to solve the Cauchy problem of the Helmholtz equation. Based on the above consideration, this paper presents a mollification regularization method of exponential decay kernel to solve the Cauchy problem of the multi-dimensional Helmholtz equation. The validity and stability of the proposed method are verified theoretically and numerically.

The idea behind the mollification approach is that if the data is provided inaccurately, we want to use a mollification operator that will turn the incorrect data into issue types that are well-posed, like [Citation16–20]. In this paper, we solve the Cauchy problem using the mollification method based on an exponential decay kernel and show that our solution is stable and effective.

The structure of this essay is as follows: The ill-posed of Problem (Equation1) is demonstrated in Section 2. We explain the exponential decay kernel and some of its characteristics in Section 3. Some error estimate findings are given in 0<x<1 and at boundary x = 1 in Section 4. In Section 5, numerical experiments are used to show the method's effectiveness.

2. Model problem and its ill-posedness

Consider the following (2.1) {Δw(x,y)+k2w(x,y)=0,0<x<1,yRn,w(0,y)=φ(y),yRn,wx(0,y)=ψ(y),yRn,(2.1) here multi-dimensional Laplace operator is Δ=2y12+2y22++2yn2 and wave number is constant k>0. The data φ,ψ must be used to calculate the solution w(x,y), however they can only be measured. Since there exist measurement mistakes which recorded as: (φδ(y),ψδ(y)) and satisfy (2.2) φδφHp+ψδψHpδ.(2.2) The level of error is represented by the constant δ>0 here. f()Hp:=(Rn(1+η2)p|f^(η)|2dη)12.The Fourier transform of the function f(y) is f^(η)=1(2π)n/2Rnf(y)e.ydy,yRn.f(y)'s inverse Fourier transform is f(y)=1(2π)n/2Rnf^(η)e.ydξ.If p = 0, then H0(Rn)=L2(Rn).

According to the superposition principle of solutions, the solution of problem (Equation1) is the sum of the following two problems (2.3) {Δw1(x,y)+k2w1(x,y)=0,0<x<1,yRn,w1(0,y)=φ(y),yRn,(w1)x(0,y)=0,yRn(2.3) and (2.4) {Δw2(x,y)+k2w2(x,y)=0,0<x<1,yRn,w2(0,y)=0,yRn,(w2)x(0,y)=ψ(y),yRn(2.4) Using the Fourier transform for the variable yRn, we obtain (2.5) {(w1)^xx+(η2+k2)w1^=0,0<x<1,ηRn,w1^(0,η)=φ^(η),ηRn,(w1^)x(0,η)=0,ηRn(2.5) and (2.6) {(w2)^xx+(η2+k2)w2^=0,0<x<1,ηRn,w2^(0,η)=0,ηRn,(w2^)x(0,η)=ψ^(η),ηRn(2.6) The solution to issue (Equation2.5) is (2.7) w1^(x,η)=cosh(xη2k2)φ^(η).(2.7) Similarly, the solution to problem (Equation2.6) is (2.8) w2^(x,η)=sinh(xη2k2)η2k2ψ^(η).(2.8) The functions cosh(xη2k2) and sinh(xη2k2)η2k2 are unbounded with respect to the variable η, and a small change in the measured data φ(y) and ψ(y) may result in a dramatically large error in the solutions w1(x,y), w2(x,y). As a result, Problem (Equation2.1) is severely ill-posed.

3. Exponential decay kernel

The exponential decay kernel is defined as: (3.1) Uμ(x):=12μe|x|μ,0<μ<1,xRn.(3.1) and there is RnUμ(x)dx:=Rn12μe|x|μdx=1,0<μ<1.here 0<μ<1 is a regularization parameter and convolution ωμ is defined as follows: (3.2) ωμf(x):=Uμf(x)=RnUμ(t)f(xt)dt=RnUμ(xt)f(t)dt.(3.2) Uμ(x)'s Fourier transform is (3.3) U^μ(η)=Rn12μe|x|μeiηxdx=11+μ2η2(3.3)

Lemma 3.1

Letting U,fL2(Rn), we have (3.4) (Uf)^(η)=(2π)n/2U^(η)f^(η).(3.4) So, we get (3.5) {Δw1μ,δ(x,y)+k2w1μ,δ(x,y)=0,0<x<1,yRn,w1μ,δ(0,y)=(Uμφδ)(y),yRn,(w1μ,δ)x(0,y)=0,yRn(3.5) and (3.6) {Δw2μ,δ(x,y)+k2w2μ,δ(x,y)=0,0<x<1,yRn,w2μ,δ(0,y)=0,yRn,(w2μ,δ)x(0,y)=(Uμψδ(y),yRn(3.6) The solution to issue (Equation3.5) in frequency domain is: w^1μ,δ(x,η)=(Uμφδ^)(η)cosh(xη2k2)=(2π)n/211+μ2η2φ^δ(η)cosh(xη2k2).In a similar vein, the solution to problem (Equation3.6) is: w^2μ,δ(x,η)=(Uμψδ^)(η)sinh(xη2k2)η2k2=(2π)n/211+μ2η2ψ^δ(η)sinh(xη2k2)η2k2.As a result, the solution to issue (Equation2.1) is w^μ,δ(x,η)=(Uμφδ^)(η)cosh(xη2k2)+(Uμψδ^)(η)sinh(xη2k2)η2k2,and wμ,δ(x,y)=(2π)n/2Rn[(Uμφδ^)(η)cosh(xη2k2)+(Uμψδ^)(η)sinh(xξ2k2)η2k2]e.ydη.

Lemma 3.2

see [Citation21]

The following inequalities hold for 0<x1, |η|>k

  1. cosh(xη2k2)ex(|η|+k);

  2. sinh(xη2k2)η2k2ex(|η|+k);

  3. cosh(xη2k2)coshη2k22e(1x)(|η|k);

  4. sinh(xη2k2)sinhη2k2xe(1x)(|η|k).

Lemma 3.3

When 0<x1,|η|k, there is sin(xk2η2)k2η2cos(xk2η2);

4. Error estimates and regularization

4.1. An a priori approach

We need to two priori bound, (4.1) w1(1,)H0(Rn)E,w2(1,)H0(Rn)E,(4.1) where E is a positive constant.

In this section, we will give the stable convergence estimate results in the case of 0<x<1. Assume that w(x,y) is the exact solution to Problem (Equation2.1), and wμ,δ(x,y) is the solution that results from a regular approximation.

Theorem 4.1

Assume Inequalities (Equation2.2) and (Equation4.1) hold. There is

  1. When |η|>k, we have (4.2) wwμ,δ34e(1x)ke(1x)+2(2π)n/2exkex24μ2δ,(4.2) when μ is chosen as (4.3) μ=1ln(E/δ),(4.3) we have (4.4) wwμ,δ3E4ln(E/δ)e(1x)ke(1x)+2(2π)n/2exkEx24δ(1x24)0,δ0.(4.4)

  2. When |η|k, there is (4.5) wwμ,δEμ2k2(1cos(k)+sin(xk)sin(k))+2(2π)n/2δ,(4.5) μ set as, (4.6) μ=1ln(E/δ),(4.6) we have (4.7) wwμ,δEln(E/δ)k2(1cos(k)+sin(xk)sin(k))+2(2π)n/2δ0,δ0.(4.7)

Proof.

The triangle inequality provides us with (4.8) wwμ,δw1w1μ,δ+w2w2μ,δ.(4.8) Apply Parseval equality, there is w1w1μ,δ=w^1w^1μ,δw^1w^1μ,0+w^1μ,0w^1μ,δ=(1(2π)n/21+μ2η2)φ^(η)cosh(xη2k2)+(2π)n/21+μ2η2cosh(xη2k2)(φ^(η)φδ(η)^)=(1(2π)n/21+μ2η2)cosh(xη2k2)1cosh(η2k2)u^1(1,η)+(2π)n/21+μ2η2cosh(xη2k2)δEsupηRn|(1(2π)n/21+μ2η2)cosh(xη2k2)cosh(η2k2)|+δsupηRn|((2π)n/21+μ2η2cosh(xη2k2))|EsupηRn|A(η)|+δsupηRn|B(η)|When |η|>k, it follows from inequalities (1) and (3) of Lemma 3.2, there is |A(η)|μ2e(1x)kηe(1x)η.Letting t1(η)=ηe(1x)η,t1(η)=0, there is η=1(1x).According to the principle of maximum value, we know η=1(1x) is the maximum point, there is (4.9) |A(η)|μ2e(1x)k1e(1x).(4.9) When μ0, we have μ2η20, and we obtain 1+μ2η2eμ2η2. Thus, we get |B(η)|(2π)n/2exkeμ2η2.Similarly, we can obtain (4.10) |B(η)|(2π)n/2exkex24μ2.(4.10) Combining the estimates of (Equation4.9) and (Equation4.10), we get (4.11) w1w1μ,δEμ2e(1x)k1e(1x)+(2π)n/2exkex24μ2δ.(4.11) When |η|k, |A(η)|μ2η2cos(xk2|η|2)cos(k2|η|2).Letting γ=k2η2, when 0ηk and 0<π2, function cosγ is a monotonically decreasing function.

So, (4.12) |A(η)|μ2k21cosk.(4.12) (4.13) |B(η)|(2π)n/2cos(xη2k2)(2π)n/2.(4.13) Combining the estimates of (Equation4.12) and (Equation4.13) (4.14) w1w1μ,δEμ2k21cos(k)+(2π)n/2δ.(4.14) is holds.

Similarly, using the same analysis as described above and Lemma 3.2's terms (1) and (3), there is

When |η|>k, |C(η)|=12|A(η)|μ4e(1x)k1e(1x),|D(η)|=|B(η)|(2π)n/2exkex24μ2.So, (4.15) w2w2μ,δ4e(1x)k1e(1x)+δ(2π)n/2exkex24μ2.(4.15) When |η|k, we have |C(η)|μ2η2sin(xk2|η|2)sin(k2|η|2).Letting γ=k2η2, we get function f(γ)=sin()sinγ. When 0γk, noting that 0<π2, we have f(γ)0. Thus, for γ[0,k], f(γ) is a monotone increasing-function. Then we have f(γ)f(k)=sin(xk)sink. So, |C(η)|μ2k2sin(xk)sin(k).|D(η)|(2π)n/2cos(xk2η2)(2π)n/2.Thus, (4.16) w2w2μ,δEμ2k2sin(xk)sin(k)+δ(2π)n/2.(4.16) is set up.

Applying the results of (Equation4.11) and (Equation4.16), we obtain (Equation4.2). Combining the results of (Equation4.14) and (Equation4.16), we get (Equation4.5).

The Theorem 4.1 is completed.

Theorem 4.1 states that when 0<x<1, we discussed two cases of |η|>k and |η|k respectively, and it can be seen from formulas (Equation4.4) and (Equation4.7) that our regular solution converges to the exact solution.

Next, we will prove convergence at the boundary x = 1, we propose a stronger priori bound as follows: (4.17) w(1,)HpEp.(4.17)

Theorem 4.2

When x = 1, inequalities (Equation2.2) and (Equation4.17) hold. We have

  1. If |η|>k, there is (4.18) wwμ,δ2Ep(μ2)pp+1+2(2π)n/2eke14μ2δ.(4.18) When μ is as follows: (4.19) μ=1ln(Ep/δ),(4.19) (4.20) wwμ,δ2Ep(1ln(Ep/δ))pp+1+2(2π)n/2ekEp14δ340,δ0(4.20) is obtained.

  2. If |η|k, we have (4.21) wwμ,δ2Epμ2k2+2(2π)n/2δ.(4.21) When (Equation4.19) is selected as μ, there is (4.22) wwμ,δ2Epk2ln(Ep/δ)+2(2π)n/2δ0,δ0.(4.22)

Proof.

The triangle inequality provides us with (4.23) w(1,)wμ,δ(1,)w1(1,)w1μ,δ(1,)+w2(1,)w2μ,δ(1,).(4.23) By Parseval equality, there is w1(1,)w1μ,δ(1,)=w^1(1,)w^1μ,δ(1,)w^1(1,)w^1μ,0(1,)+w^1μ,0(1,)w^1μ,δ(1,)=(1(2π)n/21+μ2η2)φ^(η)cosh(η2k2)+(2π)n/21+μ2η2cosh(η2k2)(φ^(η)φδ(η)^)=(1(2π)n/21+μ2η2)(1+η2)p2(1+η2)p2u^1(1,η)+(2π)n/21+μ2η2cosh(η2k2)δEpsupηRn|(1(2π)n/21+μ2η2)(1+η2)p2|+δsupηRn|(2π)n/21+μ2η2eη2k2|EpsupηRn|E(η)|+δsupηRn|F(η)|,here, |E(η)|=|(1(2π)n/21+μ2η2)(1+η2)p2|, We divide the analysis into two cases:

One case is |η|>η, |E(η)|<1|η|p<1ηp=μη,η=(1μ)1p+1;

Other case is |η|η, |E(η)|μ2η2μ2η2.

Thus, we can obtain: (4.24) |E(η)|μ2(1μ)2p+1=(1μ)2pp+1.(4.24) It is similar to B(η), (4.25) |F(η)|=(2π)n/2eke14μ2.(4.25) Combining the results of (Equation4.24) and (Equation4.25), (4.26) w1(1,)w1μ,δ(1,)Ep(1μ)2pp+1+(2π)n/2eke14μ2δ.(4.26) is holds.

When |η|k, |E(η)|μ2η2μ2k2.|F(η)|(2π)n/2.Thus, (4.27) w1(1,)w1μ,δ(1,)Epμ2k2+(2π)n/2δ.(4.27) Using Lemma 3.2's terms (2) and (4), taking a similar analysis as before, we arrive at |G(η)|=|E(η)|,|H(η)|=|F(η)|.When |η|>k, (4.28) w2(1,)w2μ,δ(1,)Ep(1μ)2pp+1+(2π)n/2eke14μ2δ.(4.28) is set up.

When |η|k, (4.29) w2(1,)w2μ,δ(1,)Epμ2k2+(2π)n/2δ.(4.29) is holds.

Applying the results of (Equation4.26) and (Equation4.28), (Equation4.18) is set up. Applying the results of (Equation4.27) and (Equation4.29), (Equation4.21) is holds.

The Theorem 4.2 is completed.

4.2. A posteriori methodology

The posterior regularization parameter selection procedure is provided, and it states that the solution μ of the following equation is chosen as the posterior regularization parameter in accordance with the Morozov inconsistency principle [Citation22].

We define w1(x,y) as (4.30) (2π)n/21+μ2η2φ^δ(η)φ^δ(η)=τδ.(4.30) Similarly, (4.31) (2π)n/21+μ2η2ψ^δ(η)ψ^δ(η)=τδ.(4.31) Here, τ>0 is constant.

Lemma 4.3

There are the following inequalities: (4.32) (2π)n/21+μ2η2φ^δ(η)φ^(η)(τ+1)δ,(2π)n/21+μ2η2ψ^δ(η)ψ^(η)(τ+1)δ.(4.32)

Proof.

(2π)n/21+μ2η2φ^δ(η)φ^(η)=(2π)n/21+μ2η2φ^δ(η)φ^δ(η)+φ^δ(η)φ^(η)(2π)n/21+μ2η2φ^δ(η)φ^δ(η)+φ^δ(η)φ^(η)τδ+δ=(τ+1)δ.Similarly, (2π)n/21+μ2η2ψ^δ(η)ψ^(η)x(τ+1)δ.The Lemma 4.3 is proved.

Lemma 4.4

If μ1 is the solution of (Equation4.30), and μ2 is the solution of (Equation4.31), letting 1μ=max{1μ1,1μ2}. Then, (4.33) 1μ(1823Ep(τ1)δ)12.(4.33) is holds.

To prove Lemma 4.4, we use the following two inequalities: (4.34) exs2cosh(xs)exs(4.34) and (4.35) cosh(x)(sinhxx)3.(4.35)

Proof.

Using triangle inequality, in Equations (Equation4.34) and (Equation2.2) hold: τδ=(2π)n/21+μ2η2φ^δ(η)φ^δ(η)=(1(2π)n/21+μ2η2)φ^δ(η)=(1(2π)n/21+μ2η2)φ^δ(η)(1(2π)n/21+μ2η2)φ^(η)+(1(2π)n/21+μ2η2)φ^(η)(1(2π)n/21+μ2η2)(φ^δ(η)φ^(η))+(1(2π)n/21+μ2η2)φ^(η)δ+(1(2π)n/21+μ2η2)(1+η2)p2(1+η2)p2u1(1,)coshη2k2δ+supηRn|(1(2π)n/21+μ2η2)1coshη2k2(1+η2)p2|Epδ+4Epμ12thus, (4.36) 1μ124Ep(τ1)δ.(4.36) Similarly, inequalities (Equation4.35) and (Equation2.2) hold, (4.37) 1μ221823Ep(τ1)δ.(4.37) is set up.

The Lemma 4.4 is proved. In the proof of Lemma 4.4, we use the Taylor expansion of exponential function.

Theorem 4.5

The inequalities (Equation2.2), (Equation4.17), and (Equation4.21) are valid. Then, there is

  1. If |η|>k, (4.38) wwμ,δ(2δ(2π)n/2e(p+2)xk2e(p+2)2x216μ2+2exkp2(e2x24)p2Ep)2p+2((τ+1)δ)2p2+p.(4.38) is set up.

    If μ, is set to (Equation4.33), (4.39) wwμ,δ(2δ(2π)n/2e(p+2)xk2e(p+2)2x21823Ep16(τ1)δ+2exkp2(e2x24)p2Ep)2p+2((τ+1)δ)2p2+p0,δ0.(4.39) is holds.

  2. If |η|k, there is (4.40) wwμ,δ(2(2π)n/2δ+2Ep)2p+2((τ+1)δ)p2+p(4.40) When μ is chosen as (Equation4.33), we get (4.41) wwμ,δ(2(2π)n/21823Ep(τ1)+2Ep)2p+2((τ+1)δ)p2+p0,δ0.(4.41)

Proof.

The triangle inequality implies that w(1,)wμ,δ(1,)w1(1,)w1μ,δ(1,)+w2(1,)w2μ,δ(1,).Applying Parseval equality, there is w^1w^1μ,δ2=φ^(η)cosh(xη2k2)(2π)n/21+μ2η2cosh(xη2k2)φ^δ(η)2=cosh(xη2k2)(φ^(η)(2π)n/21+μ2η2φ^δ(η))2=Rn(cosh(xη2k2)2(φ^(η)(2π)n/21+μ2ξ2φ^δ(η))4p+2(φ^(η)(2π)n/21+μ2η2φ^δ(η))2pp+2[Rn(cosh(xη2k2)2(φ^(η)(2π)n/21+μ2η2φ^δ(η))4p+2)p+22dη]2p+2[Rn((φ^(η)(2π)n/21+μ2η2φ^δ(η))2(12p+2))p+2pdη]pp+2=[Rn(cosh(xη2k2)p+2(φ^(η)(2π)n/21+μ2ξ2φ^δ(η))2dη]2p+2[Rn(φ^(η)(2π)n/21+μ2η2φ^δ(η))2dη]pp+2=(cosh(xη2k2)p+22(φ^(η)(2π)n/21+μ2η2φ^δ(η))4p+2φ^(η)(2π)n/21+μ2η2φ^δ(η)2pp+2(cosh(xη2k2)p+22(2π)n/21+μ2η2φ^δ(η)cosh(xη2k2)p+22(2π)n/21+μ2η2φ^(η)+(cosh(xη2k2)p+22(2π)n/21+μ2η2φ^(η)(cosh(xη2k2)p+22φ^(η))4p+2((τ+1)δ)2pp+2(supηRn|(cosh(xη2k2)p+22(2π)n/21+μ2η2|δ+(cosh(xη2k2)p2(1(2π)n/21+μ2η2)(1+η2)p2(1+η2)p2u^2(1,))4p+2((τ+1)δ)2pp+2(δ|I(η)|+|J(η)|Ep)4p+2((τ+1)δ)2p2+p.If |η|>k, μ0, 1+μ2η2eμ2η2. |I(η)|(2π)n/2e(p+2)xk2ex|η|(p+2)2μ2η2.By the maximum principle. We have (4.42) |I(η)|(2π)n/2e(p+2)xk2e(p+2)2x216μ2.(4.42) Similarly, we get (4.43) |J(η)|exkp2e2x24.(4.43) By the results of (Equation4.42) and (Equation4.43), we obtain (4.44) w^1w^1μ,δ2(δ(2π)n/2e(p+2)xk2e(p+2)2x216μ2+exkp2(e2x24)p2Ep)4p+2((τ+1)δ)2p2+p.(4.44) If |η|k, we obtain |I(η)|(2π)n/2,|J(η)|Ep.And (4.45) w^1w^1μ,δ2((2π)n/2δ+Ep)4p+2((τ+1)δ)2p2+p.(4.45) Taking a similar process of the error estimates as w^1w^1μ,δ2, we can get

If |η|>k, (4.46) w^2w^2μ,δ2((2π)n/2e(p+2)xk2e(p+2)2x216μ2+exkp2(e2x24)p2Ep)4p+2((τ+1)δ)2p2+p(4.46) is holds.

If |η|k, there is (4.47) w^2w^2μ,δ2((2π)n/2δ+Ep)2p+2((τ+1)δ)2p2+p(4.47) Applying the (Equation4.44) and (Equation4.46), we get (Equation4.38). Unite the estimation results of (Equation4.45) and (Equation4.47) to (Equation4.41), we obtain (Equation4.40).

This completes the proof of Theorem 4.5.

5. Numerical aspects

In this section, we'll talk about the numerical examples of the put forward approach. The numerical experiment is carried out using MATLABR2017b. In the experiment that follows, we always choose N = 101 and choose the discrete interval as [10,10]×[10,10]. φδ=φ+ϵ(2rand(size(φ))1)is the measurement data.

The ‘rand(·)’ function is used to generate arrays of random numbers in which its elements are normally disturbed with a mean of 0, and the variance ϵ2=1. Let w and wμ,δ be the exact solution and the regular approximate solution of the following example respectively. The error norm is defined by δ=φφδ=1N×Ni=1Nj=1N(φφδ)2.Let rel(w)=wwμ,δwbe the relative error between the exact solution and approximate solution of the following examples.

Example 5.1

We use function φ(x,y)=ex2 as the precise data.

When x = 0.2 and x = 0.3, respectively, at various error levels δ and wave numbers, the results of Example 5.1 are shown in Tables  and , where rel(w) denotes the relative error between the precise solution and regularization solution.

Table 1. The Relative Error of Example 5.1 at x = 0.2.

Table 2. The relative error of Example 5.1 when x = 0.3.

It can be seen from these three tables that our method is applicable to not only small wave numbers but also to large wave numbers, and our method has good convergence in the interval and at the boundary.

From these tables, we can see that the results of the relative error rel(w) depend not only on the error level δ, but also on wave number k, and it can be seen from the three tables that our method is very stable (Tables and ).

Table 3. The relative error of Example 5.1 when x = 1, k = 100.

Table 4. The relative error in Example 5.1. with p = 1, k = 100.

Figures  show that our regularization method is effective and stable in the interval 0<x<1. Our regularization method is stable and effective at the x = 1 boundary, as shown in Figures .

Example 5.2

As the exact data for Problem (Equation2.1), we use function φ(y,z)=yzex2y2.

Figure 1. x = 0.1, δ=1×103, (a) Exact solution, (b) Regularized solution.

Figure 1. x = 0.1, δ=1×10−3, (a) Exact solution, (b) Regularized solution.

Figure 2. x = 0.2, δ=1×103, (a) Regularized solution, (b) Error.

Figure 2. x = 0.2, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 3. x = 0.5, δ=1×103, (a) Regularized solution, (b) Error.

Figure 3. x = 0.5, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 4. x = 1, p = 0.5, δ=1×103, (a) Exact solution, (b) Regularized solution.

Figure 4. x = 1, p = 0.5, δ=1×10−3, (a) Exact solution, (b) Regularized solution.

Figure 5. x = 1, p = 3, δ=1×103, (a) Regularized solution, (b) Error.

Figure 5. x = 1, p = 3, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 6. x = 1, p = 5, δ=1×103, (a) Regularized solution, (b) Error.

Figure 6. x = 1, p = 5, δ=1×10−3, (a) Regularized solution, (b) Error.

We do the analysis for numerical Example 5.2 under the prior regularization rules and the posterior regularization rules, and the analysis demonstrates the stability and effectiveness of our method. Equations (Equation4.30) and (Equation4.31) are solved by the dichotomy technique in the posterior regularization rule, where τ=1.1.

Table  shows that our method is superior to the method [Citation21], as can be shown. Our method has a less relative error than that in [Citation21], a better approximate effect, and it is more stable. The approach presented in this research is stable for p = 0.5 and p = 3, as shown in Table .

Table 5. Comparison between different regular solutions when x = 0.2, p = 0.5.

Table 6. The relative error of Example 5.2 when x = 1.

A graphs display the exact solution, the approximate solution and the error analysis under the a priori regularization parameter choice rule is shown above. It can be seen from Figures  to  that our regularization method is stable and efficient under prior rules in the interval 0<x<1. Figures  and  show our regularization method is stable and efficient at the x=1 boundary.

Figure 7. x = 0, δ=1×103, (a) Exact solution, (b) Regularized solution.

Figure 7. x = 0, δ=1×10−3, (a) Exact solution, (b) Regularized solution.

Figure 8. x = 0.2, δ=1×103, (a) Regularized solution, (b) Error.

Figure 8. x = 0.2, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 9. x = 0.5, δ=1×103, (a) Regularized solution, (b) Error.

Figure 9. x = 0.5, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 10. x = 0.8, δ=1×103, (a) Regularized solution, (b) Error.

Figure 10. x = 0.8, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 11. x = 1, p = 0.5, δ=1×103, (a) Exact solution, (b) Regularized solution.

Figure 11. x = 1, p = 0.5, δ=1×10−3, (a) Exact solution, (b) Regularized solution.

Figure 12. x = 1, p = 3, δ=1×104, (a) Regularized solution, (b) Error.

Figure 12. x = 1, p = 3, δ=1×10−4, (a) Regularized solution, (b) Error.

Figure 13. x = 0, δ=1×103, (a) Exact solution, (b) Regularized solution.

Figure 13. x = 0, δ=1×10−3, (a) Exact solution, (b) Regularized solution.

Figures  analysis result under the posterior regularization rule is shown above. It can be seen from these graphs that our method is stable and efficient under the posterior rule in the interval or at the boundary.

Figure 14. x = 0.2, δ=1×103, (a) Regularized solution, (b) Error.

Figure 14. x = 0.2, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 15. x = 0.5, δ=1×103, (a) Regularized solution, (b) Error.

Figure 15. x = 0.5, δ=1×10−3, (a) Regularized solution, (b) Error.

Figure 16. x = 1, p = 0.5, δ=1×104, (a) Exact solution, (b) Regularized solution.

Figure 16. x = 1, p = 0.5, δ=1×10−4, (a) Exact solution, (b) Regularized solution.

6. Conclusion

In this article, we deal with the inverse problem of the multi-dimensional Helmholtz equation by mollification regularization method based on a multi-dimensional exponential decay kernel. The corresponding regular solutions are constructed under the prior rule and posterior rule respectively, and the convergence between the regular and exact solution is proved respectively. Finally, numerical examples are given to demonstrate the effectiveness and stability of the proposed method by combining tables and graphs. From the comparison between the relative errors in Table , it can be seen that the regular solution constructed by the method in this paper is closer to the exact solution than that constructed by the method in literature [Citation21]. As can be seen from the data in Tables  and , our method is applicable not only to small wave numbers but also to large wave numbers. Among them, Table  shows that under different values of p, our method is stable and effective no matter under priori rule or posterior rule.

Acknowledgments

We would like to express our sincere gratitude to the referees and editor for their diligent review of our paper and for providing valuable recommendations. Their insightful feedback has greatly improved the quality of our research!

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

The financial support provided by the National Natural Science Foundation of China (No. 11961054) and the Natural Science Foundation of Ningxia (No. NZ16011).

References

  • Klibanov MV. Two classes of inverse problems for partial differential equation. Ann New York Acad Sci. 1992;661(1):93–111. doi: 10.1111/j.1749-6632.1992.tb26036.x
  • Tadi M, Nandakumaran AK, Sritharan SS. An inverse problem for Helmholtz equation. Inverse Probl Sci Eng. 2011;19(6):839–854. doi: 10.1080/17415977.2011.556705
  • Jin B, Zheng Y. A meshless method for some inverse problems associated with the Helmholtz equation. Comput Methods Appl Mech Engrg. 2006;195(19-22):2270–2288. doi: 10.1016/j.cma.2005.05.013
  • Jin B, Rundell W. A tutorial on inverse problems for anomalous diffusion processes. Inverse Probl. 2015;31(3):035003. doi: 10.1088/0266-5611/31/3/035003
  • Bao G, Li P, Zhao Y. Stability in the inverse source problem for elastic and electromagnetic waves with multi-frequencies, 2017. Preprint, arXiv: 1703.03890.
  • EI Badia A, EI Hajj A. Stability estimates for an inverse source problem of Helmholtz equation from single Cauchy data at a fixed frequency. Inverse Probl. 2013;29(12):125008. doi: 10.1088/0266-5611/29/12/125008
  • Bao G, Lin J, Triki F. Numerical solution of the inverse source problem for the Helmholtz equation with multiple frequency data. Contemp Math. 2011;548:45–60. doi: 10.1090/conm/548
  • Zhang D, Guo Y. Fourier method for solving the multi-frequency inverse source problem for the Helmholtz equation. Inverse Probl. 2015;31(3):035007. doi: 10.1088/0266-5611/31/3/035007
  • Wang X, Guo Y, Zhang D, et al. Fourier method for recovering acoustic sources from multi-frequency far-field data. Inverse Probl. 2017;33(3):035001. doi: 10.1088/1361-6420/aa573c
  • Wang G, Ma F, Guo Y, et al. Solving the multi-frequency electromagnetic inverse source problem by the Fourier method, 2017. Preprint, arXiv: 1708.00673.
  • Colton D, Kress R. Inverse acoustic and electromagnetic scattering theory[M]. Berlin: Springer; 1998.
  • Guo Y, Monk P, Colton D. Toward a time domain approach to the linear sampling method. Inverse Probl. 2013;29(9):095016. doi: 10.1088/0266-5611/29/9/095016
  • Marin L, Elliot L, Heggs PJ, et al. BEM solution for the Cauchy problem associated with Helmholtz-type equations by the Landweber method. Eng Anal Bound Elem. 2004;28:1025–1034. doi: 10.1016/j.enganabound.2004.03.001
  • Kirsch A. An introduction to the mathematical theory of inverse problems. 2nd ed. New York: Springer; 2011. (Mathematical sciences).
  • 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(1):161–183. doi: 10.1007/BF01796543
  • Murio DA. The mollification method and the numerical solution of ill-Posed problems. John Wiley and Sons Inc; 2011.
  • Ha`o DN. A mollification method for ill-posed problems. Numer Math. 1994;68:469–506. doi: 10.1007/s002110050073
  • 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(1):161–183. doi: 10.1007/BF01796543
  • Murio DA. Numerical method for inverse transient heat conduction problems. Rev Unión Mat Argent. 1981;30:25–46.
  • Murio DA. On the estimation of the boundary temperature on a sphere from measurements at its center. J Comput Appl Math. 1982;8:111–119. doi: 10.1016/0771-050X(82)90064-X
  • He SQ, Feng XF. A regularization method to solve a Cauchy problem for the two-dimensional modified Helmholtz equation. Mathematics. 2019;7:360. doi: 10.3390/math7040360
  • Kirsch A. An introduction to the mathematical theory of inverse problems. 2nd ed. Springer; 2011. (Applied mathematical sciences).