Next Article in Journal
The Dynamic String-Averaging Method for Inverse Strongly-Monotone Operators with Summable Errors
Previous Article in Journal
A Proportional-Arithmetic Framework for Fourier Analysis on the Positive Real Line
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Truncated-Kernel Mollification Method for the Cauchy Problem of the Modified Helmholtz Equation

College of Mathematics and Computer Science, Gannan Normal University, Ganzhou 341000, China
*
Author to whom correspondence should be addressed.
Axioms 2026, 15(8), 593; https://doi.org/10.3390/axioms15080593
Submission received: 30 June 2026 / Revised: 31 July 2026 / Accepted: 31 July 2026 / Published: 5 August 2026
(This article belongs to the Special Issue Theory and Applications: Numerical Analysis)

Abstract

This paper addresses the Cauchy problem for the multi-dimensional modified Helmholtz equation, a classical and severely ill-posed problem. A truncated-kernel mollification method is proposed as an effective regularization approach. Both the a priori and a posteriori regularization parameter choice strategies are examined, and the associated error estimates and convergence rates of the regularized solutions are established. The practical viability and effectiveness of the method are further validated through numerical experiments.

1. Introduction

The modified Helmholtz equation models steady-state heat conduction with thermal loss, bioheat transfer in living tissues, and diffusion processes involving absorption or reaction. It further arises in the linearization of the Poisson–Boltzmann equation for electrolyte solutions and in implicit time discretizations of the heat equation. The Cauchy problem for the modified Helmholtz equation, with solutions that exhibit exponential decay, naturally appears in inverse scattering theory and impedance tomography [1,2]. This problem is inherently ill-posed in the Hadamard sense; even small perturbations in the input data can lead to significant instabilities in the corresponding numerical solutions [3]. To mitigate this ill-posedness, significant research efforts in recent years have focused on developing and applying stable numerical methods for solving such Cauchy problems. Notable approaches include the quasi-reversibility method [4], the truncation method [4,5], the quasi-boundary value method [5,6], the Tikhonov-type regularization method [7,8], the adaptive Runge–Kutta method [9], the iterative regularization method [10,11], and the mollification method [12,13,14], among others.
Among these methods, the mollification method aims to construct stable solutions by smoothing perturbed input data through convolution with suitable kernel functions. This technique has been widely applied to solving Cauchy problems associated with elliptic and parabolic equations [15], inverse source problems [16,17,18], inverse Schrödinger problems [19,20], inverse Laplace transform problems [21], as well as backward heat problems [22,23]. The choice of kernel functions is of central importance in the mollification method. Widely used kernels include the Dirichlet, Poussin, Gaussian, and Weierstrass kernels, along with many others [15].
This paper aims to apply the mollification method to solve the Cauchy problem associated with a multi-dimensional modified Helmholtz equation:
Δ w ( x , y ) k 2 w ( x , y ) = 0 , 0 < x 1 , y R n , w ( 0 + , y ) = f ( y ) , y R n , w x ( 0 + , y ) = g ( y ) , y R n ,
where Δ = 2 x 2 + i = 1 n 2 y i 2 is an ( n + 1 ) -dimensional Laplace operator and k > 0 denotes the wave number. The Cauchy problem consists in determining the solution w ( x , y ) from the given data f ( y ) and g ( y ) . In the one-dimensional case, [12] applies the mollification method with the Dirichlet kernel and establishes an a priori regularization parameter choice strategy, while [13] proposes an a priori strategy using the Poussin kernel for problem (1). Neither [12] nor [13] provides an a posteriori strategy for choosing regularization parameters. The a priori regularization parameter choice depends on smoothness assumptions concerning the exact solution, whereas the a posteriori approach dispenses with them entirely. In the multi-dimensional case, [14] establishes a unified framework for the mollification method, presents both the a priori and a posteriori regularization parameter choice strategies, and demonstrates that the Dirichlet, Poussin, and Gaussian kernels satisfy the conditions required by this framework. However, the corresponding regularized solution achieves only logarithmic-order convergence. Both the Dirichlet and Poussin kernels belong to the class of truncated-kernel functions [20]. A general form of truncated-kernel functions is presented in this paper. Building upon the classical Dirichlet and Poussin kernels, two new types are devised: the logarithmic-type kernel and the hyperbolic tangent-type kernel. These kernels are then employed to construct a mollification regularization method for the Cauchy problem of the modified Helmholtz equation. Both a priori and a posteriori parameter choice strategies are proposed, and the corresponding convergence rates are rigorously proven. The resulting power-law rate is shown to be significantly superior to the logarithmic convergence rate attainable in [14]. Numerical experiments show that the proposed method reconstructs both continuous and discontinuous solutions with high accuracy.
The paper is organized as follows. In Section 2, we analyze the ill-posedness of the Cauchy problem and introduce the definition of the truncated-kernel function. In Section 3, we propose a priori regularization parameter choice strategies and derive the corresponding error estimates for the regularized solution. In Section 4, we develop a posteriori strategies and establish the associated convergence rates. In Section 5, we demonstrate the numerical effectiveness of the proposed method through several numerical examples. Finally, We summarize the main contributions and conclusions of this study.

2. The Truncated-Kernel Mollification Method

