Next Article in Journal
Developing Prospective Teachers’ Beliefs about Digital Tools and Digital Feedback
Previous Article in Journal
Examining Consumer’s Intention to Adopt AI-Chatbots in Tourism Using Partial Least Squares Structural Equation Modeling Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Identifying the Unknown Source in Linear Parabolic Equation by a Convoluting Equation Method

1
Department of Mathematics and Physics, Luoyang Institute of Science and Technology, Luoyang 471023, China
2
Department of Mathematics, Northwest Normal University, Lanzhou 730070, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(13), 2191; https://doi.org/10.3390/math10132191
Submission received: 23 May 2022 / Revised: 18 June 2022 / Accepted: 20 June 2022 / Published: 23 June 2022

Abstract

:
This article is devoted to identifying a space-dependent source term in linear parabolic equations. Such a problem is ill posed, i.e., a small perturbation in the input data may cause a dramatically large error in the solution (if it exists). The conditional stability of the solution is analyzed. Based on a convoluting equation method, we can deal with the problem under the a priori parameter choice rule. Meanwhile, a modified version of Morozov’s discrepancy principle is provided to decide on an a posteriori regularization parameter choice strategy and a log-type error estimate is obtained. Two numerical results show that our proposed method works well.

1. Introduction

It is an important natural process of transport and diffusion and the following parabolic partial differential equation is induced
u t + L u = f ( x , t ; u ) , ( x , t ) Ω × ( 0 , T ) ,
where Ω is a bounded domain in R d ( 1 d 3 ) , u represents the state variable, L is a differential operator with respect to x, such as the second order elliptic operator L u = ( u x x + v u x q u ) with fixed constants v , q and the space-fractional diffusion operator L u = x D θ α , and f denotes some physical laws.
In many branches of science and engineering, e.g., crack identification, geophysical prospecting, pollutant detection, and also for designing the final state in melting and freezing processes, the characteristics of sources are often unknown and need to be determined. This is the so-called inverse source identification problem , which is a classic ill-posed problem in the sense of Hadamard, i.e., a small perturbation in the input data may cause a dramatically large error in the solution (if it exists). Many studies on such inverse problems of determining source terms have been performed since the 1970s. There have been a large number of research results for different forms of heat sources [1,2,3,4,5,6,7,8,9,10,11]. A few theoretical articles concern conditional stability and the data compatibility of the solution notably in [1,3,8,12,13,14,15]. As yet, there are many published works in this field based in several numerical methods, such as the Lie-group shooting method (LGSM) [5], the coupled method [16], the fundamental solutions method [6,17], the meshless method [7,18], the genetic algorithm [4], and the conjugate gradient method (CGM) [19,20,21]. In [22,23], these numerical methods were considered to solve two and three-dimensional inverse transient heat source problems. In [24], the authors used the simplified Tikhonov method to identify the unknown source. There are some other the regularization methods to solve this problem, such as the Fourier regularization method [25], the wavelet dual squares method [26], the Tikhonov-type method [27], the mollification regularization method [10,11,28], the optimization method [29], and the Landweber method [30,31].
Although many different numerical schemes have been introduced in recent decades to solve the inverse source identification problem, it has not completely been solved yet. Based on some of the traditional methods, finite differences method (FDM) [32], finite element method (FEM), and the boundary element method (BEM) [2,33], the inverse source identification problem has been solved. Furthermore, other methods such as the linear least-squares error method, the sequential method, and the iterative regularization methods [20,34,35] have been used to deal with the inverse source problem. As for these methods, it is necessary for us to discretize the differential equations. However, the ill posing of these kinds of problems and the ill conditioning of the resulting discretized matrix are the main problems in constructing the numerical algorithm for determining these problems. Therefore, a suitable regularization method should be used.
In this article, we prefer to use a convoluting equation method to consider the identification of the unknown source problem. The idea was borrowed from [36], where Zheng and Wei proposed a modified equation method using convolution to solve the space-fractional backward diffusion problem. At present, there are few studies using this regularization method [36,37,38]. In [37], Cong Shi and his coauthors used this method, which they called the convolution regularization, to solve the backward problems of linear parabolic equations. In [38], the authors studied the a posteriori parameter choice of this method for the space-fractional backward diffusion problem. However, the a posteriori choice of the regularization parameter is not given in [36]. The conditional stability of the corresponding problem is not discussed in the above literature. This article can be regarded as an extension of the above work. The difference is that the Refs. [36,37,38] are devoted to the backward problem. The present article is devoted to the inverse source identification problem. In fact, this article is devoted to three aspects: (1) The conditional stability for the IHSP is considered under a suitable priori condition in Section 2; (2) The a priori strategy for choosing the regularization parameter and the corresponding error estimate is given; (3) We do an analysis on the fact that the Morozov’s discrepancy principle does not work here and give a new a posteriori parameter choice based on a modified version of the discrepancy principle; we also obtain a log-type error estimate under an additional source condition.
The techniques in this article may also be applied to other inverse problems, such as the high-dimensional cases or elliptic partial differential equations, which is also our next research work. It is worth pointing out that the convoluting equation method in this article is different from the mollification method [10,11,28]. The mollification method is to use a convolution of the noise data and a smooth function with a parameter to filter the high-frequency components of the noise data. The convoluting equation method is to prevent the high-frequency components of the solution from blowing up by convolution with the derivative term of space in the equation.
The outline of this article is as follows. Section 2 analyzes the ill posedness of the inverse heat source problem and its conditional stability. In Section 3, the convoluting equation method is given, and we derive the convergence rates under the a priori rules for the choices of the regularization parameter. In Section 4, we come up with a new generalized discrepancy principle to decide the regularization parameter. Section 5 gives two numerical examples to demonstrate the reasonableness and effectiveness under two kinds of regularization parameter choice rules. Section 6 concludes the article and gives some suggestions.

2. Mathematical Formulation, Ill Posedness of the Problem, and Its Conditional Stability

