Abstract
In this paper, we consider a two-dimensional (2D) time-fractional inverse diffusion problem which is severely ill-posed; i.e., the solution (if it exists) does not depend continuously on the data. A modified kernel method is presented for approximating the solution of this problem, and the convergence estimates are obtained based on both a priori choice and a posteriori choice of regularization parameters. The numerical examples illustrate the behavior of the proposed method.
1. Introduction
In the past decades, fractional differential equations have attracted wide attention. Various models using fractional partial differential equations have been successfully applied to describe a range of problems in mechanical engineering [1], viscoelasticity [2], electron transport [3], dissipation [4], heat conduction [5, 6], and high-frequency financial data [7].
The time-fractional diffusion equation is deduced by replacing the standard time derivative with a time-fractional derivative and can be used to describe the superdiffusion and subdiffusion phenomena [8–13]. The direct problems, i.e., initial value problems and initial boundary value problems, for the time-fractional diffusion equation have been studied extensively in recent years. For instance, a well-posedness analysis [14–18] and numerical methods and simulations [19–24] are typical examples of this kind of analysis.
However, in some practical situations, part of boundary data, or initial data, or diffusion coefficient, or source term, or the order of fractional derivative may not be given and we want to find them by additional measured data which will yield some inverse problems of the fractional diffusion equation. The early papers on inverse problems of time-fractional diffusion equation were provided by Murio in [25, 26] for solving the time-fractional diffusion equation by mollification methods. Cheng et al. [27] gave the uniqueness in determining the parameter α and by means of observation data at one end point. Liu and Yamamoto [28] considered a backward problem in time for a time-fractional partial diffusion equation in one-dimensional case. Zhang and Xu [29] studied an inverse source problem in the time-fractional diffusion equation and proved uniqueness for identifying a space-dependent source term by using analytic continuation and Laplace transform. Zheng and Wei [30] applied a new regularization method to solve an inverse problem for a time-fractional diffusion equation in a one-dimensional semi-infinite domain. Jin and Rundell [31] studied an inverse problem of recovering a spatially varying potential term in the 1D time-fractional diffusion equation from the flux measurements and proposed a quasi-Newton-type reconstruction algorithm. Recently, Wei and Wang [32] proposed a modified quasi-boundary value method for an inverse source problem of the time-fractional diffusion equation. Wei et al. [33] identified a time-dependent source term in a multidimensional time-fractional diffusion equation from boundary Cauchy data.
As for time-fractional inverse diffusion problem for one-dimensional (1D) models, theoretical concepts and computational implementation have been discussed by many authors, and a number of solution methods have been proposed, i.e., spectral regularization method [34], iteration regularization method [35], optimal regularization method [36], and a new dynamic method [37]. However, for the two-dimensional time-fractional inverse diffusion problem, few results are available. Xiong et al. [38] gave a conditional stability estimate for the inverse heat conduction problem in the 2D time-fractional heat equation and studied a dynamic spectral regularization method with numerical testification. However, error estimates were given in [38] by only choosing the regularization parameter by a priori choice rule.
In the present paper, we will consider the 2D time-fractional inverse diffusion problem by using a modified kernel method and a posteriori parameter choice rule is given. For a priori choice and a posteriori choice of the regularization parameter, we obtain the convergence estimates, respectively.
The rest of this paper is organized as follows. In Section 2, we describe the 2D time-fractional inverse diffusion problem and give an analysis on the ill-posedness of this problem. In Section 3, we propose a modified kernel method and prove the convergence estimates under a priori and a posteriori parameter choice rule, respectively. Section 4 is the numerical aspect of the proposed method. Finally, we give a brief conclusion in Section 5.
2. Description of the 2D Time-Fractional Inverse Diffusion Problem
We consider the following 2D time-fractional inverse diffusion problem:with the corresponding measured data function and initial and boundary conditionswhere the time-fractional derivative is the Caputo fractional derivative of order defined by (see [39])
Here, we wish to determine the temperature for from the temperature measurements .
In order to apply the Fourier transform techniques, we extend the functions , , and to the whole plane and by setting the functions to be zero for or . We assume that these functions are in and use the corresponding -norm, defined as follows:
We also assume that the measured data function satisfieswhere the constant represents a bound on the measurement error.
Letbe the Fourier transform of a function . Taking the transform to equations (1)–(6) with respect to y and t, we can get the solution of equations (1)–(6) in the frequency domain (see [38]):where
Denote γ as follows:where
For the above problem, since is unbounded with respect to variables ξ and η for fixed , the small error in the high-frequency components will be amplified. Therefore, the 2D time-fractional inverse diffusion problem is severely ill-posed. To solve the 2D time-fractional inverse diffusion problem, a natural way to stabilize the problem is eliminate the high frequencies or to replace the “kernel” by a bounded approximation.
3. A Modified Method and Convergence Estimates
In this section, we will give a modified “kernel” method and obtain the convergence estimates. The regularization solution is given bywherewhere is the regularization parameter.
To obtain the convergence estimates between the regularization solution and the exact solution, we need to assume a priori bound:where is a constant and denotes the norm in Sobolov space defined by
Remark 1. Obviously, when , we can know that and formula (17) is bounded in the -norm.
3.1. A Priori Parameter Choice
In the following, we give the convergence estimate for by using a priori choice rule for the regularization parameter.
Theorem 1. Suppose that is the regularization solution with noisy data and that is the exact solution with the exact data . Let assumption (9) be satisfied and let . If we choosethen for every , we obtain the error estimate
Proof. Due to Parseval’s identity and triangle inequality, we can obtainFor , we haveFrom (11), we knowWe now estimate ; note that from (23),LetDifferentiating and setting the derivative equal to zero, we find thatis the maximum value point of the function . Therefore, we knowCombining (19), (21), (22), and (27), we have the Hölder-type error estimate (20).
Remark 2. The error estimate in Theorem 1 does not give any useful information on the continuous dependence of the solution at . To retain the continuous dependence of the solution at , one has to introduce a stronger a priori assumption.
Theorem 2. Suppose that is the regularization solution with noisy data and that is the exact solution with the exact data at . Let assumption (9) be satisfied and let . If we choosethen for , we obtain the error estimate
Proof. Due to Parseval’s identity and the triangle inequality, we havewhereUsing the fact , we can getNote that also and we have ; therefore, we can deriveIf we know thati.e., . Therefore,If , we havei.e., . Therefore,Combining (32), (36), and (38), we can obtainCombining (28), (30), (31), and (39), we can obtain
3.2. A Posteriori Parameter Choice
In this section, we first give the following lemma.
Lemma 1 (see [40]). Let the function be given bywith a constant and positive constants , b, and d; then, for the inverse function, we haveIn this following, we give the convergence estimate for by using a posteriori choice rule for the regularization parameter, i.e., Morozov’s discrepancy principle.
According to Morozov’s discrepancy principle [41], we adopt the regularization parameter β as the solution of the following equation:where is a constant. Denote
Here and in the following, β is a function of the variable x and sometimes the function is also used.
Lemma 2. Let , and then, the following results hold:(a) is a continuous function(b)(c)(d) is a strictly decreasing function for The proof is obvious, and we omit it here.
Remark 3. According to Lemma 2, we find that, if , equation (43) has a unique solution.
Lemma 3. If is the solution of equation (43), then the following inequality holds
Proof. Due to the triangle inequality and (43), note that , and we obtainWe now estimate the second term on the right hand side of (46):Similar to the proof of Theorem 2, we can knowCombining (46) and (48), we obtainLet . From Lemma 1, we haveLet For and , the function is strictly decreasing monotonically with β, so we have
Lemma 4. If is the solution of equation (43), then the following inequality holds:
Proof. Using the triangle inequality and (43), we have
Theorem 3. Assume that conditions (9) and (17) hold and taking the solution of equation (43) as the regularization parameter, then there holds the following error estimate:where , .
Proof. Due to the Parseval formula and the triangle inequality, we obtainFrom Lemma 3, we can know thatIn the following, we estimate the second term of (55). Denote and take ; we haveNote that , we getDenote , we haveSimilar to the proof of Theorem 2, we can know thatFor , from Lemma 4 and assuming that , we haveCombining (56)–(61) with (55), the proof of Theorem 3 is completed.
4. Numerical Aspect
In this section, we present two numerical examples intended to illustrate the behavior of the proposed method.
The numerical examples are constructed in the following way. First, we present the initial data of 2D time-fractional diffusion problem at and computed the function by solving a direct problem, which is a well-posed problem. Then, we added a random distributed perturbation to the data function obtaining vector , i.e.,wherewhere δ indicates the error level of , i.e.,
In numerical implementations, we give the data and sample at an equidistant grid in the domain with grid points. The function “” generates arrays of random numbers whose elements are normally distributed with mean 0, variance , and standard deviation ; “” returns an array of random entries which has the same size as . Let RMS denotes the mean square for a sampled function which is defined bywhere n is the total number of test points. Similarly, we can define the mean square error (RMSE) between the computed data and the exact data.
Finally, we solved the 2D time-fractional inverse diffusion problem by the modified method.
Example 1. We consider a smooth function
Example 2. Let . Consider a nonsmooth functionFigures 1–3 are the comparison of the exact solution and the approximation solution for with noise level at different points under a priori regularization parameter choice rule with Example 1. Figures 4–6 are the comparison of the exact solution and the approximation solution for with noise level at different points under a posteriori regularization parameter choice rule with Example 1.
Table 1 shows the comparison of RMSE of Example 1 for different x with . We find that the smaller the x is, the worse the computed approximation will be.
Table 2 shows the comparison of RMSE of Example 1 for different ε with at . The numerical error is decreasing as the level of noise becomes smaller.
Table 3 shows the comparison of RMSE of Example 1 for different α with at . The numerical accuracy is stable to the fractional order α.
Figure 7 is the comparison of the exact solution and the approximation solution for with noise level at under both a priori and a posteriori regularization parameter choice rule with Example 2.

(a)

(b)

(a)

(b)

(a)

(b)

(a)

(b)

(a)

(b)

(a)

(b)

(a)

(b)

(c)
5. Conclusion
In this paper, we propose a modified method to solve the time-fractional inverse diffusion problem in the two-dimensional setting. For the choice of regularization parameter, we give not only a priori but also a posteriori rules. Moreover, under both a priori rule and a posteriori rule, we prove the error estimates from the viewpoint of theoretical analysis.
The numerical examples are presented to illustrate the validity and effectiveness of the proposed method. In general, such that a priori condition (17) holds will not be known. But such a E has to be known if one wants to construct a priori parameter choice rule. We propose a posteriori parameter choice rule which is independent of E. So it is more implementable in practical application. Moreover, the numerical experiments show that a posteriori parameter choice rule also works well.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Authors’ Contributions
All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.
Acknowledgments
This work was partially supported by the National Natural Science Foundation of China (11871198), the Fundamental Research Funds for the Universities of Heilongjiang Province Heilongjiang University Special Project (RCYJTD201804), the National Science Foundation of Hebei Province (A2017501021), and the Fundamental Research Funds of the Central Universities (N182304024).