To facilitate the analysis, we decompose problem (1) into two sub-problems:
Δ u ( x , y ) k 2 u ( x , y ) = 0 , 0 < x 1 , y R n , u ( 0 + , y ) = f ( y ) , y R n , u x ( 0 + , y ) = 0 , y R n
and
Δ v ( x , y ) k 2 v ( x , y ) = 0 , 0 < x 1 , y R n , v ( 0 + , y ) = 0 , y R n , v x ( 0 + , y ) = g ( y ) , y R n .
The solution of (1) is w ( x , y ) = u ( x , y ) + v ( x , y ) . Applying the Fourier transform yields the following results [14]:
u ^ ( x , ξ ) = cosh ( x ξ 2 + k 2 ) f ^ ( ξ ) , v ^ ( x , ξ ) = sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 g ^ ( ξ ) ,
where the n-dimensional Fourier transform of f ( y ) is defined as
f ^ ( ξ ) : = 1 ( 2 π ) n 2 R n e i ξ y f ( y ) d y , ξ R n .
Consider the perturbed data f δ ( y ) and g δ ( y ) satisfying
f δ f δ , g δ g δ ,
where · denotes the L 2 -norm and δ > 0 represents the noise level. The unboundedness of the operator kernel functions cosh ( x ξ 2 + k 2 ) and sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 as ξ causes instability in solutions (4); see [3]. To stabilize the inherently unstable solutions, we apply the mollification method with kernel function P ^ μ ( ξ ) , where ξ R n . The corresponding regularized solutions are given by
u ^ μ , δ ( x , ξ ) = cosh ( x ξ 2 + k 2 ) P ^ μ ( ξ ) f ^ δ ( ξ )
and
v ^ μ , δ ( x , ξ ) = sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 P ^ μ ( ξ ) g ^ δ ( ξ ) ,
respectively. Consequently, the regularized solution to problem (1) is given by
w μ , δ ( x , y ) = 1 ( 2 π ) n 2 R n e i ξ y w ^ μ , δ ( x , ξ ) d ξ ,
where
w ^ μ , δ ( x , ξ ) = u ^ μ , δ ( x , ξ ) + v ^ μ , δ ( x , ξ ) .
In this paper, we focuse on truncated-kernel functions satisfying the following definition.
Definition 1. 
A kernel function P ^ μ ( ξ ) , where ξ R n and 0 < μ < 1 , that satisfies the following three conditions is defined as a truncated-kernel function:
( 1 ) 0 P ^ μ ( ξ ) 1 , ξ R n ;
( 2 ) sup ξ R n P ^ μ ( ξ ) e x | ξ | e c x μ , c > 0 , 0 x 1 ;
( 3 ) sup ξ R n ( 1 P ^ μ ( ξ ) ) e ( x 1 ) | ξ | e x 1 μ , 0 x 1 .
Well-known examples of truncated-kernel functions include the Dirichlet kernel
P ^ μ ( ξ ) = χ 1 μ , 1 μ ( ξ ) = 1 , | ξ | 1 μ , 0 , | ξ | > 1 μ
and the Poussin kernel
P ^ μ ( ξ ) = 1 , | ξ | 1 μ , 2 μ | ξ | , 1 μ < | ξ | < 2 μ , 0 , | ξ | 2 μ .
It can be demonstrated that, for the Dirichlet kernel, the constant c in Definition 1 equals 1, while for the Poussin kernel, it equals 2. A more general form of the truncated-kernel function can be expressed as follows.
Lemma 1. 
Let k be a real-valued function that is continuous and decreasing on ( 1 , 2 ) and satisfies 0 k ( x ) 1 for all x ( 1 , 2 ) . Then the function
P ^ μ ( ξ ) = 1 , | ξ | 1 μ , k ( μ | ξ | ) , 1 μ < | ξ | < 2 μ , 0 , | ξ | 2 μ
is a truncated-kernel function.
Proof. 
The inequality 0 P ^ μ ( ξ ) 1 holds for all ξ R n , so it remains only to verify conditions (2) and (3) of Definition 1. For 0 x 1 , we have
sup ξ R n P ^ μ ( ξ ) e x | ξ | = sup | ξ | < 2 μ P ^ μ ( ξ ) e x | ξ | sup | ξ | < 2 μ e x | ξ | = e 2 x μ
which confirms condition (2) for c = 2 . Similarly, for 0 x 1 ,
sup ξ R n ( 1 P ^ μ ( ξ ) ) e ( x 1 ) | ξ | = sup ξ > 1 μ ( 1 P ^ μ ( ξ ) ) e ( x 1 ) | ξ | sup ξ > 1 μ e ( x 1 ) | ξ | e x 1 μ
which confirms condition (3). □
Throughout the rest of this paper, we assume that P ^ μ ( ξ ) is a truncated-kernel function given by (11), and that k ( x ) satisfies the condition in Lemma 1. Beyond the specific cases of k ( x ) = 0 for the Dirichlet kernel and k ( x ) = 2 x for the Poussin kernel, various truncated-kernel functions can be constructed by appropriately specifying k ( x ) , 1 < x < 2 . In this paper, we construct two novel truncated-kernel functions. The first is the logarithmic-type kernel; for m > 0 , the corresponding k ( x ) is
k 1 ( x ) = 1 1 m ln ( e m 1 ) ( x 1 ) + 1 , 1 < x < 2 .
Direct substitution yields k 1 ( 1 ) = 1 and k 1 ( 2 ) = 0 . Differentiating yields
k 1 ( x ) = 1 m e m 1 ( e m 1 ) ( x 1 ) + 1 , 1 < x < 2 .
Since k 1 ( x ) < 0 for all x ( 1 , 2 ) , the function k 1 ( x ) is strictly decreasing on ( 1 , 2 ) . It follows that k 1 ( x ) satisfies all the conditions of Lemma 1. Moreover, as k 1 ( x ) is monotonically increasing, the magnitude | k 1 ( x ) | is monotonically decreasing, indicating that the rate of decrease of k 1 ( x ) diminishes progressively over ( 1 , 2 ) . Furthermore, the supremum magnitude of the derivative is
sup 1 < x < 2 | k 1 ( x ) | = | k 1 ( 1 ) | = e m 1 m ,
and since m > 0 , this supremum magnitude increases strictly with m; consequently, larger m yields a steeper maximal downward slope for k 1 ( x ) on ( 1 , 2 ) .
The second is the hyperbolic tangent-type kernel: for m > 0 ,
k 2 ( x ) = 1 2 1 tanh ( 2 m   x 3 m ) tanh m , 1 < x < 2 .
Similarly, k 2 ( 1 ) = 1 , k 2 ( 2 ) = 0 . Differentiating yields
k 2 ( x ) = m tanh m sech 2 ( 2 m x 3 m ) , 1 < x < 2
and
sup 1 < x < 2 | k 2 ( x ) | = | k 2 ( 3 2 ) | = m tanh m .
Since k 2 ( x ) < 0 for all x ( 1 , 2 ) , the function k 2 ( x ) is strictly decreasing on ( 1 , 2 ) . Thus, k 2 ( x ) also satisfies all the conditions of Lemma 1. Moreover, as k 2 ( x ) is monotonically decreasing on the interval ( 1 , 3 2 ] , thus the rate of decrease accelerates monotonically. On the interval ( 3 2 , 2 ) , k 2 ( x ) is monotonically increasing, so the rate of decrease diminishes monotonically. Consequently, x = 3 2 is the maximum point of the rate of decrease of k 2 ( x ) over ( 1 , 2 ) . Moreover, the supremum magnitude increases strictly with m; consequently, larger m yields a steeper maximal downward slope for k 2 ( x ) on ( 1 , 2 ) .
The graphs of the logarithmic-type and hyperbolic tangent-type kernels for different values of m are presented in Figure 1 with n = 1 and μ = 0.1 .
We now present several fundamental properties satisfied by the operator kernel functions given in (4).
Lemma 2. 
When 0 < x 1 , the following inequalities hold.
( 1 ) cosh ( x ξ 2 + k 2 ) e x ξ 2 + k 2 ;
( 2 ) cosh ( x ξ 2 + k 2 ) 1 2 e x ξ 2 + k 2 ;
( 3 ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 e x ξ 2 + k 2 ;
( 4 ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 cosh ( x ξ 2 + k 2 ) ;
( 5 ) cosh ( x ξ 2 + k 2 ) cosh ( ξ 2 + k 2 ) 2 e ( x 1 ) ξ 2 + k 2 ;
( 6 ) sinh ( x ξ 2 + k 2 ) sinh ( ξ 2 + k 2 ) e ( x 1 ) ξ 2 + k 2 .
Conclusions (1) and (2) are trivial and are therefore omitted for brevity. For the remaining conclusions, the reader is referred to [3].
At the end of this section, we introduce additional stability conditions via the following assumptions on the exact data f ( y ) and g ( y ) :
f ( · ) M p ( R n ) E p , g ( · ) M p ( R n ) E p .
Here, E p > 0 is a fixed constant, and the norm on the space M p ( R n ) is defined by
f ( · ) M p ( R n ) : = R n e p | ξ | | f ^ ( ξ ) | 2 d ξ 1 / 2 .
Remark 1. 
When p = 0 , we have f ( · ) M 0 ( R n ) = f ( · ) L 2 ( R n ) ; when p > 0 , we have f ( · ) M p ( R n ) = e p 2 | ξ | f ^ ( ξ ) L 2 ( R n ) .

3. The a Priori Parameter Choice Strategies

In this section, we first consider the case 0 < x < 1 .
Theorem 1. 
Assume that P ^ μ ( ξ ) is a truncated-kernel function and w μ , δ ( x , y ) denotes the regularized solution defined by (8) for 0 < x < 1 . If condition (5) is satisfied and condition (12) holds for p = 2 , then the following error estimate holds:
w μ , δ ( x , · ) w ( x , · ) 2 e x μ e x k δ + 2 e x 1 μ e x k E 2 .
When μ = 1 + ( c 1 ) x ln ( E 2 / δ ) , we have
w μ , δ ( x , · ) w ( x , · ) 4 e x k E 2 c x 1 + ( c 1 ) x δ 1 x 1 + ( c 1 ) x .
Proof. 
Applying Parseval’s identity and the triangle inequality, we obtain
u μ , δ ( x , · ) u ( x , · ) = u ^ μ , δ ( x , · ) u ^ ( x , · ) u ^ μ , δ ( x , · ) u ^ μ , 0 ( x , · ) + u ^ μ , 0 ( x , · ) u ^ ( x , · ) ,
where
u ^ μ , δ ( x , · ) u ^ μ , 0 ( x , · ) = P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) ( f ^ δ ( ξ ) f ^ ( ξ ) ) sup ξ R n | P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) | δ sup ξ R n | P ^ μ ( ξ ) e x ( | ξ | + k ) | δ = sup ξ R n | P ^ μ ( ξ ) e x | ξ | | e x k δ e c x μ e x k δ
and
u ^ μ , 0 ( x , · ) u ^ ( x , · ) = 1 P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) f ^ ( ξ ) = 1 P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) e | ξ | e | ξ | f ^ ( ξ ) sup ξ R n | 1 P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) e | ξ | | E 2 sup ξ R n | 1 P ^ μ ( ξ ) e ( x 1 ) | ξ | | e x k E 2 sup ξ R n | 1 P ^ μ ( ξ ) e ( x 1 ) | ξ | | e x k E 2 e x 1 μ e x k E 2 .
Therefore, we have
u μ , δ ( x , · ) u ( x , · ) e c x μ e x k δ + e x 1 μ e x k E 2 .
Analogous to the error estimate of u μ , δ ( x , · ) , we can estimate that of v μ , δ ( x , · ) .
v μ , δ ( x , · ) v ( x , · ) = v ^ μ , δ ( x , · ) v ^ ( x , · ) v ^ μ , δ ( x , · ) v ^ μ , 0 ( x , · ) + v ^ μ , 0 ( x , · ) v ^ ( x , · ) ,
where
v ^ μ , δ ( x , · ) v ^ μ , 0 ( x , · ) = P ^ μ ( ξ ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 ( g ^ δ ( ξ ) g ^ ( ξ ) ) P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) ( g ^ δ ( ξ ) g ^ ( ξ ) ) sup ξ R n | P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) | δ e c x μ e x k δ
and
v ^ μ , 0 ( x , · ) v ^ ( x , · ) = 1 P ^ μ ( ξ ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 g ^ ( ξ ) = 1 P ^ μ ( ξ ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 e | ξ | e | ξ | g ^ ( ξ ) sup ξ R n | 1 P ^ μ ( ξ ) cosh ( x ξ 2 + k 2 ) e | ξ | | E 2 sup ξ R n | 1 P ^ μ ( ξ ) e ( x 1 ) | ξ | | e x k E 2 e x 1 μ e x k E 2 .
Consequently, we obtain
v μ , δ ( x , · ) v ( x , · ) e c x μ e x k δ + e x 1 μ e x k E 2 ,
and subsequently,
w μ , δ ( x , · ) w ( x , · ) 2 e c x μ e x k δ + 2 e x 1 μ e x k E 2 .
When μ = 1 + ( c 1 ) x ln ( E 2 / δ ) , the estimate (13) holds. □
Next, we consider the case x = 1 . In contrast to the case 0 < x < 1 , stronger additional assumptions on the exact data f ( y ) and g ( y ) are required.
Theorem 2. 
Assume that P ^ μ ( ξ ) is a truncated-kernel function and w μ , δ ( x , y ) denotes the regularized solution defined by (8) at x = 1 . If condition (5) is satisfied and condition (12) holds for p > 2 , then the following error estimate holds:
w μ , δ ( 1 , · ) w ( 1 , · ) 2 e c μ e k δ + 2 e 2 p 2 μ e k E p .
When μ = 2 c + p 2 2 ln ( E p / δ ) , we obtain
w μ , δ ( 1 , · ) w ( 1 , · ) 4 e k E p 2 c 2 c + p 2 δ p 2 2 c + p 2 .
Proof. 
Applying Parseval’s identity and the triangle inequality, we obtain
u μ , δ ( 1 , · ) u ( 1 , · ) = u ^ μ , δ ( 1 , · ) u ^ ( 1 , · ) u ^ μ , δ ( 1 , · ) u ^ μ , 0 ( 1 , · ) + u ^ μ , 0 ( 1 , · ) u ^ ( 1 , · ) ,
where
u ^ μ , δ ( 1 , · ) u ^ μ , 0 ( 1 , · ) = P ^ μ ( ξ ) cosh ( ξ 2 + k 2 ) ( f ^ δ ( ξ ) f ^ ( ξ ) ) sup ξ R n | P ^ μ ( ξ ) cosh ( ξ 2 + k 2 ) | δ e c μ e k δ
and
u μ , 0 ( 1 , · ) u ( 1 , · ) = u ^ μ , 0 ( 1 , · ) u ^ ( 1 , · ) = 1 P ^ μ ( ξ ) cosh ( ξ 2 + k 2 ) f ^ ( ξ ) 1 P ^ μ ( ξ ) cosh ( ξ 2 + k 2 ) e p 2 | ξ | e p 2 | ξ | f ^ ( ξ ) sup ξ R n | 1 P ^ μ ( ξ ) e 2 p 2 | ξ | | e k E p e 2 p 2 μ e k E p .
Hence, we have
u μ , δ ( 1 , · ) u ( 1 , · ) e c μ e k δ + e 2 p 2 μ e k E p .
Analogous to the error estimate of u μ , δ ( x , · ) , we can derive that of v μ , δ ( x , · ) .
v μ , δ ( 1 , · ) v ( 1 , · ) = v ^ μ , δ ( 1 , · ) v ^ ( 1 , · ) v ^ μ , δ ( 1 , · ) v ^ μ , 0 ( 1 , · ) + v ^ μ , 0 ( 1 , · ) v ^ ( 1 , · ) = P ^ μ ( ξ ) sinh ( ξ 2 + k 2 ) ξ 2 + k 2 ( g ^ δ ( ξ ) g ^ ( ξ ) ) + ( 1 P ^ μ ( ξ ) ) sinh ( ξ 2 + k 2 ) ξ 2 + k 2 g ^ ( ξ ) sup ξ R n | P ^ μ ( ξ ) cosh ( ξ 2 + k 2 ) | δ + ( 1 P ^ μ ( ξ ) ) cosh ( ξ 2 + k 2 ) e p 2 | ξ | e p 2 | ξ | g ^ ( ξ ) e c μ e k δ + sup ξ R n | 1 P ^ μ ( ξ ) e 2 p 2 | ξ | | e k E p e c μ e k δ + e 2 p 2 μ e k E p .
Hence, we have
w μ , δ ( 1 , · ) w ( 1 , · ) 2 e c μ e k δ + 2 e 2 p 2 μ e k E p .
When μ = 2 c + p 2 2 ln ( E p / δ ) , the estimate (14) holds. □

4. The a Posteriori Parameter Choice Strategies

The a priori choice strategies for the regularization parameter μ = μ ( δ ) presented in Theorems 1 and 2 rely on additional assumptions about the exact data f ( y ) and g ( y ) . However, such assumptions are often difficult to verify in practical applications. Therefore, in this section, we consider a posteriori choice strategies for the regularization parameter that do not depend on these prior assumptions. The Morozov discrepancy principle is a widely used a posteriori parameter choice strategy [24]. In the following, we propose a modified version of this principle. The parameter μ = μ ( δ ) in the regularized solution u μ , δ ( x , y ) satisfies
d 1 ( μ ) : = P ^ μ ( ξ ) f ^ δ ( ξ ) f ^ δ ( ξ ) = ( 1 P ^ μ ( ξ ) ) f ^ δ ( ξ ) = δ + τ δ 1 c ,
and the parameter μ = μ ( δ ) in the regularized solution v μ , δ ( x , y ) satisfies
d 2 ( μ ) : = P ^ μ ( ξ ) g ^ δ ( ξ ) g ^ δ ( ξ ) = ( 1 P ^ μ ( ξ ) ) g ^ δ ( ξ ) = δ + τ δ 1 c ,
where τ > 0 is a given constant such that
δ + τ δ 1 c < min { f δ ( · ) , g δ ( · ) } .
Lemma 3. 
Assume that P ^ μ ( ξ ) is a truncated-kernel function, then d 1 ( μ ) and d 2 ( μ ) satisfy the following properties:
( 1 ) d 1 ( μ ) and d 2 ( μ ) are continuous and increasing functions;
( 2 ) lim μ 0 + d 1 ( μ ) = lim μ 0 + d 2 ( μ ) = 0 ;
( 3 ) lim μ + d 1 ( μ ) = f δ ( · ) and lim μ + d 2 ( μ ) = g δ ( · ) .
Proof. 
(1) Given that P ^ μ ( ξ ) is a truncated-kernel function given by (11), it follows that d 1 ( μ ) = ( 1 P ^ μ ( ξ ) ) f ^ δ ( ξ ) is continuous and increasing in μ .
(2) Since lim μ 0 + P ^ μ ( ξ ) = 1 for any ξ R n , it follows immediately that lim μ 0 + ( 1 P ^ μ ( ξ ) ) = 0 , and therefore lim μ 0 + d 1 ( μ ) = 0 .
(3) Since lim μ + P ^ μ ( ξ ) = 0 for any ξ R n , therefore lim μ + d 1 ( μ ) = f δ ( · ) .
The same conclusion applies to d 2 ( μ ) . □
Lemma 3 together with condition (17) ensures the solvability of Equations (15) and (16).
Analogously to the previous section, we first consider the case 0 < x < 1 . To derive the error estimate for the regularized solution, we begin by presenting the following lemmas.
Lemma 4. 
Assume that μ 1 = μ 1 ( δ ) and μ 2 = μ 2 ( δ ) are solutions to Equations (15) and (16), respectively. Then, we have
P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) 2 δ + τ δ 1 c , P ^ μ 2 ( ξ ) g ^ δ ( ξ ) g ^ ( ξ ) 2 δ + τ δ 1 c .
Proof. 
Applying the triangle inequality, we obtain
P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) = P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ δ ( ξ ) + f ^ δ ( ξ ) f ^ ( ξ ) P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ δ ( ξ ) + δ 2 δ + τ δ 1 c .
Similarly, we have
P ^ μ 2 ( ξ ) g ^ δ ( ξ ) g ^ ( ξ ) 2 δ + τ δ 1 c .
Lemma 5. 
Assume that conditions (5) and (12) are satisfied. Then the following estimate holds:
e p 2 μ 1 δ 1 c E p τ , e p 2 μ 2 δ 1 c E p τ .
Proof. 
Applying the triangle inequality, we obtain
δ + τ δ 1 c = ( 1 P ^ μ 1 ( ξ ) ) f ^ δ ( ξ ) ( 1 P ^ μ 1 ( ξ ) ) ( f ^ δ ( ξ ) f ^ ( ξ ) ) + ( 1 P ^ μ 1 ( ξ ) ) f ^ ( ξ ) δ + ( 1 P ^ μ 1 ( ξ ) ) e p 2 | ξ | e p 2 | ξ | f ^ ( ξ ) δ + sup ξ R n | ( 1 P ^ μ 1 ( ξ ) ) e p 2 | ξ | | E p δ + e p 2 μ 1 E p ,
from which it follows that
e p 2 μ 1 δ 1 c E p τ .
Similarly, we have
δ + τ δ 1 c = ( 1 P ^ μ 2 ( ξ ) ) g ^ δ ( ξ ) ( 1 P ^ μ 2 ( ξ ) ) ( g ^ δ ( ξ ) g ^ ( ξ ) ) + ( 1 P ^ μ 2 ( ξ ) ) g ^ ( ξ ) δ + ( 1 P ^ μ 2 ( ξ ) ) e p 2 | ξ | e p 2 | ξ | g ^ ( ξ ) δ + sup ξ R n | ( 1 P ^ μ 2 ( ξ ) ) e p 2 | ξ | | E p δ + e p 2 μ 2 E p ,
and hence
e p 2 μ 2 δ 1 c E p τ .
Theorem 3. 
Assume that P ^ μ ( ξ ) is a truncated-kernel function and w μ , δ ( x , y ) = u μ 1 , δ ( x , y ) + v μ 2 , δ ( x , y ) denotes the regularized solution for 0 < x < 1 , where μ 1 and μ 2 are the solutions to Equations (15) and (16), respectively. If condition (5) is satisfied and condition (12) holds for p = 2 , then the following error estimate holds:
w μ , δ ( x , · ) w ( x , · ) 2 δ 1 x c ( τ + o ( 1 ) ) 1 x e k x ( ( E 2 τ ) c + E 2 ) x .
Proof. 
Applying Parseval’s identity, the Hölder inequality, Lemma 4, and Lemma 5, we obtain
u μ 1 , δ ( x , · ) u ( x , · ) = u ^ μ 1 , δ ( x , · ) u ^ ( x , · ) = ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) cosh ( x ξ 2 + k 2 ) ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) 1 x · ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) ( cosh ( x ξ 2 + k 2 ) ) 1 x x ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) 1 x ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) e ξ 2 + k 2 x ( 2 δ + τ δ 1 c ) 1 x ( P ^ μ 1 ( ξ ) ( f ^ δ ( ξ ) f ^ ( ξ ) ) e ξ 2 + k 2 + ( 1 P ^ μ 1 ( ξ ) ) f ^ ( ξ ) e ξ 2 + k 2 ) x ( 2 δ + τ δ 1 c ) 1 x ( sup ξ R n | P ^ μ 1 ( ξ ) e ξ 2 + k 2 | δ + ( 1 P ^ μ 1 ( ξ ) ) e ξ 2 + k 2 e | ξ | e | ξ | f ^ ( ξ ) ) x ( 2 δ + τ δ 1 c ) 1 x ( e c μ 1 e k δ + e k E 2 ) x ( 2 δ + τ δ 1 c ) 1 x e k x ( e c μ 1 δ + E 2 ) x ( 2 δ + τ δ 1 c ) 1 x e k x ( ( E 2 τ ) c + E 2 ) x = δ 1 x c ( τ + o ( 1 ) ) 1 x e k x ( ( E 2 τ ) c + E 2 ) x .
Similarly, we obtain
v μ 2 , δ ( x , · ) v ( x , · ) = v ^ μ 2 , δ ( x , · ) v ^ ( x , · ) = ( P ^ μ 2 ( ξ ) g ^ δ ( ξ ) g ^ ( ξ ) ) sinh ( x ξ 2 + k 2 ) ξ 2 + k 2 ( P ^ μ 2 ( ξ ) g ^ δ ( ξ ) g ^ ( ξ ) ) cosh ( x ξ 2 + k 2 ) δ 1 x c ( τ + o ( 1 ) ) 1 x e k x ( ( E 2 τ ) c + E 2 ) x .
Hence, the regularized solution w μ , δ ( x , y ) = u μ 1 , δ ( x , y ) + v μ 2 , δ ( x , y ) satisfies
w μ , δ ( x , · ) w ( x , · ) 2 δ 1 x c ( τ + o ( 1 ) ) 1 x e k x ( ( E 2 τ ) c + E 2 ) x .
Remark 2. 
From Theorems 1 and 3, we know that the convergence rate of the regularized solution with an a priori parameter choice is O ( δ 1 x 1 + ( c 1 ) x ) , while that with an a posteriori parameter choice is O ( δ 1 x c ) . The constant c, as defined in Definition 1, is equal to 1 for the Dirichlet kernel and 2 for other truncated-kernels. Therefore, the a priori convergence rate is identical to the a posteriori one for the Dirichlet kernel, whereas for other truncated-kernels, the a priori rate is superior to the a posteriori one.
Next, we consider the case x = 1 , where stronger additional assumptions on the exact data f ( y ) and g ( y ) are required.
Theorem 4. 
Assume that P ^ μ ( ξ ) is a truncated-kernel function and w μ , δ ( 1 , y ) = u μ 1 , δ ( 1 , y ) + v μ 2 , δ ( 1 , y ) denotes the regularized solution at x = 1 , where μ 1 and μ 2 are the solutions to Equations (15) and (16), respectively. If condition (5) is satisfied and condition (12) holds for p > 2 , then the following error estimate holds:
w μ , δ ( 1 , · ) w ( 1 , · ) 2 δ p 2 p c ( τ + o ( 1 ) ) p 2 p e k ( ( E p τ ) c + E p ) 2 p .
Proof. 
Applying Parseval’s identity, the Hölder inequality, Lemma 4, and Lemma 5, we have
u μ 1 , δ ( 1 , · ) u ( 1 , · ) = u ^ μ 1 , δ ( 1 , · ) u ^ ( 1 , · ) = ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) cosh ( ξ 2 + k 2 ) ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) p 2 p · ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) ( cosh ( ξ 2 + k 2 ) ) p 2 2 p ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) p 2 p · ( P ^ μ 1 ( ξ ) f ^ δ ( ξ ) f ^ ( ξ ) ) e p 2 ξ 2 + k 2 2 p ( 2 δ + τ δ 1 c ) p 2 p ( P ^ μ 1 ( ξ ) ( f ^ δ ( ξ ) f ^ ( ξ ) ) e p 2 ξ 2 + k 2 + ( 1 P ^ μ 1 ( ξ ) ) f ^ ( ξ ) e p 2 ξ 2 + k 2 ) 2 p ( 2 δ + τ δ 1 c ) p 2 p ( sup ξ R n | P ^ μ 1 ( ξ ) e p 2 ξ 2 + k 2 | δ + ( 1 P ^ μ 1 ( ξ ) ) e p 2 ξ 2 + k 2 e p 2 | ξ | e p 2 | ξ | f ^ ( ξ ) ) 2 p ( 2 δ + τ δ 1 c ) p 2 p ( e p c 2 μ 1 e p k 2 δ + e p k 2 E p ) 2 p ( 2 δ + τ δ 1 c ) p 2 p e k ( ( E p τ ) c + E p ) 2 p = δ p 2 p c ( τ + o ( 1 ) ) p 2 p e k ( ( E p τ ) c + E p ) 2 p .
Similarly, we obtain
v μ 2 , δ ( 1 , · ) v ( 1 , · ) = v ^ μ 2 , δ ( 1 , · ) v ^ ( 1 , · ) = ( P ^ μ 2 ( ξ ) g ^ δ ( ξ ) g ^ ( ξ ) ) sinh ( ξ 2 + k 2 ) ξ 2 + k 2 ( P ^ μ 2 ( ξ ) g ^ δ ( ξ ) g ^ ( ξ ) ) cosh ( ξ 2 + k 2 ) δ p 2 p c ( τ + o ( 1 ) ) p 2 p e k ( ( E p τ ) c + E p ) 2 p .
Hence, the regularized solution w μ , δ ( x , y ) = u μ 1 , δ ( x , y ) + v μ 2 , δ ( x , y ) satisfies
w μ , δ ( 1 , · ) w ( 1 , · ) 2 δ p 2 p c ( τ + o ( 1 ) ) p 2 p e k ( ( E p τ ) c + E p ) 2 p .
Remark 3. 
From Theorems 2 and 4, the convergence rate of the regularized solution with an a priori parameter choice is O ( δ p 2 2 c + p 2 ) , while that with an a posteriori parameter choice is O ( δ p 2 p c ) . As in the case 0 < x < 1 , the two rates are identical for the Dirichlet kernel, but the a priori rate is superior for other truncated-kernels.