We consider the one-dimensional problem in which the source term f ( x , t ; u ) = f ( x ) depends on just space parameter and satisfies
u t ( x , t ) + L u ( x , t ) = f ( x ) , x R , t > 0 , u ( x , 0 ) = 0 , x R , u ( x , T ) = g ( x ) , x R .
where g ( x ) is given and f ( x ) is unknown. In practice, the exact data g is always unknown and we only have a noisy measurement g δ L 2 ( R ) . We use the additional data u ( x , T ) = g δ ( x ) to identify the source term f ( x ) .
In order to analyze the problem (2) in L 2 ( R ) , we let · denote the norm in L 2 ( R ) , and
f ^ ( ξ ) : = 1 2 π e i ξ x f ( x ) d x
represent the Fourier transform of the function f ( x ) .
We define the operator L as a differential operator or a fractional differential operator with respect to x R , which is given by the Fourier transform
L ^ u ( ξ , t ) = l ( ξ ) u ^ ( ξ , t )
and l : R C is a function called the symbol of the operator L, satisfying the following conditions:
( L 1 ) | l ( ξ ) | a 1 ( 1 + | ξ | α ) , ξ R , a 1 > 0 , α > 0 ;
( L 2 ) R e ( l ( ξ ) ) a 2 | ξ | α , ξ R , a 2 > 0 , α > 0 .
where α > 0 is the order of the operator L. Here are some examples in the following forms:
  • If L u = u x x , then u t = u x x + f ( x ) , where l ( ξ ) = ξ 2 for α = 2 .
  • If L u = u x x v u x + q u , then u t = u x x + v u x q u + f ( x ) , the constant v , q 0 where l ( ξ ) = ξ 2 i ξ v + q for α = 2 .
  • If L u = x D θ α u , then u t = x D θ α u + f ( x ) , where the space-factional derivative x D θ α u ( x , t ) , which is the Riesz-Feller fractional derivative of order
    α ( 0 < α 2 ) and skewness θ ( | θ | min ( α , 2 α ) , θ ± 1 ) , is defined in terms of the Fourier transform in [39], i.e.,
    F { x D θ α f ( x ) ; ξ } = ψ θ α ( ξ ) f ^ ( ξ ) ,
    where ψ θ α ( ξ ) = | ξ | α e i ( s g n ξ ) θ π / 2 , this is, l ( ξ ) = | ξ | α e i ( s g n ξ ) θ π / 2 .
According to the equation and the initial value in (2), we can obtain the solution in frequency domain
u ^ ( ξ , t ) = 1 e l ( ξ ) t l ( ξ ) f ^ ( ξ ) .
By using the additional data in (2), we obtain
f ^ ( ξ ) = l ( ξ ) 1 e T l ( ξ ) g ^ ( ξ ) ,
or equivalently,
f ( x ) = 1 2 π e i ξ x l ( ξ ) g ^ ( ξ ) 1 e T l ( ξ ) d ξ .
Furthermore, setting K ^ = 1 e T l ( ξ ) l ( ξ ) : L 2 ( R ) L 2 ( R ) is a multiplication operator in the frequency domain, we have K ^ f ^ = g ^ .
Our purpose is to identify f ( x ) from the noise data g δ ( x ) . However, when ξ , the function l ( ξ ) 1 e T l ( ξ ) is unbounded. Therefore, it can be considered to be an amplified factor with respect variable ξ for fixed α > 0 . The source term f ( x ) is assumed to be in L 2 ( R ) ; then, the exact data function g ^ ( ξ ) must decay as ξ . However, the noisy data function g δ ( x ) , which is only in L 2 ( R ) , does not have the same decay in the frequency domain. So, this problem is mildly ill posed and the degree of the ill posedness is equivalent to that of the α -order numerical differentiation. We will deal with the ill-posed problem via a convoluting equation method in the next section.
Lemma 1.
If x > 1 , the following inequality holds
1 1 e x < 2 .
The proof of Lemma 1 is straightforward, so we omit it here.
Lemma 2.
If z = x + i y for x 0 and y R , then we can obtain | 1 e z | min { 2 , 2 | z | } .
Proof. 
Due to the inequality that | 1 e z | 1 + | e z | 2 , and
| 1 e z | | 1 e i y | + | e i y e x i y | | y | + x 2 | z | .
Because the problem (2) is linear, we can derive the following conditional stability estimate on the solution when the data function g ( x ) is close to zero. □
Theorem 1.
If f ( x ) p E , then the following estimate holds
f ( x ) 2 p p + α max { ( a 1 ( 1 + | ξ 0 | α ) ) p p + α , T p p + α } E α p + α g p p + α ,
where · p refers to the H p norm, ξ 0 satisfy | l ( ξ 0 ) | = 1 T .
Proof. 
From (7), Parseval formula and Hölder inequality, we have
f ( x ) 2 = f ^ ( ξ ) 2 = ( l ( ξ ) 1 e T l ( ξ ) ) 2 g ^ ( ξ ) 2 d ξ = ( l ( ξ ) 1 e T l ( ξ ) ) 2 g ^ ( ξ ) 2 α p + α g ^ ( ξ ) 2 p p + α d ξ ( ( l ( ξ ) 1 e T l ( ξ ) ) 2 ( p + α ) α g ^ ( ξ ) 2 d ξ ) α p + α ( g ^ ( ξ ) 2 d ξ ) p p + α = ( ( l ( ξ ) 1 e T l ( ξ ) ) 2 p α ( 1 + ξ 2 ) p ( 1 + ξ 2 ) p ( l ( ξ ) g ^ ( ξ ) 1 e T l ( ξ ) ) 2 d ξ ) α p + α g 2 p p + α ( sup ξ R ( | l ( ξ ) | 1 e T | l ( ξ ) | ) 2 p α ( 1 + ξ 2 ) p ) α p + α E 2 α p + α g 2 p p + α .
Due to | l ( ξ ) | tending to infinity as | ξ | , there must exist a ξ 0 , satisfying | T l ( ξ ) | = 1 . Furthermore, we know | l ( ξ ) | is an increasing function with respect to | ξ | . If we let
H ( ξ ) = ( | l ( ξ ) | 1 e T | l ( ξ ) | ) 2 p α ( 1 + ξ 2 ) p ,
so when ξ > ξ 0 , this is, | T l ( ξ ) | > 1 , then by Lemma 1 and ( L 1 ) we have
H ( ξ ) ( 2 a 1 ) 2 p α ( 1 + | ξ | α ) 2 p α ξ 2 p ( 2 a 1 ) 2 p α ( 1 + | ξ 0 | α ) 2 p α .
When 0 < ξ ξ 0 , thus | T l ( ξ ) | 1 , note that H ( ξ ) is also an increasing function with respect to ξ , then, we have
H ( ξ ) H ( ξ 0 ) ( | l ( ξ 0 ) | 1 e T | l ( ξ 0 ) | ) 2 p α ( 2 T ) 2 p α .
From the above two cases, the proof of Theorem 1 is completed. □
Remark 1.
If f 1 ( x ) and f 2 ( x ) denote, respectively, the corresponding source terms of any given functions g 1 ( x ) and g 2 ( x ) in problem (2), then we have
f 1 ( x ) f 2 ( x ) 2 p p + α max { ( a 1 ( 1 + | ξ 0 | α ) ) p p + α , T p p + α } E α p + α g 1 ( x ) g 2 ( x ) p p + α ,
where ξ 0 satisfy | l ( ξ 0 ) | = 1 T .