5. Numerical Experiments

In this section, we present several numerical examples to demonstrate the effectiveness of the mollification method with truncated-kernel. The numerical experiments are performed using MATLAB R2016b. Consider the two-dimensional case, and assume that the exact data u ( x , y ) , v ( x , y ) , w ( x , y ) , x [ 0 , 1 ] is identically zero outside the domain y [ 2 π , 2 π ] × [ 2 π , 2 π ] . The domain [ 2 π , 2 π ] × [ 2 π , 2 π ] is partitioned into N 2 equal-area subregions, with a uniform sampling step of 4 π N 1 . The perturbed data f δ are obtained by discretizing the exact data f ( y ) = u ( 0 , y ) on an N × N grid to get f, and then adding noise as
f δ = f + ϵ · rand ( size ( f ) ) ,
where rand(·) returns a matrix containing pseudorandom values drawn from the standard uniform distribution on the open interval ( 0 , 1 ) . The error level of the perturbed data f δ is
δ f = f δ f : = 4 π N i , j = 1 N ( f i j δ f i j ) 2 .
The relative error of the regularized solution u μ , δ is
rel ( u μ , δ ) = u μ , δ ( x , · ) u ( x , · ) u ( x , · ) .
Following the same procedure, we obtain the perturbed data g δ , the error level δ g , and the relative error rel ( v μ , δ ) . Since the a priori choice of the regularization parameter relies on an additional assumption on the exact data that is often difficult to verify in practice, we adopt the a posteriori choice strategy instead.
The numerical implementation proceeds as follows:
(1) A two-dimensional discrete Fourier transform (2D-DFT) is applied to the perturbed data f δ or g δ using MATLAB’s built-in Fast Fourier Transform (FFT). The frequency domain is taken as [ N 1 4 , N 1 4 ] × [ N 1 4 , N 1 4 ] with a sampling step of 1 2 . In all numerical experiments, the grid parameter is set to N = 129 .
(2) In the frequency domain, the transforms u ^ μ 1 , δ or v ^ μ 2 , δ of the regularized solutions are computed via (6) or (7). The regularization parameters μ 1 and μ 2 are selected independently via the a posteriori strategy, with each determined by solving the corresponding nonlinear equation, (15) for μ 1 and (16) for μ 2 , using the bisection method on ( 0 , 2 ) . The solver employs a maximum of 100 iterations and a convergence tolerance of 10 6 , and the parameter τ in both equations is fixed at 0.1 .
(3) Finally, a two-dimensional discrete inverse Fourier transform (2D-IDFT) is performed on u ^ μ , δ or v ^ μ , δ using MATLAB’s IFFT, yielding the regularized solutions u μ , δ or v μ , δ in the spatial domain [ 2 π , 2 π ] × [ 2 π , 2 π ] .
Example 1. 
Consider the exact solution of (2) defined as
u ( x , y ) = u ( x , y 1 , y 2 ) = sin ( q y 1 ) sin ( q y 2 ) cosh ( x k 2 + 2 q 2 ) .
Accordingly, the function f ( y ) is given by
f ( y ) = u ( 0 , y ) = sin ( q y 1 ) sin ( q y 2 ) .
For q = 1 2 , Table 1, Table 2, Table 3 and Table 4 present the relative errors of the regularized solution u μ , δ obtained using the Dirichlet kernel, the Poussin kernel, the logarithmic kernel, and the hyperbolic tangent kernel, respectively, for various values of ϵ , x, and k. Based on the data in Table 1, Table 2, Table 3 and Table 4, the following conclusions can be drawn:
(1) As x increases, the ill-posedness of the Cauchy problem becomes more pronounced, resulting in larger errors in the corresponding regularized solution.
(2) As the noise level ϵ increases, the error in the corresponding regularized solution also increases consistently.
(3) The wave number k has a relatively minor influence on the accuracy of the regularized solution.
(4) The regularization performance of the Dirichlet kernel, the Poussin kernel, the logarithmic kernel, and the hyperbolic tangent kernel within the mollification method is comparable.
For both the logarithmic-type and hyperbolic tangent-type kernels, the parameter m governs the decay rate of the kernel over | ξ | ( 1 μ , 2 μ ) ; however, numerical experiments demonstrate that the influence of m [ 2 , 8 ] on the regularized solution is negligible. Thus, we fix m = 4 and exclude it from the set of sensitive parameters in subsequent analyses. For ϵ = 0.01 , the relative errors of the regularized solution u μ , δ with the Poussin kernel for various values of q, x, and k are reported in Table 5. These results demonstrate that regularization remains effective even when the exact solution u ( x , y ) is highly oscillatory.
When ϵ = 0.01 , q = 1 2 , and k = 10 , the exact solution u ( x , y ) and the regularized solution u μ , δ ( x , y ) with the Poussin kernel at x = 0.2 , 0.5 , 0.8 are displayed in Figure 2, Figure 3 and Figure 4, respectively. Throughout this section, all surface plots use the default MATLAB parula colormap, where dark blue and red denote the minimum and maximum values, respectively, with intermediate values shown in a continuous gradient. As shown in Figure 2, Figure 3 and Figure 4, the regularized solution provides a highly accurate approximation to the exact solution. Furthermore, the accuracy of the regularized solution increases as x decreases.
Example 2. 
Consider the exact solution of (3) defined as
v ( x , y ) = v ( x , y 1 , y 2 ) = cos ( q y 1 ) cos ( q y 2 ) sinh ( x 2 q 2 + k 2 ) 2 q 2 + k 2 .
Accordingly, the function g ( y ) is given by
g ( y ) = v x ( 0 , y ) = cos ( q y 1 ) cos ( q y 2 ) .
For q = 1 4 , Table 6, Table 7, Table 8 and Table 9 present the relative errors of the regularized solution v μ , δ with the Dirichlet kernel, the Poussin kernel, the logarithmic kernel, and the hyperbolic tangent kernel, respectively, for various values of ϵ , x, and k. For ϵ = 0.01 , the relative errors of the regularized solution u μ , δ with the Poussin kernel for various values of q, x, and k are reported in Table 10. When ϵ = 0.01 , q = 1 4 , and k = 10 , the exact solution v ( x , y ) and the regularized solution v μ , δ ( x , y ) with the Poussin kernel at x = 0.2 , 0.5 , 0.8 are displayed in Figure 5, Figure 6 and Figure 7, respectively. These results are consistent with those observed in Example 1.
Building on Examples 1 and 2, we present the following numerical example.
Example 3. 
Consider the Cauchy problem for the two-dimensional modified Helmholtz equation:
Δ w ( x , y ) k 2 w ( x , y ) = 0 , 0 < x 1 , y R 2 , w ( 0 , y ) = sin ( y 1 4 ) sin ( y 2 4 ) , y R 2 , w x ( 0 , y ) = cos ( y 1 2 ) cos ( y 2 2 ) , y R 2 .
Table 11 present the relative errors of the regularized solution w μ , δ with the Poussin kernel for various values of ϵ , x, and k. When ϵ = 0.01 and k = 10 , the exact solution w ( x , y ) and the regularized solution w μ , δ ( x , y ) with the Poussin kernel at x = 0.2 , 0.5 , 0.8 are displayed in Figure 8, Figure 9 and Figure 10, respectively. These results are consistent with those observed in Examples 1 and 2.
To further validate the method, we next examine a numerical example involving discontinuous exact solutions.
Example 4. 
Consider the exact solution of (2) at x = 1 given by
u ( 1 , y ) = u ( 1 , y 1 , y 2 ) = 10 4 , | y 1 | + | y 2 | 4 , 0 , | y 1 | + | y 2 | > 4 .
The exact solution of (3) at x = 1 is
v ( 1 , y ) = v ( 1 , y 1 , y 2 ) = u ( 1 , y 1 , y 2 ) .
Consequently, the functions f ( y ) and g ( y ) are given respectively by
f ( y ) = 1 2 π R 2 u ^ ( 1 , ξ ) cosh ( | ξ | 2 + k 2 ) · e i ξ · y d ξ ,
and
g ( y ) = 1 2 π R 2 v ^ ( 1 , ξ ) | ξ | 2 + k 2 sinh ( | ξ | 2 + k 2 ) · e i ξ · y d ξ .
When k = 10 , the exact data f ( y ) and g ( y ) are given in Figure 11; the perturbed data f δ and g δ are generated according to formula (18). When k = 10 and x = 1 , Figure 12a presents the log-log plot of the relative error in f δ versus that in the regularized solution u μ , δ obtained with the Poussin kernel, while Figure 12b shows the corresponding plot for g δ and v μ , δ . As demonstrated in Figure 12, the relative error of the regularized solution increases approximately linearly with the relative error of the perturbed data, indicating a power-law dependence between them. This observation is consistent with the theoretically predicted power-law convergence rate derived in this paper. When k = 10 , the exact solution u ( 1 , y ) and the regularized solution u μ , δ ( 1 , y ) obtained with the Poussin kernel are shown in Figure 13 for different noise levels. The corresponding results for v ( 1 , y ) and v μ , δ ( 1 , y ) are presented in Figure 14. As demonstrated in Figure 13 and Figure 14, the regularized solutions consistently capture the discontinuities present in the exact solution under various noise levels. These results confirm the effectiveness of the proposed approach for discontinuous problems.

6. Conclusions

In this paper, we propose a truncated-kernel mollification method to address the Cauchy problem of a multi-dimensional modified Helmholtz equation. Both a priori and a posteriori strategies for choosing the regularization parameters are introduced. Under additional assumptions on the exact data f ( y ) and g ( y ) , error estimates for the regularized solutions are derived, and their convergence rates are analyzed. For the Dirichlet kernel, the a posteriori parameter choice achieves the same convergence order as the a priori strategy: O ( δ 1 x ) for 0 < x < 1 , and O ( δ p 2 p ) for x = 1 . In contrast, this property does not hold for other truncated kernels: although they also yield power-law convergence rates, the a priori strategy achieves a strictly higher rate than the a posteriori strategy. Numerical experiments demonstrate that the regularization performance of different truncated-kernels in the mollification method is comparable, and that the proposed method yields excellent reconstruction performance for both continuous and discontinuous exact solutions. Moreover, the wave number k has a relatively minor influence on the error of the regularized solutions.

Author Contributions

Conceptualization, H.X.; methodology, H.X.; software, F.X. and B.W.; validation, F.X. and B.W.; formal analysis, H.X.; investigation, H.X. and F.X.; resources, H.X.; data curation, F.X. and B.W.; writing—original draft preparation, H.X. and F.X.; writing—review and editing, H.X.; visualization, F.X. and B.W.; supervision, H.X.; project administration, H.X.; funding acquisition, H.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (Grant No. 11661008).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Colton, D.; Kress, R. Inverse Acoustic and Electromagnetic Scattering Theory, 4th ed.; Springer: Cham, Switzerland, 2019. [Google Scholar]
  2. Alessandrini, G.; Vessella, S. Lipschitz stability for the inverse conductivity problem. Adv. Appl. Math. 2005, 35, 207–241. [Google Scholar] [CrossRef]
  3. 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, 4951–4964. [Google Scholar] [CrossRef]
  4. Qin, H.H.; Wei, T. Quasi-reversibility and truncation methods to solve a Cauchy problem of the modifed Helmholtz equation. Math. Comput. Simul. 2009, 80, 352–366. [Google Scholar] [CrossRef]
  5. Nguyen, H.T.; Tran, Q.V.; Nguyen, V.T. Some remarks on a modified Helmholtz equation with inhomogeneous source. Appl. Math. Model. 2013, 37, 793–814. [Google Scholar] [CrossRef]
  6. Qian, A.L.; Yang, X.M.; Wu, Y.S. Optimal error bound and a quasi-boundary value regularization method for a Cauchy problem of the modified Helmholtz equation. Int. J. Comput. Math. 2015, 93, 2028–2041. [Google Scholar] [CrossRef]
  7. Qin, H.H.; Wen, D.W. Tikhonov type regularization method for the Cauchy problem of the modified Helmholtz equation. Appl. Math. Comput. 2008, 203, 617–628. [Google Scholar] [CrossRef]
  8. Zhang, H.W.; Zhang, X.J. Generalized Tikhonov method and convergence estimate for the Cauchy problem of modified Helmholtz equation with nonhomogeneous Dirichlet and Neumann datum. Mathematics 2019, 7, 667. [Google Scholar] [CrossRef]
  9. Jday, F.; Omri, H. Adaptive Runge-Kutta regularization for a Cauchy problem of a modified Helmholtz equation. J. Inverse III-Posed Probl. 2023, 31, 351–374. [Google Scholar] [CrossRef]
  10. Hamdi, H.; Nachaoui, M.; Bergam, A.; Nachaoui, A. A posteriori-driven adaptive strategy for solving inverse Cauchy problems in diffusion-reaction models. Appl. Math. Comput. 2026, 518, 129902. [Google Scholar] [CrossRef]
  11. Chen, Y.G.; Yang, F.; Ding, Q. The Landweber Iterative Regularization Method for Solving the Cauchy Problem of the Modified Helmholtz Equation. Symmetry 2022, 14, 1209. [Google Scholar] [CrossRef]
  12. Fu, C.L.; Feng, X.L.; Qian, Z. The Fourier regularization for solving the Cauchy problem for the Helmholtz equation. Appl. Numer. Math. 2009, 59, 2625–2640. [Google Scholar] [CrossRef]
  13. He, S.Q.; Feng, X.F. A regularization method to solve a Cauchy problem for the two-dimensional modified Helmholtz equation. Mathematics 2019, 7, 360. [Google Scholar] [CrossRef]
  14. Xu, H.L.; Wang, B.X.; Zhou, D.M. A general mollification regularization method to solve a Cauchy problem for the multi-dimensional modified Helmholtz equation. Symmetry 2024, 16, 1549. [Google Scholar] [CrossRef]
  15. Hao, D.N. A mollification method for ill-posed problems. Numer. Math. 1994, 68, 469–506. [Google Scholar] [CrossRef]
  16. Yang, L.; Zhu, L.; He, S.Q.; Feng, X.F.; Zhao, B.X. Solving two kinds of inverse source problems for the heat equations by a mollification regularization method with Dirichlet kernel. Math. Methods Appl. Sci. 2024, 47, 14024–14036. [Google Scholar] [CrossRef]
  17. Yang, F.; Fu, C.L. A mollification regularization method for the inverse spatial-dependent heat source problem. J. Comput. Appl. Math. 2014, 255, 555–567. [Google Scholar] [CrossRef]
  18. Qiao, Y.; Xiong, X.T.; Han, J.J. A variational approach to recover the unknown source and initial condition for a time-space fractional diffusion equation. J. Appl. Math. Comput. 2025, 71, 3445–3476. [Google Scholar] [CrossRef]
  19. Yang, L.; Zhu, L.; He, S.Q.; Zhao, B.X. Regularization of the time-fractional order Schrödinger problem by using the mollification regularization method. Math. Methods Appl. Sci. 2025, 48, 6799–6817. [Google Scholar] [CrossRef]
  20. Xu, H.L.; Xu, F.L.; Zhou, D.M.; Zhang, R. The mollification regularization method with truncated kernels for solving the inverse time-fractional Schrödinger problem. Fractal Fract. 2026, 10, 191. [Google Scholar] [CrossRef]
  21. Maréchal, P.; Triki, F.; Lee, W. Regularization of the inverse Laplace transform by mollification. Inverse Probl. 2024, 40, 025010. [Google Scholar] [CrossRef]
  22. Lee, W. A variational technique of mollification applied to backward heat conduction problems. Appl. Math. Comput. 2023, 449, 127917. [Google Scholar] [CrossRef]
  23. Qiao, Y.; Xiong, X.T. A mollifier approach to the simultaneous identification of the unknown source and initial distribution in a space-fractional diffusion equation. Appl. Math. Comput. 2025, 489, 129175. [Google Scholar] [CrossRef]
  24. Kirsch, A. An Introduction to the Mathematical Theory of Inverse Problems, 3rd ed.; Springer: Cham, Switzerland, 2021. [Google Scholar]