3. Convoluting Equation Method and Its Convergence Analysis under a Priori Parameter Choice Rule

By modifying Equation (2) as the following, we can obtain an approximate solution for (2), i.e.,
u t ( x , t ) + P μ ( x ) L u ( x , t ) = f ( x ) , x R , t > 0 , u ( x , 0 ) = 0 , x R , u ( x , T ) = g δ ( x ) , x R .
where “*” denotes the convolution operation, P μ ( x ) is called kernel function, and μ is the regularization parameter. In reality, the measurement data are noise contaminated and satisfy
g ( x ) g δ ( x ) δ ,
where the level of tolerance δ > 0 represents a bound on the measurement error and · refers to the L 2 -norm.
If using Fourier transform (3), the solution of problem (9) can be formulated in the frequency space as follows:
f ^ μ δ ( ξ ) = P ^ μ ( ξ ) l ( ξ ) 1 e T P ^ μ ( ξ ) l ( ξ ) g ^ δ ( ξ ) .
The suitable convolution kernel P μ ( x ) must satisfy the following two conditions:
  • For each fixed μ > 0 , P ^ μ ( ξ ) l ( ξ ) 1 e T P ^ μ ( ξ ) l ( ξ ) is bounded as | ξ | .
  • If ξ is fixed, then P ^ μ ( ξ ) l ( ξ ) 1 e T P ^ μ ( ξ ) l ( ξ ) l ( ξ ) 1 e T l ( ξ ) as μ 0 .
Due to the fact that the proposed method aims to filter the smaller singular values for the linear self-adjoint compact operator K ^ , we suppose that the convolution kernels satisfy three properties, as follows.
Definition 1.
A family of functions P μ ( x ) μ > 0 is called a regularization kernel of order ( α , β ) for α , β > 0 , if the following three properties are satisfied for all ξ R ,
( K 1 ) 0 P ^ μ ( ξ ) 1 ;
( K 2 ) | 1 P ^ μ ( ξ ) | b 1 | μ ξ | β , b 1 > 0 is a constant;
( K 3 ) P ^ μ ( ξ ) | ξ | α b 2 μ α , b 2 > 0 is a constant.
In this article, we will give some possible convolution kernels:
Case 1. The kernel P μ ( x ) = e | x | μ 2 μ (see [36]), and its Fourier transform is P ^ μ ( ξ ) = 1 1 + μ 2 ξ 2 , the kernel is of order ( α , 2 ) for 0 < α 2 .
Case 2. The kernel P μ ( x ) = 1 2 π μ e x 2 4 μ 2 , and P ^ μ ( ξ ) = e μ 2 ξ 2 , the kernel is of order ( α , 2 ) for any α > 0 .
Case 3. If making the above two cases generalization, we have P ^ μ ( ξ ) = 1 1 + ( μ | ξ | ) β or P ^ μ ( ξ ) = e ( μ | ξ | ) β which have order ( α , β ) for 0 < α β .
Case 4. We could also choose P μ ( x ) = 1 π x sin x μ , which gives P ^ μ ( ξ ) = χ [ 1 μ , 1 μ ] ( ξ ) , and the kernel is of order ( α , β ) for any β 1 and α > 0 .
Now, let us verify that Case 1 to Case 4 satisfy the conditions in Definition 1. It is obvious to prove the ( K 1 ) for all cases above. Note that 1 1 1 + ( μ | ξ | ) β = ( μ | ξ | ) β 1 + ( μ | ξ | ) β ( μ | ξ | ) β , 1 e ( μ | ξ | ) β ( μ | ξ | ) β , we have verified the ( K 2 ) . As for ( K 3 ) , we have ( μ | ξ | ) α 1 + ( μ | ξ | ) β 1 for 0 < α β , then | ξ | α 1 + ( μ | ξ | ) β μ α , μ α | ξ | α e ( μ | ξ | ) β ( α e β ) α β 1 , then we also have e ( μ | ξ | ) β | ξ | α μ α .
According to the knowledge of Sobolev Space, we use the following assumption here
f ( x ) p : =   ( ( 1 + ξ 2 ) p | f ^ ( ξ ) | 2 d ξ ) 1 2 E , p > 0 .
(A) (Stability). Set f μ ( x ) is the solution of (9) with δ = 0 , i.e.,
f ^ μ ( ξ ) = P ^ μ ( ξ ) l ( ξ ) 1 e T P ^ μ ( ξ ) l ( ξ ) g ^ ( ξ ) .
Due to the Parseval identity, we have
f μ δ ( x ) f μ ( x ) = f ^ μ δ ( ξ ) f ^ μ ( ξ ) = P ^ μ ( ξ ) l ( ξ ) 1 e T P ^ μ ( ξ ) l ( ξ ) ( g ^ δ ( ξ ) g ^ ( ξ ) ) δ sup ξ R | P ^ μ ( ξ ) l ( ξ ) | 1 e T | P ^ μ ( ξ ) l ( ξ ) | .
Let G ( ξ ) = | P ^ μ ( ξ ) l ( ξ ) | 1 e T | P ^ μ ( ξ ) l ( ξ ) | , if s = | P ^ μ ( ξ ) l ( ξ ) | , then G ( ξ ) can be rewritten as G ( s ) : = s 1 e T s , which is an increasing function with respect to s. From ( L 1 ) , ( K 1 ) , ( K 3 ) , and Lemma 1, we obtain
G ( ξ ) 2 a 1 ( 1 + b 2 μ α ) .
Combining with the above inequality, we have
f μ δ ( x ) f μ ( x ) 2 a 1 ( 1 + b 2 μ α ) δ .
(B) (Convergence). From the Parseval identity, we have
f μ ( x ) f ( x ) = f ^ μ ( ξ ) f ^ ( ξ ) = P ^ μ ( ξ ) l ( ξ ) 1 e T P ^ μ ( ξ ) l ( ξ ) g ^ ( ξ ) f ^ ( ξ ) = ( 1 P ^ μ ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ ( ξ ) l ( ξ ) ) f ^ ( ξ ) sup ξ R | ( 1 P ^ μ ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ ( ξ ) l ( ξ ) ) ( 1 + ξ 2 ) p 2 | ( 1 + ξ 2 ) p 2 f ^ ( ξ ) E sup ξ R | ( 1 P ^ μ ( ξ ) ( 1 e T | l ( ξ ) | ) 1 e T P ^ μ ( ξ ) | l ( ξ ) | ) ( 1 + ξ 2 ) p 2 | .
Let D ( ξ ) = ( 1 P ^ μ ( ξ ) ( 1 e T | l ( ξ ) | ) 1 e T P ^ μ ( ξ ) | l ( ξ ) | ) ( 1 + ξ 2 ) p 2 , we divide D ( ξ ) into two cases:
Case 1. | ξ | > μ γ , we have
D ( ξ ) ( 1 P ^ μ ( ξ ) ) | ξ | p μ p γ .
Case 2. | ξ | μ γ , we have
D ( ξ ) 1 P ^ μ ( ξ ) ( 1 e T | l ( ξ ) | ) 1 e T P ^ μ ( ξ ) | l ( ξ ) | 1 P ^ μ ( ξ ) b 1 | μ ξ | β b 1 μ ( 1 γ ) β .
If we choose γ = β p + β , then we can obtain
D ( ξ ) max { 1 , b 1 } μ p β p + β .
Thus
f μ ( x ) f ( x ) max { 1 , b 1 } μ p β p + β E .
Combining (A) and (B) and using Parseval identity, we finally obtain the following error estimation.
Theorem 2.
Assume that P μ ( x ) is the convolution kernel of order ( α , β ) , 0 < α β . If the regularized solution given in (11) with noisy data g δ ( x ) satisfies (10) and (12) and μ = ( δ E ) p + β p β + α ( p + β ) which is selected to be a regularization parameter, then we have
f μ δ ( x ) f ( x ) C 1 δ p β p β + α ( p + β ) E α ( p + β ) p β + α ( p + β ) ,
where C 1 , α , β , p > 0 are constants and 0 < α β .
Proof. 
From the Parseval identity and the triangle inequality, we obtain
f μ δ ( x ) f ( x ) = f ^ μ δ ( ξ ) f ^ ( ξ ) f ^ μ δ ( ξ ) f ^ μ ( ξ ) + f ^ μ ( ξ ) f ^ ( ξ ) .
Combining (13)–(15), we know
f μ δ ( x ) f ( x ) 2 a 1 ( 1 + b 2 μ α ) δ + max { 1 , b 1 } μ p β p + β E 2 a 1 δ + ( 2 a 1 b 2 + max { 1 , b 1 } ) E α ( p + β ) p β + α ( p + β ) δ p β p β + α ( p + β ) .
Set C 1 = 2 a 1 b 2 + max { 1 , b 1 } , when δ is sufficiently small, the estimate is satisfied. The proof of Theorem 2 is completed. □

4. The New Discrepancy Principle

In this section, we will discuss an a posteriori choice rule for the regularization parameter. We recall the definition of Morozov’s discrepancy principle for our case, which is to find μ such that
K ^ f ^ μ δ ( ξ ) g ^ δ ( ξ ) = τ δ ,
where τ > 2 (large enough) is a fixed constant.
However, in the convoluting equation method, by the Morozov’s discrepancy principle, we obtain
τ δ = K ^ f ^ μ δ ( ξ ) g ^ δ ( ξ ) K ^ f ^ μ δ ( ξ ) K ^ f ^ μ ( ξ ) + K ^ f ^ μ ( ξ ) g ^ ( ξ ) + g ^ ( ξ ) g ^ δ ( ξ ) δ sup ξ R 1 e T | l ( ξ ) | | l ( ξ ) | P ^ μ ( ξ ) | l ( ξ ) | 1 e T P ^ μ ( ξ ) | l ( ξ ) | + K ^ f ^ μ ( ξ ) K ^ f ^ ( ξ ) + δ .
Let A ( ξ ) = 1 e T | l ( ξ ) | | l ( ξ ) | P ^ μ ( ξ ) | l ( ξ ) | 1 e T P ^ μ ( ξ ) | l ( ξ ) | , B ( ξ ) = P ^ μ ( ξ ) | l ( ξ ) | 1 e T P ^ μ ( ξ ) | l ( ξ ) | . Setting s = P ^ μ ( ξ ) | l ( ξ ) | , due to ( K 1 ) , we have 0 < s | l ( ξ ) | . Thus, B ( ξ ) can be rewritten as B ( s ) : = s 1 e T s , it is straightforward that B ( s ) is a strictly increasing function. Then, we can obtain
B ( s ) B ( | l ( ξ ) | ) = | l ( ξ ) | 1 e T | l ( ξ ) | .
So
A ( ξ ) = 1 e T | l ( ξ ) | | l ( ξ ) | B ( ξ ) 1 .
According to (16), (14) and Lemma 2, we obtain
τ δ 2 δ + 2 T max { 1 , b 1 } μ p β p + β E ,
thus we merely obtain μ C 2 δ p + β p β , where C 2 = ( τ 2 2 E T max { 1 , b 1 } ) p + β p β .
From (13), we know
f μ δ ( x ) f μ ( x ) 2 a 1 ( 1 + b 2 μ α ) δ 2 a 1 δ + 2 a 1 b 2 C 2 α δ p β α ( p + β ) p β .
When δ 0 , we do not know whether the right hand side of (17) tends to 0. If p β > α ( p + β ) , the above inequality tends to 0 as δ 0 . If p β α ( p + β ) , the above inequality does not tend to 0 as δ 0 . Thus, Morozov’s discrepancy principle does not work here.
In this article, we introduce a new generalized discrepancy principle as follows:
μ D = sup { μ > 0 K ^ f ^ μ δ ( ξ ) g ^ δ ( ξ ) τ h ( δ ) } ,
where the constant τ > 2 (large enough), h ( δ ) = ( log 1 δ ) σ β α , σ ( 0 , 1 ) , which satisfies h ( δ ) δ when δ is sufficiently small. Before we proceed to the actual estimation, we need to guarantee the existence of the parameter μ for (18). Because lim μ 0 P ^ μ ( ξ ) = 1 , then lim μ 0 K ^ f ^ μ δ ( ξ ) g ^ δ ( ξ ) = g ^ δ ( ξ ) g ^ δ ( ξ ) = 0 < τ h ( δ ) . Therefore, μ D always exists whether it is a finite positive number or infinity.
If μ D = + , we have lim μ + P ^ μ ( ξ ) = 0 . Furthermore, there is
lim μ + K ^ f ^ μ δ ( ξ ) g ^ δ ( ξ ) = K ^ g ^ δ ( ξ ) g ^ δ ( ξ ) τ h ( δ ) .
For this case, we define f ^ μ D δ ( ξ ) = g ^ δ ( ξ ) so that it always satisfies (19) in regard to whether μ D is finite or not.
In the following, we will seek to bound μ from below by using the new discrepancy principle.
Lemma 3.
If P μ ( x ) is a regularization kernel of order ( α , β ) , and the a priori condition (12) holds, then we can have
K ^ f ^ μ ( ξ ) g ^ ( ξ ) C 3 μ p β p + β ,
where C 3 = 2 T max { 1 , b 1 } is a constant.
Proof. 
From the former definition in Section 2, then we know
K ^ f ^ μ ( ξ ) g ^ ( ξ ) = 1 e T l ( ξ ) l ( ξ ) P ^ μ ( ξ ) l ( ξ ) 1 e T P ^ μ ( ξ ) l ( ξ ) g ^ ( ξ ) g ^ ( ξ ) = ( 1 P ^ μ ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ ( ξ ) l ( ξ ) ) 1 e T l ( ξ ) l ( ξ ) f ^ ( ξ ) ( 1 + ξ 2 ) p 2 ( 1 + ξ 2 ) p 2 sup ξ R | ( 1 P ^ μ ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ ( ξ ) l ( ξ ) ) 1 e T l ( ξ ) l ( ξ ) ( 1 + ξ 2 ) p 2 | ( 1 + ξ 2 ) p 2 f ^ ( ξ ) E sup ξ R | D ( ξ ) 1 e T l ( ξ ) l ( ξ ) | .
According to Lemma 2 and (B), we have
K ^ f ^ μ ( ξ ) g ^ ( ξ ) 2 T E max { 1 , b 1 } μ p β p + β .
Lemma 4.
Assume μ D is chosen by the generalized discrepancy principle (18), and the a priori condition (12) holds. Therefore, we can obtain
μ D ( ( τ 2 ) h ( δ ) C 3 2 p β p + β ) p + β p β .
Proof. 
If μ D = + , we do not need to prove it because the conclusion is obvious. Thus, from (11) and (7), we deduce that when μ D < + .
By using the new generalized discrepancy principle (18), we have
τ h ( δ ) < K ^ f ^ 2 μ D δ ( ξ ) g ^ δ ( ξ ) K ^ f ^ 2 μ D δ ( ξ ) K ^ f ^ 2 μ D ( ξ ) + K ^ f ^ 2 μ D ( ξ ) g ^ ( ξ ) + g ^ ( ξ ) g ^ δ ( ξ ) 1 e T l ( ξ ) l ( ξ ) P ^ 2 μ D ( ξ ) l ( ξ ) 1 e T P ^ 2 μ D ( ξ ) l ( ξ ) ( g ^ δ ( ξ ) g ^ ( ξ ) ) + δ + K ^ f ^ 2 μ D ( ξ ) g ^ ( ξ ) .
Similar to the proof of (16), and by Lemma 3, we have
τ h ( δ ) 2 δ + C 3 ( 2 μ D ) p β p + β 2 h ( δ ) + C 3 ( 2 μ D ) p β p + β .
So, we can obtain
μ D ( ( τ 2 ) h ( δ ) C 3 2 p β p + β ) p + β p β .
Then, we finish the proof. □
Theorem 3.
Suppose that P μ ( x ) is a regularization kernel of order ( α , β ) ; the a priori bound (12) and the noise assumption (10) hold, and there exists δ ¯ > 0 such that for 0 < δ δ ¯ 1 . If we choose μ D as the regularization parameter according to the new discrepancy parameter choice (18), then we have
f μ δ ( x ) f ( x ) C 6 ( log 1 δ ) p β p β + α ( p + β ) .
Proof. 
We will separate the proof into two cases here.
Case I. μ D = + . Due to (19) and Lemma 2, we have
K ^ g ^ ( ξ ) g ^ ( ξ ) = K ^ ( g ^ ( ξ ) g ^ δ ( ξ ) ) + K ^ g ^ δ ( ξ ) g ^ δ ( ξ ) + g ^ δ ( ξ ) g ^ ( ξ ) 2 T δ + δ + τ h ( δ ) ( 2 T + τ + 1 ) h ( δ ) .
Using (13), (14), (20) and Parseval formula for any constant μ 0 > 0 , we can obtain
f μ D δ ( x ) f ( x ) = f ^ μ D δ ( ξ ) f ^ ( ξ ) = g ^ δ ( ξ ) f ^ ( ξ ) δ + g ^ ( ξ ) f ^ ( ξ ) δ + ( 1 1 e T l ( ξ ) l ( ξ ) ) f ^ ( ξ ) δ + ( 1 1 e T l ( ξ ) l ( ξ ) ) ( f ^ ( ξ ) f ^ μ 0 ( ξ ) ) + ( 1 1 e T l ( ξ ) l ( ξ ) ) f ^ μ 0 ( ξ ) δ + ( 1 + 2 T ) f ^ ( ξ ) f ^ μ 0 ( ξ ) + ( 1 1 e T l ( ξ ) l ( ξ ) ) P ^ μ 0 ( ξ ) l ( ξ ) 1 e T P ^ μ 0 ( ξ ) l ( ξ ) g ^ ( ξ ) δ + ( 1 + 2 T ) f ^ ( ξ ) f ^ μ 0 ( ξ ) + sup ξ R | P ^ μ 0 ( ξ ) l ( ξ ) 1 e T P ^ μ 0 ( ξ ) l ( ξ ) | ( 1 1 e T l ( ξ ) l ( ξ ) ) g ^ ( ξ ) δ + ( 1 + 2 T ) f ^ ( ξ ) f ^ μ 0 ( ξ ) + 2 a 1 ( 1 + b 2 μ 0 α ) K ^ g ^ ( ξ ) g ^ ( ξ ) δ + ( 1 + 2 T ) E max { 1 , b 1 } μ 0 p β p + β + 2 a 1 ( 1 + b 2 μ 0 α ) ( 2 T + τ + 1 ) h ( δ ) .
Case II. μ D < + . By using the new generalized discrepancy principle (18) and Lemma 4, we can obtain
K ^ f ^ μ D ( ξ ) g ^ ( ξ ) = ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) g ^ ( ξ ) ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) ( g ^ ( ξ ) g ^ δ ( ξ ) ) + ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) g ^ δ ( ξ ) δ sup ξ R ( 1 + | P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) | ) + τ h ( δ ) 2 δ + τ h ( δ ) ( τ + 2 ) h ( δ ) .
From (6), we obtain
f μ D δ ( x ) f ( x ) = f ^ μ D δ ( ξ ) f ^ ( ξ ) f ^ μ D δ ( ξ ) f ^ μ D ( ξ ) + f ^ μ D ( ξ ) f ^ ( ξ ) 2 a 1 ( 1 + b 2 μ D α ) δ + ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) f ^ ( ξ ) .
Similar to the above, for any constant μ 0 > 0 , we have
( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) f ^ ( ξ ) ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) ( f ^ ( ξ ) f ^ μ 0 ( ξ ) ) + ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) f ^ μ 0 ( ξ ) 2 f ^ ( ξ ) f ^ μ 0 ( ξ ) + ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) P ^ μ 0 ( ξ ) l ( ξ ) 1 e T P ^ μ 0 ( ξ ) l ( ξ ) g ^ ( ξ ) 2 f ^ ( ξ ) f ^ μ 0 ( ξ ) + 2 a 1 ( 1 + b 2 μ 0 α ) ( 1 P ^ μ D ( ξ ) ( 1 e T l ( ξ ) ) 1 e T P ^ μ D ( ξ ) l ( ξ ) ) g ^ ( ξ ) .
Substituting (22) and (24) into (23), we can obtain
f μ D δ ( x ) f ( x ) 2 a 1 [ 1 + b 2 ( ( τ 2 ) h ( δ ) C 3 2 p β p + β ) α ( p + β ) p β ] δ + E max { 1 , b 1 } μ 0 p β p + β + 2 a 1 ( 1 + b 2 μ 0 α ) ( τ + 2 ) h ( δ ) .
In both (21) and (25), choosing μ 0 = ( h ( δ ) ) p + β p β + α ( p + β ) , if the δ is sufficiently small, we can obtain
f μ D δ ( x ) f ( x ) 2 a 1 [ 1 + C 4 h ( δ ) α ( p + β ) p β ] δ + C 5 μ 0 p β p + β + 2 a 1 ( τ + 2 ) ( 1 + b 2 μ 0 α ) h ( δ ) 2 a 1 [ 1 + C 4 ( log δ ) σ ( p + β ) p ] δ + 2 a 1 ( τ + 2 ) h ( δ ) + C 5 h ( δ ) p β p β + α ( p + β ) + 2 a 1 b 2 ( τ + 2 ) h ( δ ) p β p β + α ( p + β ) C 6 ( log 1 δ ) σ p β 2 α ( p β + α p + α β ) .
If we choose σ = α β , then we have
f μ D δ ( x ) f ( x ) C 6 ( log 1 δ ) p β p β + α ( p + β ) .
Remark 2.
Under the a priori parameter choice rule, our convergence rate is Hölder type. However, it is not optimal that we obtain a log-type convergence rate by using the new discrepancy principle. As is known to all, the Hölder type error estimate is better than the log type. Thus, we are open to considering a better a posteriori regularization parameter choice rule.