Figure 1. The logarithmic-type kernel (a) and the hyperbolic tangent-type kernel (b) for different values of m with n = 1 and μ = 0.1 .
Figure 1. The logarithmic-type kernel (a) and the hyperbolic tangent-type kernel (b) for different values of m with n = 1 and μ = 0.1 .
Axioms 15 00593 g001
Figure 2. The exact solution u ( x , y ) , the regularized solution u μ , δ ( x , y ) with the Poussin kernel, and the error u μ , δ ( x , y ) u ( x , y ) at x = 0.2 when ϵ = 0.01 , q = 1 2 , and k = 10 .
Figure 2. The exact solution u ( x , y ) , the regularized solution u μ , δ ( x , y ) with the Poussin kernel, and the error u μ , δ ( x , y ) u ( x , y ) at x = 0.2 when ϵ = 0.01 , q = 1 2 , and k = 10 .
Axioms 15 00593 g002
Figure 3. The exact solution u ( x , y ) , the regularized solution u μ , δ ( x , y ) with the Poussin kernel, and the error u μ , δ ( x , y ) u ( x , y ) at x = 0.5 when ϵ = 0.01 , q = 1 2 , and k = 10 .
Figure 3. The exact solution u ( x , y ) , the regularized solution u μ , δ ( x , y ) with the Poussin kernel, and the error u μ , δ ( x , y ) u ( x , y ) at x = 0.5 when ϵ = 0.01 , q = 1 2 , and k = 10 .
Axioms 15 00593 g003
Figure 4. The exact solution u ( x , y ) , the regularized solution u μ , δ ( x , y ) with the Poussin kernel, and the error u μ , δ ( x , y ) u ( x , y ) at x = 0.8 when ϵ = 0.01 , q = 1 2 , and k = 10 .
Figure 4. The exact solution u ( x , y ) , the regularized solution u μ , δ ( x , y ) with the Poussin kernel, and the error u μ , δ ( x , y ) u ( x , y ) at x = 0.8 when ϵ = 0.01 , q = 1 2 , and k = 10 .
Axioms 15 00593 g004
Figure 5. The exact solution v ( x , y ) , the regularized solution v μ , δ ( x , y ) with the Poussin kernel, and the error v μ , δ ( x , y ) v ( x , y ) at x = 0.2 when ϵ = 0.01 , q = 1 4 , and k = 10 .
Figure 5. The exact solution v ( x , y ) , the regularized solution v μ , δ ( x , y ) with the Poussin kernel, and the error v μ , δ ( x , y ) v ( x , y ) at x = 0.2 when ϵ = 0.01 , q = 1 4 , and k = 10 .
Axioms 15 00593 g005
Figure 6. The exact solution v ( x , y ) , the regularized solution v μ , δ ( x , y ) with the Poussin kernel, and the error v μ , δ ( x , y ) v ( x , y ) at x = 0.5 when ϵ = 0.01 , q = 1 4 , and k = 10 .
Figure 6. The exact solution v ( x , y ) , the regularized solution v μ , δ ( x , y ) with the Poussin kernel, and the error v μ , δ ( x , y ) v ( x , y ) at x = 0.5 when ϵ = 0.01 , q = 1 4 , and k = 10 .
Axioms 15 00593 g006
Figure 7. The exact solution v ( x , y ) , the regularized solution v μ , δ ( x , y ) with the Poussin kernel, and the error v μ , δ ( x , y ) v ( x , y ) at x = 0.8 when ϵ = 0.01 , q = 1 4 , and k = 10 .
Figure 7. The exact solution v ( x , y ) , the regularized solution v μ , δ ( x , y ) with the Poussin kernel, and the error v μ , δ ( x , y ) v ( x , y ) at x = 0.8 when ϵ = 0.01 , q = 1 4 , and k = 10 .
Axioms 15 00593 g007
Figure 8. The exact solution w ( x , y ) , the regularized solution w μ , δ ( x , y ) with the Poussin kernel, and the error w μ , δ ( x , y ) w ( x , y ) at x = 0.2 when ϵ = 0.01 and k = 10 .
Figure 8. The exact solution w ( x , y ) , the regularized solution w μ , δ ( x , y ) with the Poussin kernel, and the error w μ , δ ( x , y ) w ( x , y ) at x = 0.2 when ϵ = 0.01 and k = 10 .
Axioms 15 00593 g008
Figure 9. The exact solution w ( x , y ) , the regularized solution w μ , δ ( x , y ) with the Poussin kernel, and the error w μ , δ ( x , y ) w ( x , y ) at x = 0.5 when ϵ = 0.01 and k = 10 .
Figure 9. The exact solution w ( x , y ) , the regularized solution w μ , δ ( x , y ) with the Poussin kernel, and the error w μ , δ ( x , y ) w ( x , y ) at x = 0.5 when ϵ = 0.01 and k = 10 .
Axioms 15 00593 g009
Figure 10. The exact solution w ( x , y ) , the regularized solution w μ , δ ( x , y ) with the Poussin kernel, and the error w μ , δ ( x , y ) w ( x , y ) at x = 0.8 when ϵ = 0.01 and k = 10 .
Figure 10. The exact solution w ( x , y ) , the regularized solution w μ , δ ( x , y ) with the Poussin kernel, and the error w μ , δ ( x , y ) w ( x , y ) at x = 0.8 when ϵ = 0.01 and k = 10 .
Axioms 15 00593 g010
Figure 11. The exact data f ( y ) and g ( y ) in Example 4 for k = 10 .
Figure 11. The exact data f ( y ) and g ( y ) in Example 4 for k = 10 .
Axioms 15 00593 g011
Figure 12. Log-log plots of relative errors for k = 10 and x = 1 : (a) rel ( f δ ) vs. rel ( u μ , δ ) and (b) rel ( g δ ) vs. rel ( v μ , δ ) .
Figure 12. Log-log plots of relative errors for k = 10 and x = 1 : (a) rel ( f δ ) vs. rel ( u μ , δ ) and (b) rel ( g δ ) vs. rel ( v μ , δ ) .
Axioms 15 00593 g012
Figure 13. The exact solution u ( 1 , y ) (a) and the regularized solutions u μ , δ ( 1 , y ) with the Poussin kernel when k = 10 , for noise levels ϵ = 0.001 (b), 0.01 (c), and 0.1 (d).
Figure 13. The exact solution u ( 1 , y ) (a) and the regularized solutions u μ , δ ( 1 , y ) with the Poussin kernel when k = 10 , for noise levels ϵ = 0.001 (b), 0.01 (c), and 0.1 (d).
Axioms 15 00593 g013
Figure 14. The exact solution v ( 1 , y ) (a) and the regularized solutions v μ , δ ( 1 , y ) with the Poussin kernel when k = 10 , for noise levels ϵ = 0.001 (b), 0.01 (c), and 0.1 (d).
Figure 14. The exact solution v ( 1 , y ) (a) and the regularized solutions v μ , δ ( 1 , y ) with the Poussin kernel when k = 10 , for noise levels ϵ = 0.001 (b), 0.01 (c), and 0.1 (d).
Axioms 15 00593 g014
Table 1. The relative errors of the regularized solution u μ , δ with the Dirichlet kernel for q = 1 2 and various values of ϵ , x, and k.
Table 1. The relative errors of the regularized solution u μ , δ with the Dirichlet kernel for q = 1 2 and various values of ϵ , x, and k.
ϵ = 0.001 ϵ = 0.01 ϵ = 0.1
k = 1 0.0108 0.0101 0.0994
x = 0.2 k = 10 0.0106 0.0107 0.1011
k = 100 0.0106 0.0106 0.1013
k = 1 0.0192 0.0194 0.0968
x = 0.5 k = 10 0.0110 0.0111 0.1010
k = 100 0.0106 0.0106 0.1021
k = 1 0.0498 0.0505 0.0895
x = 0.8 k = 10 0.0119 0.0120 0.1011
k = 100 0.0106 0.0106 0.1007
Table 2. The relative errors of the regularized solution u μ , δ with the Poussin kernel for q = 1 2 and various values of ϵ , x, and k.
Table 2. The relative errors of the regularized solution u μ , δ with the Poussin kernel for q = 1 2 and various values of ϵ , x, and k.
ϵ = 0.001 ϵ = 0.01 ϵ = 0.1
k = 1 0.0097 0.0100 0.1018
x = 0.2 k = 10 0.0099 0.0102 0.1045
k = 100 0.0104 0.0103 0.1031
k = 1 0.0141 0.0142 0.1020
x = 0.5 k = 10 0.0099 0.0101 0.1030
k = 100 0.0101 0.0103 0.1022
k = 1 0.0388 0.0428 0.1026
x = 0.8 k = 10 0.0098 0.0101 0.1026
k = 100 0.0101 0.0102 0.1028
Table 3. The relative errors of the regularized solution u μ , δ with the logarithmic kernel for m = 4 , q = 1 2 , and various values of ϵ , x, and k.
Table 3. The relative errors of the regularized solution u μ , δ with the logarithmic kernel for m = 4 , q = 1 2 , and various values of ϵ , x, and k.
ϵ = 0.001 ϵ = 0.01 ϵ = 0.1
k = 1 0.0099 0.0100 0.1007
x = 0.2 k = 10 0.0100 0.0101 0.1033
k = 100 0.0102 0.0103 0.1021
k = 1 0.0152 0.0153 0.1018
x = 0.5 k = 10 0.0097 0.0101 0.1024
k = 100 0.0101 0.0102 0.1020
k = 1 0.0415 0.0471 0.1018
x = 0.8 k = 10 0.0098 0.0099 0.1027
k = 100 0.0101 0.0102 0.1019
Table 4. The relative errors of the regularized solution u μ , δ with the hyperbolic tangent kernel for m = 4 , q = 1 2 , and various values of ϵ , x, and k.
Table 4. The relative errors of the regularized solution u μ , δ with the hyperbolic tangent kernel for m = 4 , q = 1 2 , and various values of ϵ , x, and k.
ϵ = 0.001 ϵ = 0.01 ϵ = 0.1
k = 1 0.0101 0.0101 0.1009
x = 0.2 k = 10 0.0102 0.0104 0.1022
k = 100 0.0102 0.0102 0.1029
k = 1 0.0176 0.0185 0.1021
x = 0.5 k = 10 0.0104 0.0105 0.1017
k = 100 0.0103 0.0104 0.1029
k = 1 0.0479 0.0497 0.1007
x = 0.8 k = 10 0.0111 0.0110 0.1030
k = 100 0.0102 0.0102 0.1021
Table 5. The relative errors of the regularized solution u μ , δ with the Poussin kernel for ϵ = 0.01 and various values of q, x, and k.
Table 5. The relative errors of the regularized solution u μ , δ with the Poussin kernel for ϵ = 0.01 and various values of q, x, and k.
q = 1 2 q = 1 q = 2
k = 1 0.0100 0.0196 0.0382
x = 0.2 k = 10 0.0102 0.0197 0.0389
k = 100 0.0103 0.0204 0.0406
k = 1 0.0142 0.0268 0.0461
x = 0.5 k = 10 0.0101 0.0193 0.0369
k = 100 0.0103 0.0203 0.0402
k = 1 0.0428 0.0668 0.0953
x = 0.8 k = 10 0.0101 0.0195 0.0364
k = 100 0.0102 0.0201 0.0396
Table 6. The relative errors of the regularized solution v μ , δ with the Dirichlet kernel for q = 1 4 and various values of ϵ , x, and k.
Table 6. The relative errors of the regularized solution v μ , δ with the Dirichlet kernel for q = 1 4 and various values of ϵ , x, and k.
ϵ 0.001 0.01 0.1
k = 1 0.0094 0.0144 0.1160
x = 0.2 k = 10 0.0094 0.0145 0.1152
k = 100 0.0093 0.0146 0.1156
k = 1 0.0126 0.0161 0.1112
x = 0.5 k = 10 0.0101 0.0144 0.1140
k = 100 0.0093 0.0146 0.1157
k = 1 0.0273 0.0284 0.1069
x = 0.8 k = 10 0.0118 0.0156 0.1122
k = 100 0.0093 0.0145 0.1153
Table 7. The relative errors of the regularized solution v μ , δ with the Poussin kernel for q = 1 4 and various values of ϵ , x, and k.
Table 7. The relative errors of the regularized solution v μ , δ with the Poussin kernel for q = 1 4 and various values of ϵ , x, and k.
ϵ 0.001 0.01 0.1
k = 1 0.0099 0.0152 0.1397
x = 0.2 k = 10 0.0102 0.0154 0.1395
k = 100 0.0104 0.0156 0.1392
k = 1 0.0113 0.0149 0.1368
x = 0.5 k = 10 0.0101 0.0144 0.1382
k = 100 0.0102 0.0156 0.1435
k = 1 0.0211 0.0235 0.1375
x = 0.8 k = 10 0.0108 0.0145 0.1377
k = 100 0.0103 0.0155 0.1397
Table 8. The relative errors of the regularized solution v μ , δ with the logarithmic kernel for m = 4 , q = 1 4 , and various values of ϵ , x, and k.
Table 8. The relative errors of the regularized solution v μ , δ with the logarithmic kernel for m = 4 , q = 1 4 , and various values of ϵ , x, and k.
ϵ 0.001 0.01 0.1
k = 1 0.0101 0.0151 0.1405
x = 0.2 k = 10 0.0104 0.0153 0.1409
k = 100 0.0105 0.0154 0.1420
k = 1 0.0119 0.0152 0.1399
x = 0.5 k = 10 0.0105 0.0146 0.1381
k = 100 0.0103 0.0155 0.1423
k = 1 0.0220 0.0243 0.1130
x = 0.8 k = 10 0.0113 0.0150 0.1393
k = 100 0.0104 0.0152 0.1419
Table 9. The relative errors of the regularized solution v μ , δ with the hyperbolic tangent kernel for m = 4 , q = 1 4 , and various values of ϵ , x, and k.
Table 9. The relative errors of the regularized solution v μ , δ with the hyperbolic tangent kernel for m = 4 , q = 1 4 , and various values of ϵ , x, and k.
ϵ 0.001 0.01 0.1
k = 1 0.0104 0.0153 0.1509
x = 0.2 k = 10 0.0107 0.0154 0.1514
k = 100 0.0106 0.0157 0.1519
k = 1 0.0130 0.0165 0.1474
x = 0.5 k = 10 0.0110 0.0152 0.1498
k = 100 0.0104 0.0156 0.1525
k = 1 0.0246 0.0269 0.1462
x = 0.8 k = 10 0.0123 0.0160 0.1487
k = 100 0.0105 0.0153 0.1520
Table 10. The relative errors of the regularized solution v μ , δ with the Poussin kernel for ϵ = 0.01 and various values of q, x, and k.
Table 10. The relative errors of the regularized solution v μ , δ with the Poussin kernel for ϵ = 0.01 and various values of q, x, and k.
q = 1 4 q = 1 q = 2
k = 1 0.0152 0.0170 0.0186
x = 0.2 k = 10 0.0154 0.0169 0.0192
k = 100 0.0156 0.0166 0.0194
k = 1 0.0149 0.0161 0.0171
x = 0.5 k = 10 0.0144 0.0165 0.0177
k = 100 0.0156 0.0167 0.0197
k = 1 0.0235 0.0157 0.0212
x = 0.8 k = 10 0.0145 0.0160 0.0169
k = 100 0.0155 0.0169 0.0191
Table 11. The relative errors of the regularized solution w μ , δ with the Poussin kernel for various values of ϵ , x, and k.
Table 11. The relative errors of the regularized solution w μ , δ with the Poussin kernel for various values of ϵ , x, and k.
ϵ 0.001 0.01 0.1
k = 1 0.0099 0.0121 0.1223
x = 0.2 k = 10 0.0101 0.0112 0.1116
k = 100 0.0103 0.0104 0.1029
k = 1 0.0144 0.0146 0.1463
x = 0.5 k = 10 0.0097 0.0108 0.1089
k = 100 0.0101 0.0104 0.1028
k = 1 0.0443 0.0386 0.1553
x = 0.8 k = 10 0.0099 0.0107 0.1096
k = 100 0.0101 0.0103 0.1029
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

Xu, H.; Xu, F.; Wang, B. A Truncated-Kernel Mollification Method for the Cauchy Problem of the Modified Helmholtz Equation. Axioms 2026, 15, 593. https://doi.org/10.3390/axioms15080593

AMA Style

Xu H, Xu F, Wang B. A Truncated-Kernel Mollification Method for the Cauchy Problem of the Modified Helmholtz Equation. Axioms. 2026; 15(8):593. https://doi.org/10.3390/axioms15080593

Chicago/Turabian Style

Xu, Huilin, Fanli Xu, and Baoxia Wang. 2026. "A Truncated-Kernel Mollification Method for the Cauchy Problem of the Modified Helmholtz Equation" Axioms 15, no. 8: 593. https://doi.org/10.3390/axioms15080593

APA Style

Xu, H., Xu, F., & Wang, B. (2026). A Truncated-Kernel Mollification Method for the Cauchy Problem of the Modified Helmholtz Equation. Axioms, 15(8), 593. https://doi.org/10.3390/axioms15080593

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