5. Numerical Experiments

In the section, two numerical experiments are provided to demonstrate the validity of our discussion.
The convolution kernels used in our calculation are
P 1 : P ^ μ ( ξ ) = 1 1 + μ β | ξ | β ;
P 2 : P ^ μ ( ξ ) = e ( μ | ξ | ) β ;
P 3 : P ^ μ ( ξ ) = χ [ 1 μ , 1 μ ] ( ξ ) .
The numerical examples were constructed in the following way: we first give the exact source term f ( x ) . Furthermore, by using (7) and (8), the exact data function g ( x ) can be obtained. Then, the noisy data g δ ( x ) is generated by the formula g δ = g + ϵ · r a n d n ( s i z e ( g ) ) , where
g = ( g ( x 0 ) , , g ( x N ) ) T , x i = i h , h = T N , i = 0 , 1 , , N .
The function “ r a n d n ( · ) ” generates arrays of random numbers whose elements are normally distributed with mean 0, variance σ 2 = 1 , and standard deviation σ = 1 , and ϵ indicates a relative noise level, which can be measured in the sense of the Root Mean Square Error (RMSE) according to
δ = g δ g l 2 = ( 1 N i = 1 N ( g i g i δ ) 2 ) 1 2 .
In the following examples, we use T = 1 , τ = 2.1 , N = 50 .
Example 1.
We consider the heat source problem
u t ( x , t ) = u x x ( x , t ) 3 u ( x , t ) + f ( x ) , x R , t > 0 , u ( x , 0 ) = 0 , x R , u ( x , T ) = g ( x ) , x R .
which corresponds to l ( ξ ) = ξ 2 + 3 and α = 2 .
Set f ( x ) = ( x 3 4 3 2 x ) e x 2 4 in the forward problem (26) and the exact data g ( x ) is obtained by (7). It is easy to calculate by numerical method that f ( x ) 2 2.54 . Thus, we select the a priori bound E = 3 and p = 2 as a source condition. The numerical results are demonstrated in Figure 1, Figure 2, Figure 3, Figure 4, Figure 5 and Figure 6.
In Figure 1, Figure 2 and Figure 3, by using the kernel P 1 , P 2 and P 3 , the numerical results for convolution method under the a priori parameter choice rule for various noise levels ϵ = 0.001 , 0.005, 0.01 in case of β = 4 , 6 are showed with μ = 0.2102 , 0.2093 , 0.2058 for β = 4 , 6 .
In Figure 4, Figure 5 and Figure 6, by using the kernel P 1 , P 2 and P 3 , the numerical results for convolution method under the a posteriori parameter choice rule for various noise levels ϵ = 0.001 , 0.005, 0.01 in case of β = 4 , 6 are showed with μ = 0.5888 , 0.2344 , 0.5936 for β = 4 , 6 .
Example 2.
We test the space-fractional diffusion heat source problem.
u t = x D θ α u + f ( x ) , x R , t > 0 , u ( x , 0 ) = 0 , x R , u ( x , T ) = g ( x ) , x R .
In our experiments, we take α = 0.5 , 1 and θ = 0.1 min { α , 2 α } . Let the source be
f ( x ) 20 exp ( 1 x 2 / 64 1 ) sin ( x / 2 + 0.3 ) , | x | < 8 , 0 , | x | 8 .
For this example, f ( x ) 2 20.42 , so we can choose the a priori bound E = 21 . The numerical results are showed as follows.
The numerical results by using the kernel P 1 ( β = 2 ) , P 2 ( β = 2 ) and the kernel P 3 with ϵ = 0.01 are shown in Figure 7 and Figure 8. We know that two parameter choice rules provide accurate numerical approximations.

6. Conclusions

In this article, a convoluting equation method is applied to determine the unknown heat source term. Furthermore, we come up with a new generalized discrepancy principle to choose the regularization parameter. The obtained results demonstrate the reliability of the proposed technique and its wider applicability to the fractional evolution equation.

Author Contributions

Conceptualization, Z.L.; Data curation, Q.C.; Formal analysis, Z.L.; Funding acquisition, X.X.; Investigation, Q.C.; Methodology, Z.L.; Project administration, X.X.; Resources, X.X.; Software, X.X.; Validation, Q.C.; Writing—original draft, Z.L.; Writing—review & editing, X.X. All authors have read and agreed to the published version of the manuscript.

Funding

The work is supported by the National Natural Science Foundation of China (No. 11661072) and the Natural Science Foundation of Northwest Normal University (No. NWNU-LKQN-17-5).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Cannon, J.R.; Duchateau, P. Structural identification of an unknown source term in a heat equation. Inverse Probl. 1998, 14, 535–551. [Google Scholar] [CrossRef]
  2. Farcas, A.; Lesnic, D. The boundary-element method for the determination of a heat source dependent on one variable. J. Eng. Math. 2006, 54, 375–388. [Google Scholar] [CrossRef]
  3. Li, G.S. Data compatibility and conditional stability for an inverse source problem in the heat equation. Appl. Math. Comput. 2006, 173, 566–581. [Google Scholar] [CrossRef]
  4. Liu, F.B. A modified genetic algorithm for solving the inverse heat transfer problem of estimating plan heat source. Int. J. Heat Mass Transf. 2008, 51, 3745–3752. [Google Scholar] [CrossRef]
  5. Liu, C.H. A two-stage LGSM to identify time-dependent heat source through an internal measurement of temperature. Int. J. Heat Mass Transf. 2009, 52, 1635–1642. [Google Scholar] [CrossRef]
  6. Ahmadabadi, M.N.; Arab, M.; Ghaini, F.M.M. The method of fundamental solutions for the inverse space-dependent heat source problem. Eng. Anal. Bound. Elem. 2009, 33, 1231–1235. [Google Scholar] [CrossRef]
  7. Yan, L.; Yang, F.L.; Fu, C.L. A meshless method for solving an inverse spacewise-dependent heat source problem. J. Comput. Phys. 2009, 228, 123–136. [Google Scholar] [CrossRef]
  8. Yamamoto, M. Conditional stability in determination of force terms of heat equations in a rectangle. Math. Comput. Model. 1993, 18, 79–88. [Google Scholar] [CrossRef]
  9. Hasanov, A.; Pektas, B. Identification of an unknown time-dependent heat source term from overspecified Dirichlet boundary data by conjugate gradient method. Comput. Math. Appl. 2013, 65, 42–57. [Google Scholar] [CrossRef]
  10. 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]
  11. Yang, F.; Fu, C.L.; Li, X.-X. A mollification regularization method for identifying the time-dependent heat source problem. J. Eng. Math. 2016, 100, 67–80. [Google Scholar] [CrossRef]
  12. Cannon, J.R.; Estevz, S.P. An inverse problem for the heat equation. Inverse Probl. 1986, 2, 395–403. [Google Scholar] [CrossRef]
  13. Choulli, M.; Yamamoto, M. Conditional stability in determining a heat source. J. Inverse Ill-Posed Probl. 2004, 12, 233–243. [Google Scholar] [CrossRef]
  14. Gongsheng, L.; Yamamoto, M. Stability analysis for determining a source term in a 1-D advection-dispersion equation. J. Inverse Ill-Posed Probl. 2006, 14, 147–155. [Google Scholar] [CrossRef]
  15. Cheng, J.; Liu, J.J. An inverse source problem for parabolic equations with local measurements. Appl. Math. Lett. 2020, 103, 106213. [Google Scholar] [CrossRef]
  16. Wei, H.; Chen, W.; Sun, H.G.; Li, X.C. A coupled method for inverse source problem of spatial fractional anomalous diffusion equations. Inverse Probl. Sci. Eng. 2010, 18, 945–956. [Google Scholar] [CrossRef]
  17. Mierzwiczak, M.; Kolodziej, J.A. Application of the method of fundamental solutions and radial basis functions for inverse transient heat source problem. Comput. Phys. Commun. 2010, 181, 2035–2043. [Google Scholar] [CrossRef]
  18. Rashedi, K.; Sarraf, A. Heat source identification of some parabolic equations based on the method of fundamental solutions. Eur. Phys. J. Plus 2018, 133, 403. [Google Scholar] [CrossRef]
  19. Sun, L.L.; Wei, T. Identification of the zeroth-order coefficient in a time fractional diffusion equation. Appl. Numer. Math. 2017, 111, 160–180. [Google Scholar] [CrossRef]
  20. Johansson, B.T.; Lesnic, D. A variational method for identifying a spacewise-dependent heat source. IMA J. Appl. Math. 2007, 72, 748–760. [Google Scholar] [CrossRef]
  21. Ma, Y.J.; Fu, C.L.; Zhang, Y.X. Identification of an unknown source depending on both time and space variables by a variational method. Appl. Math. Model. 2012, 36, 5080–5090. [Google Scholar] [CrossRef]
  22. Wang, F.; Chen, W.; Ling, L. Combinations of the method of fundamental solutions for general inverse source identification problems. Appl. Math. Comput. 2012, 219, 1173–1182. [Google Scholar] [CrossRef]
  23. Mierzwiczak, M.; Kolodziej, J.A. Application of the method of fundamental solutions with the Laplace transformation for the inverse transient heat source problem. J. Theor. Appl. Mech. 2012, 50, 1011–1023. [Google Scholar]
  24. Wang, J.G.; Zhou, Y.B.; Wei, T. Two regularization methods to identify a space-dependent source for the time-fractional diffusion equation. Appl. Numer. Math. 2013, 68, 39–57. [Google Scholar] [CrossRef]
  25. Dou, F.F.; Fu, C.L.; Yang, F.L. Optimal error bound and Fourier regularization for identifying an unknown source in the heat equation. J. Comput. Appl. Math. 2009, 230, 728–737. [Google Scholar] [CrossRef] [Green Version]
  26. Dou, F.F.; Fu, C.L. Determining an unknown source in the heat equation by a wavelet dual least squares method. Appl. Math. Lett. 2009, 22, 661–667. [Google Scholar] [CrossRef] [Green Version]
  27. Xiong, X.T.; Wang, J.X. A Tikhonov-type method for solving a multidimensional inverse heat source problem in an unbounded domain. J. Comput. Appl. Math. 2012, 236, 1766–1774. [Google Scholar] [CrossRef] [Green Version]
  28. Thang, N.V.; Duc, N.V.; Minh, L.D.N.; Thành, N.T. Identifying an unknown source term in a time-space fractional parabolic equation. Appl. Numer. Math. 2021, 166, 313–332. [Google Scholar] [CrossRef]
  29. Ma, Y.K.; Prakash, P.; Deiveegan, A. Optimization method for determining the source term in fractional diffusion equation. Math. Comput. Simul. 2019, 155, 168–176. [Google Scholar] [CrossRef]
  30. Hussein, M.S.; Lesnic, D.; Johansson, B.T.; Hazanee, A. Identification of a multi-dimensional space-dependent heat source from boundary data. Appl. Math. Model. 2018, 54, 202–220. [Google Scholar] [CrossRef] [Green Version]
  31. Yang, F.; Pu, Q.; Li, X.X. The fractional Landweber method for identifying the space source term problem for time-space fractional diffusion equation. Numer. Algorithms 2021, 87, 1229–1255. [Google Scholar] [CrossRef]
  32. Cannon, J.R.; Van der Hoek, J. An implicit finite difference scheme for the diffusion equation subject to the specification of mass in a portion of the domain. In Numerical Solutions of Partial Differential Equations; Noye, J., Ed.; North-Holland Publishing: Amsterdam, The Netherlands, 1982; pp. 527–539. [Google Scholar]
  33. Li, Y.S.; Wei, T. An inverse time-dependent source problem for a timeCspace fractional diffusion equation. Appl. Math. Comput. 2018, 336, 257–271. [Google Scholar]
  34. Johansson, B.T.; Lesnic, D. A procedure for determining a spacewise dependent heat source and the initial temperature. Appl. Anal. 2008, 87, 265–276. [Google Scholar] [CrossRef]
  35. Yang, C.Y. A sequential method to estimate the strength of the heat source based on symbolic computation. Int. J. Heat Mass Transf. 1998, 41, 2245–2252. [Google Scholar] [CrossRef]
  36. Zheng, G.H.; Wei, T. Two regularization methods for solving a Riesz-Feller space-fractional backward diffusion problem. Inverse Probl. 2010, 26, 115017. [Google Scholar] [CrossRef]
  37. Shi, C.; Wang, C.; Wei, T. Convolution regularization method for backward problems of linear parabolic equations. Appl. Numer. Math. 2016, 108, 143–156. [Google Scholar] [CrossRef]
  38. Shi, C.; Wang, C.; Zheng, G.; Wei, T. A new a posteriori parameter choice strategy for the convolution regularization of the space-fractional backward diffusion problem. J. Comput. Appl. Math. 2015, 279, 233–248. [Google Scholar] [CrossRef]
  39. Mainardi, F.; Raberto, M.; Gorenflo, R.; Scalas, E. Fractional calculus and continuous-time finance II: The waiting-time distribution. Physica A 2000, 287, 468–481. [Google Scholar] [CrossRef] [Green Version]
Figure 1. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 1 under the a priori choice rule for Example 1.
Figure 1. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 1 under the a priori choice rule for Example 1.
Mathematics 10 02191 g001
Figure 2. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 2 under the a priori choice rule for Example 1.
Figure 2. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 2 under the a priori choice rule for Example 1.
Mathematics 10 02191 g002
Figure 3. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 3 under the a priori choice rule for Example 1.
Figure 3. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 3 under the a priori choice rule for Example 1.
Mathematics 10 02191 g003
Figure 4. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 1 under the a posteriori choice rule for Example 1.
Figure 4. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 1 under the a posteriori choice rule for Example 1.
Mathematics 10 02191 g004
Figure 5. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 2 under the a posteriori choice rule for Example 1.
Figure 5. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 2 under the a posteriori choice rule for Example 1.
Mathematics 10 02191 g005
Figure 6. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 3 under the a posteriori choice rule for Example 1.
Figure 6. The exact solution and the regularized solutions with β = 4 , 6 using kernel P 3 under the a posteriori choice rule for Example 1.
Mathematics 10 02191 g006
Figure 7. The exact solution and the regularized solutions of Example 2 for α = 0.5 under the a priori parameter choice and the a posteriori parameter choice.
Figure 7. The exact solution and the regularized solutions of Example 2 for α = 0.5 under the a priori parameter choice and the a posteriori parameter choice.
Mathematics 10 02191 g007aMathematics 10 02191 g007b
Figure 8. The exact solution and the regularized solutions of Example 2 for α = 1 under the a priori parameter choice and the a posteriori parameter choice.
Figure 8. The exact solution and the regularized solutions of Example 2 for α = 1 under the a priori parameter choice and the a posteriori parameter choice.
Mathematics 10 02191 g008
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Li, Z.; Xiong, X.; Cheng, Q. Identifying the Unknown Source in Linear Parabolic Equation by a Convoluting Equation Method. Mathematics 2022, 10, 2191. https://doi.org/10.3390/math10132191

AMA Style

Li Z, Xiong X, Cheng Q. Identifying the Unknown Source in Linear Parabolic Equation by a Convoluting Equation Method. Mathematics. 2022; 10(13):2191. https://doi.org/10.3390/math10132191

Chicago/Turabian Style

Li, Zhenping, Xiangtuan Xiong, and Qiang Cheng. 2022. "Identifying the Unknown Source in Linear Parabolic Equation by a Convoluting Equation Method" Mathematics 10, no. 13: 2191. https://doi.org/10.3390/math10132191

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