Next Article in Journal
A Hyper Heuristic Algorithm Based Genetic Programming for Steel Production Scheduling of Cyber-Physical System-ORIENTED
Previous Article in Journal
“Go Wild for a While!”: A New Test for Forecast Evaluation in Nested Models
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Posteriori Fractional Tikhonov Regularization Method for the Problem of Analytic Continuation

Department of Mathematics, Northwest Normal University, Lanzhou 730070, China
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(18), 2255; https://doi.org/10.3390/math9182255
Submission received: 14 July 2021 / Revised: 1 September 2021 / Accepted: 9 September 2021 / Published: 14 September 2021

Abstract

:
In this paper, the numerical analytic continuation problem is addressed and a fractional Tikhonov regularization method is proposed. The fractional Tikhonov regularization not only overcomes the difficulty of analyzing the ill-posedness of the continuation problem but also obtains a more accurate numerical result for the discontinuity of solution. This article mainly discusses the a posteriori parameter selection rules of the fractional Tikhonov regularization method, and an error estimate is given. Furthermore, numerical results show that the proposed method works effectively.

1. Introduction

The problem of analytic continuation arises in many fields [1,2,3]. For instance, medical imaging [4,5], the inversion of Laplace transform [6], inverse scattering problems [7], and so on. The analytical continuation problem is described as follows [8].
Problem 1.
Let
Ω * : = { z = x + i y C | x R , 0 < y a , a > 0 }
be the strip domain in complex plane C , where i is the imaginary unit and a is a positive constant. The function h ( z ) = h ( x + i y ) is an analytic function in Ω * . When y = 0 , h ( z ) | y = 0 = h ( x ) L 2 ( R ) . It is easy to show that the data h ( z ) are only given on the real axis, so we want extend h ( z ) analytically from these data to the whole domain Ω * and determine the value of function h ( z ) on Ω * by using data h ( x ) for 0 < y a .
Numerical analytic continuation is a severely ill-posed problem [9]. In order to calculate a stable numerical solution, a certain regularization technique is required. In [8], the authors used the modified Tikhonov regularization method to solve this problem. Recently, this problem has been studied by many researchers with different regularization methods [10,11,12,13]. In [14,15], the authors give an optimal filtering method and a wavelet method for stable analytic continuation, respectively. In [16], Xiong gives the conditional stability estimate for the analytical continuation problem and provides a generalized Tikhonov regularization method. Landweber-type iteration and modified Lavrentiev iterative regularization method are provided by Cheng and Xiong in [17,18]. In [19], the authors used fractional Landweber iterative regularization method to solve this problem, which greatly reduces the number of iteration steps.
In this study, in order to better reconstruct the characteristics of exact solutions, we propose a fractional Tikhonov regularization method to solve Problem 1. The fractional Tikhonov regularization method was first proposed by Klann [20], which is based on the classic Tikhonov regularization method; regarding the Tikhonov’s variational approach, we can refer to the work of A.N. Tikhonov et al. [21]. Related research on fractional regularization methods can refer to the literature [22,23,24,25,26,27,28,29]. The fractional Tikhonov method with the a priori parameter for the same analytic continuation problem has been researched by [30]. As far as we know, there are very few works related to the a posteriori fractional regularization methods, and most of the research on the fractional regularization methods are in the case of compact operators. However, the a priori regularization parameter selection method is based on the smoothness condition of the solution. Although it is convenient for theoretical analysis, it is difficult to verify. Therefore, in practical problems, the a posteriori regularization parameter selection method is more widely used based on the error level information and the error data themselves. Based on the above reasons, we will use the a posteriori fractional Tikhonov regularization method to study the analytical continuation problem mentioned at the beginning of the article. Let
h ^ ( ξ ) = 1 2 π e i x ξ h ( x ) d x , i = 1 ,
be the Fourier transform of the function h ( x ) L 2 ( R ) ; ξ R , the corresponding inverse Fourier transform of the function h ^ ( ξ ) , is given by
h ( x ) = 1 2 π e i x ξ h ^ ( ξ ) d ξ .
In this paper, · denotes the L 2 ( R ) norm; according to the Parseval formula, it has the following form:
h = ( | h ^ ( ξ ) | 2 d ξ ) 1 2 ,
According to the inverse Fourier transform, we have
h ( z ) = h ( x + i y ) = 1 2 π e i ( x + i y ) ξ h ^ ( ξ ) d ξ = 1 2 π e i x ξ e y ξ h ^ ( ξ ) d ξ .
For simplicity, we denote ω ( x , y ) = h ( x + i y ) . Therefore, we can easily obtain the solution to the problem in the frequency domain as follows:
ω ^ ( ξ , y ) = e y ξ h ^ ( ξ ) .
From (5), we know that the operator equation of the problem is as follows
K y ω ^ ( ξ , y ) = h ^ ( ξ ) .
where K y = e y ξ : L 2 ( R ) L 2 ( R ) is the self-adjoint multiplication operator.
Note the factor e y ξ + as ξ , given a small change in the data h ( ξ ) , the solution ω ^ ( ξ , y ) will have a huge change through the error factor e y ξ . It is easy to see the ill-posedness of Problem 1 is due to the negative high frequencies. Therefore, when ξ < 0 , it is impossible to stably solve the problem using classical methods, it needs to be regularized to calculate a stable numerical solution. We construct the regularization solution of Problem 1 in the frequency domain according to the fractional Tikhonov regularization method given in reference [29] as follows
ω ^ μ δ ( ξ , y ) = e y ξ 1 + μ e 2 γ y ξ h ^ δ ( ξ ) , 1 2 < γ 1 .
Compared with expression (5), the filter factor 1 1 + μ e 2 γ y ξ in (7) attenuates the high-frequency part of understanding, and we can use another better decay filter 1 1 + μ e 2 γ a ξ to replace the original one and we can get better convergence results. Therefore, we can obtain a new regularization solution
ω ^ μ δ ( ξ , y ) = e y ξ 1 + μ e 2 γ a ξ h ^ δ ( ξ ) , 1 2 < γ 1 ,
where μ > 0 plays the role of regularization parameter. We call γ the fractional parameter; when γ = 1 2 , we obtain the quasi-boundary value method, and when γ = 1 , it expresses the classic Tikhonov method. 1 2 < γ < 1 is used for the fractional Tikhonov regularization methodBecause measurement errors exist in the data function h ( x ) , we assume the exact data h ( x ) and the measured data h δ ( x ) both belong to L 2 ( R ) and satisfy
h δ ( · ) h ( · ) δ ,
where δ > 0 denotes the noise level. Then we extend h ( z ) analytically from these data to the whole domain Ω such that
ω ( · , a ) = ω ^ ( · , a ) M ,
where M is a fixed positive constant.
The article is organized as follows. In Section 2, we consider the a posteriori parameter choice rule for fractional Tikhonov regularization method and give a Hölder-type error estimate. In Section 3, we provide some numerical examples to show the validity of the proposed fractional Tikhonov regularization method. Finally, we give concluding remarks in Section 4.

2. An A Posteriori Regularization Parameter Choice Rule for the Fractional Tikhonov Method and the Convergence Estimate

In this section, we apply the fractional Tikhonov method with posterior parameter selection rules to the analytical continuation problem and provide the specific rate of convergence for the regularized approximation. We use the Morozov’s discrepancy principle to choose the regularization parameter μ ; for Morozov’s discrepancy principle, please refer to Reference [31]. We choose the regularization parameters μ to satisfy
K y ω ^ μ δ ( ξ , y ) h ^ δ ( ξ ) = τ δ ,
where 1 2 < γ 1 , τ > 1 is a constant and μ > 0 is a regularization parameter.
In order to prove our main result, we give the following auxiliary lemmas.
Lemma 1
([32]). Let 0 < m < n , k > 0 ; then
sup k > 0 e k m 1 + μ e k n μ m n .
Lemma 2.
Set d ( μ ) = K y ω ^ μ δ ( ξ , y ) h ^ δ ( ξ ) . If 0 < δ < h ^ δ , then the following hold:
(a) 
d ( μ ) is a continuous function;
(b) 
l i m μ 0 d ( μ ) = 0 ;
(c) 
l i m μ d ( μ ) = h ^ δ L 2 ( R ) ;
(d) 
d ( μ ) is a strictly increasing function over ( 0 , ) .
Proof. 
From (11), we have
d ( μ ) = μ e 2 γ a ξ 1 + μ e 2 γ a ξ h ^ δ ( ξ ) .
The above result can be easily obtained by the expression of d ( μ ) . □
Remark 1.
From Lemma 2, we know that there exists a unique solution μ satisfying Equation (11).
Lemma 3. 
If μ is the solution of Equation (11), we also obtain the following inequality:
μ 1 2 γ M ( τ 1 ) δ .
Proof. 
From (11) and Lemma 2, we obtain
τ δ = μ e 2 γ a ξ 1 + μ e 2 γ a ξ h ^ δ ( ξ ) μ e 2 γ a ξ 1 + μ e 2 γ a ξ ( h ^ δ ( ξ ) h ^ ( ξ ) ) + μ e 2 γ a ξ 1 + μ e 2 γ a ξ h ^ ( ξ ) .
From the noise assumptiona priori condition (9) and the a priori condition (10), there holds
τ δ δ + μ · e ( 2 γ 1 ) a ξ 1 + μ e 2 γ a ξ e a ξ h ^ ( ξ ) δ + μ · M · sup ξ < 0 e ( 2 γ 1 ) a ξ 1 + μ e 2 γ a ξ .
According to Lemma 1, we obtain
τ δ δ + μ 1 2 γ M .
So
μ 1 2 γ M ( τ 1 ) δ .
Lemma 4. 
Set
ϕ μ δ ( · , y ) : = ω ^ ( ξ , y ) ω ^ μ δ ( ξ , y ) ;
then the following inequality holds
ϕ μ δ ( · , y ) ϕ μ δ ( · , a ) y a ϕ μ δ ( · , 0 ) 1 y a .
Proof. 
By (17), it is easy to see that
ϕ μ δ ( · , y ) = e y ξ h ^ ( ξ ) e y ξ 1 + μ e 2 γ a ξ h δ ^ ( ξ ) ,
then
ϕ μ δ ( · , 0 ) = h ^ ( ξ ) 1 1 + μ e 2 γ a ξ h ^ δ ( ξ ) ,
ϕ μ δ ( · , a ) = e a ξ h ^ ( ξ ) e a ξ 1 + μ | e a ξ | 2 γ h δ ^ ( ξ ) .
By the Hölder inequality, we obtain
ϕ μ δ ( · , y ) 2 = | e y ξ h ^ ( ξ ) e y ξ 1 + μ e 2 γ a ξ h δ ^ ( ξ ) | 2 d ξ = e 2 y ξ Θ h ( μ , ξ , δ ) 2 y a · Θ h ( μ , ξ , δ ) 2 ( 1 y a ) d ξ ( e y ξ ) 2 a y Θ h ( μ , ξ , δ ) 2 d ξ y a · Θ h ( μ , ξ , δ ) 2 d ξ 1 y a = e 2 a ξ Θ h ( μ , ξ , δ ) 2 d ξ y a · Θ h ( μ , ξ , δ ) 2 d ξ 1 y a = ϕ μ δ ( · , a ) 2 y a ϕ μ δ ( · , 0 ) 2 ( 1 y a ) ,
where Θ h ( μ , ξ , δ ) = h ^ ( ξ ) 1 1 + μ e 2 γ a ξ h ^ δ ( ξ ) . Thus, we obtain the result. □
Lemma 5. 
The following inequalities holds
ϕ μ δ ( · , 0 ) ( τ + 1 ) δ ,
ϕ μ δ ( · , a ) τ E τ 1 .
Proof. 
First we prove (19). Using the triangle inequality and Equation (11), we get
ϕ μ δ ( · , 0 ) = h ^ ( ξ ) 1 1 + μ e 2 γ a ξ h ^ δ ( ξ ) h ^ ( ξ ) h ^ δ ( ξ ) + h ^ δ ( ξ ) 1 1 + μ e 2 γ a ξ h ^ δ ( ξ ) ( τ + 1 ) δ .
Then, we prove (20). Using the triangle inequality, we get
ϕ μ δ ( · , a ) = e a ξ h ^ ( ξ ) e a ξ 1 + μ e 2 γ a ξ h ^ δ ( ξ ) e a ξ h ^ ( ξ ) e a ξ 1 + μ e 2 γ a ξ h ^ ( ξ ) + e a ξ 1 + μ e 2 γ a ξ ( h ^ ( ξ ) h ^ δ ( ξ ) )
By the noise assumption (9) and the a priori condition (10) and Lemma 3, we obtain,
ϕ μ δ ( · , a ) ( 1 1 1 + μ e 2 γ a ξ ) e a ξ h ^ ( ξ ) + δ sup ξ < 0 e a ξ 1 + μ e 2 γ a ξ M + δ μ 1 2 γ τ M τ 1 .
Now we give the main result of our regularization.
Theorem 1. 
Suppose the a priori condition (10) and the noise assumption (9) hold. Let ω ( · , y ) be the exact solution, and ω μ δ ( · , y ) be its regularized approximation defined by (7). Choose the solution of Equation (11) as the value of the posterior regularization parameter μ; then we obtain the following error estimate:
ω μ δ ( · , y ) ω ( · , y ) c 1 M y a δ 1 y a ,
where c 1 : = ( τ τ 1 ) y a ( τ + 1 ) 1 y a .
Proof. 
Using Parseval’s equality and Lemma 4, we know
ω μ δ ( · , y ) ω ( · , y ) = ω ^ μ δ ( ξ , y ) ω ^ ( ξ , y ) ϕ μ δ ( · , a ) y a ϕ μ δ ( · , 0 ) 1 y a .
According to Lemma 5, we have
ω μ δ ( · , y ) ω ( · , y ) ( τ M τ 1 ) y a ( ( τ + 1 ) δ ) 1 y a = c 1 M y a δ 1 y a ,
where c 1 = ( τ + 1 ) ( τ ( τ + 1 ) ( τ 1 ) ) y a . The proof of Theorem 1 is completed. □

3. Numerical Examples

In this section, we use some numerical examples to verify the effectiveness of the fractional Tikhonov regularization method. The fractional Tikhonov regularization method can be implemented by fast Fourier transform. In these numerical experiments, we always take a = 1 and fix the domain Ω * = { z = x + i y C | x | 10 , 0 < y < 1 } . Suppose the vector G and G ( x + i y ) represent samples from the function G ( x ) and ω ( · , y ) ; then we can obtain the perturbation data through
G δ = G + δ · r a n d n ( s i z e ( G ) ) .
Here “ r a n d n ( · ) ” means to generate a set of random numbers that obey the standard normal distribution. The error is given by (Root Mean Square Error ( R M S E ))
R M S E = G δ G l 2 : = 1 N + 1 n = 1 N + 1 | G δ ( n ) G ( n ) | 2 .
In the numerical experiments, we denote the corresponding RMSEs of the real part and imaginary part as R M S E R e and R M S E I m , respectively. We usually choose N = 200 . ω μ δ ( · , y ) represent the regularization solution calculated by the fractional Tikhonov method. We give numerical results under the a posteriori choice rule. The a posteriori parameter μ is selected by (11). In these experiments, we fix the fractional parameter γ = 2 / 3 and noise level δ = 0.01 . In the following numerical examples, we consider problems of [18].
Example 1.
The function
h ( z ) = e z 2 = e ( x + i y ) 2 = e y 2 x 2 ( cos 2 x y i sin 2 x y )
is analytic in the domain
Ω * = { z = x + i y C x R , 0 < y 1 }
with h ( z ) y = 0 = e x 2 L 2 ( R ) , R e h ( z ) = e y 2 x 2 cos 2 x y , I m h ( z ) = e y 2 x 2 sin 2 x y .
Figure 1 shows the numerical results of the a posteriori parameter selection of Example 1. μ is selected by the discrepancy principle (11), where τ = 50 , δ = 0.01 . Figure 1a–f show the comparison of the exact solution and the approximate solution at y = 0.2 y = 0.5 and y = 0.8 .
Table 1 shows the different error results for different y in Example 1. We fix τ = 50 , δ = 0.01 and compare the numerical results when γ = 2 / 3 and γ = 1 . From Table 1, we can see that the numerical result of γ = 2 / 3 is better than the numerical result of γ = 1 .
Example 2.
The function h is given by:
h ( z ) = 25 z 2 = 25 ( x + i y ) 2 , | x | < 5 , 0 , | x | 5 .
It is a piecewise analytic function, and 25 ( x + i y ) 2 has a single-valued determination in the complex plane minus the set x : | x | 5 .
Figure 2 shows the numerical results of the a posteriori parameter selection of Example 2. μ is selected by the discrepancy principle (11), where τ = 1.1 , δ = 0.01 . Figure 2a–f show the comparison of the exact solution and the approximate solution at y = 0.2 y = 0.5 and y = 0.8 .
Table 2 shows the different error results for different y in Example 2. We fix τ = 1.1 , δ = 0.01 and use γ = 2 / 3 and γ = 1 for comparison. According to the data in Table 1 and Table 2, it is not difficult to see that the fractional Tikhonov method is better than the classical Tikhonov method.

4. Conclusions

In this article, a fractional Tikhonov regularization method for analytic continuation problem is given, and we overcome its ill-posedness and obtained a regularized solution. Furthermore, we proved the error estimates for the fractional regularization methods under the the Morozov’s parameter choice rule. The numerical experiment shows that the proposed method works effectively. It is worth pointing out that the method we provide not only includes the classical Tikhonov regularization method, but the numerical results obtained are also more accurate and stable. Future research will extend the analytical continuation problem of one-dimensional cases to two-dimensional cases or even higher-dimensional cases. At the same time, other regularization methods will be tried to solve such inverse problems in order to obtain more accurate convergence results.

Author Contributions

Conceptualization, X.X. (Xuemin Xue); Formal analysis, X.X. (Xuemin Xue); Methodology, X.X. (Xiangtuan Xiong) and X.X. (Xuemin Xue); Writing—review & editing, X.X. (Xiangtuan Xiong). All authors have read and agreed to the published version of the manuscript.

Funding

This research is supported by the Natural Science Foundation of China (No. 11661072), the Natural Science Foundation of Northwest Normal University, China (No. NWNU-LKQN-17-5).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

All authors are very grateful to the editors and two reviewers for their valuable comments and suggestions, which greatly improved the presentation of our manuscripts.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Franklin, J. Analytic contiunation by the fast Fourier transform. SIAM. Sci. Stat. Comput. 1990, 11, 112–122. [Google Scholar] [CrossRef] [Green Version]
  2. Ramm, A.G. The ground-penetrating radar problem. J. Inverse Ill-Posed Problem. 2000, 8, 23–30. [Google Scholar] [CrossRef] [Green Version]
  3. Stefanescu, I.S. On the stable analytic continuation with a condition of uniform boundedness. J. Math. Phys. 1986, 27, 2657–2686. [Google Scholar] [CrossRef]
  4. Natterer, F. Image reconstruction in quantitative susceptibility mappling. SIAM J. Imaging Sci. 2016, 9, 1127–1131. [Google Scholar] [CrossRef]
  5. Airapetyan, R.G.; Ramm, A.G. Numerical inversion of the Laplace transform from the real axis. J. Math. Anal. Appl. 2000, 248, 572–587. [Google Scholar] [CrossRef] [Green Version]
  6. Epstein, C.L. Philadelphia. In Introduction to the Mathematics of Medical Imaging; SIAM: Philadelphia, PA, USA, 2008. [Google Scholar]
  7. Miller, K.; Viano, G.A. On the necessity of nearlybestpossible methods for analytic continuation of scattering data. J. Math. Phys. 1973, 14, 1037–1048. [Google Scholar] [CrossRef]
  8. Fu, C.L.; Deng, Z.L.; Feng, X.L.; Dou, F.F. A modified Tikhonov regularization for stable analytic continuation. SIAM J. Numer. Anal. 2009, 47, 2982–3000. [Google Scholar] [CrossRef]
  9. Engl, H.W.; Hanke, M.; Neubauer, A. Regularization of Inverse Problem; Kluwer Academic: Boston, MA, USA, 1996. [Google Scholar]
  10. Hao, D.N.; Shali, H. Stable analytic continuation by mollification and the fast Fourier transform. In Method of Complex and Clifford Analysis; ICAM: Hanoi, Vietnam, 2004; pp. 143–152. [Google Scholar]
  11. Deng, Z.L.; Fu, C.L.; Feng, X.L.; Zhang, Y.X. A mollification regularization method for stable analytic continuation. Math. Comput. Simul. 2011, 81, 1593–1608. [Google Scholar] [CrossRef]
  12. Fu, C.L.; Dou, F.F.; Feng, X.L.; Qian, Z. A simple regularization method for stable analytic continuation. Inverse Probl. 2008, 24, 065003. [Google Scholar] [CrossRef]
  13. Zhang, Y.X.; Fu, C.L.; Yan, L. Approximate inverse method for stable analytic continuation in a strip domain. J. Comput. Appl. Math. 2011, 235, 2979–2992. [Google Scholar] [CrossRef] [Green Version]
  14. Cheng, H.; Fu, C.L.; Feng, X.L. An optimal filtering method for stable analytic continuation. J. Comput. Appl. Math. 2012, 236, 2582–2589. [Google Scholar] [CrossRef]
  15. Feng, X.L.; Ning, W.T. A wavelet regularization method for solving numerical analytic continuation. Int. J. Comput. Math. 2015, 92, 1025–1038. [Google Scholar] [CrossRef]
  16. Xiong, X.T.; Zhu, L.Q.; Li, M. Regularization methods for a problem of analytic continuation. Math. Comput. Simulat. 2011, 82, 332–345. [Google Scholar] [CrossRef]
  17. Cheng, H.; Fu, C.L.; Zhang, Y.X. An iteration method for stable analytic continuation. Appl. Math. Comput. 2014, 233, 203–213. [Google Scholar] [CrossRef]
  18. Xiong, X.T.; Cheng, Q. A modified Lavrentiev iterative regularization method for analytic continuation. J. Comput. Appl. Math. 2018, 327, 127–140. [Google Scholar] [CrossRef]
  19. Yang, F.; Wang, Q.C.; Li, X.X. A fractional Landweber iterative regularization method for stable analytic continuation. AIMS Math. 2021, 6, 404–419. [Google Scholar] [CrossRef]
  20. Klann, E.; Maass, P.; Ramlau, R. Two-step regularization methods for linear inverse problems. J. Inverse Ill-Posed Probl. 2006, 14, 583–609. [Google Scholar] [CrossRef]
  21. Tikhonov, A.N.; Goncharsky, A.V.; Stepanov, V.V.; Yagola, A.G. Numerical Methods for the Solution of Ill-Posed Problems; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1995. [Google Scholar]
  22. Klann, E.; Ramlau, R. Regularization by fractional filter methods and data smoothing. Inverse Probl. 2008, 24, 045005. [Google Scholar] [CrossRef] [Green Version]
  23. Hochstenbach, M.E.; Reichel, L. Fractional Tikhonov regularization for linear discrete ill-posed problems. BIT Numer. Math. 2011, 51, 197–215. [Google Scholar] [CrossRef] [Green Version]
  24. Gerth, D.; Klann, E.; Ramlau, R.; Reichel, L. On fractional Tikhonov regularization. J. Inverse Ill-Posed Probl. 2015, 23, 611–625. [Google Scholar] [CrossRef]
  25. Morigi, S.; Reichel, L.; Sgallari, F. Fractional Tikhonov regularization with a nonlinear penalty term. J. Comput. Appl. Math. 2017, 324, 142–154. [Google Scholar] [CrossRef]
  26. Bianchi, D.; Buccini, A.; Donatelli, M.; Serra-Capizzano, S. Iterated fractional Tikhonov regularization. Inverse Probl. 2015, 31, 055005. [Google Scholar] [CrossRef] [Green Version]
  27. Bianchi, D.; Donatelli, M. On generalized iterated Tikhonov regularization with operator-dependent seminorms. Electron. Trans. Numer. Anal. 2017, 47, 73–99. [Google Scholar] [CrossRef]
  28. Xiong, X.T.; Xue, X.M.; Qian, Z. A modified iterative regularization method for ill-posed problems. Appl. Numer. Math. 2017, 122, 108–128. [Google Scholar] [CrossRef]
  29. Li, M.; Xiong, X.T. On a fractional backward heat conduction problem: Application to deblurring. Comput. Math. Appl. 2012, 64, 2594–2602. [Google Scholar] [CrossRef] [Green Version]
  30. Qian, Z. A new generalized Tikhonov method based on filtering idea for stable analytic continuation. Inverse. Probl. Sci. Eng. 2018, 26, 362–375. [Google Scholar] [CrossRef]
  31. Morozov, V.A. Regularization of incorrectly posed problems and the choice of regularization parameter. USSR Comput. Math. Math. Phys. 1966, 6, 242–251. [Google Scholar] [CrossRef]
  32. Xiong, X.T. A regularization method for a Cauchy problem of the Helmholtz equation. J. Comput. Appl. Math. 2010, 233, 1723–1732. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Example 1. Numerical results under the posteriori fractional Tikhonov method. (a,b) are real part and imaginary part at y = 0.2, respectively, where μ = 1 × 10 3 ; (c,d) are real part and imaginary part at y = 0.5, respectively, where μ = 1 × 10 3 ; (e,f) are real part and imaginary part at y = 0.8, respectively, where μ = 1 × 10 3 .
Figure 1. Example 1. Numerical results under the posteriori fractional Tikhonov method. (a,b) are real part and imaginary part at y = 0.2, respectively, where μ = 1 × 10 3 ; (c,d) are real part and imaginary part at y = 0.5, respectively, where μ = 1 × 10 3 ; (e,f) are real part and imaginary part at y = 0.8, respectively, where μ = 1 × 10 3 .
Mathematics 09 02255 g001
Figure 2. Example 2. Numerical results under the posteriori fractional Tikhonov method. (a,b) are the real part and imaginary part at y = 0.2, respectively, where μ = 1 × 10 4 ; (c,d) are the real part and imaginary part at y = 0.5, respectively, where μ = 0.01 ; (e,f) are the real part and imaginary part at y = 0.8, respectively, where μ = 0.1 .
Figure 2. Example 2. Numerical results under the posteriori fractional Tikhonov method. (a,b) are the real part and imaginary part at y = 0.2, respectively, where μ = 1 × 10 4 ; (c,d) are the real part and imaginary part at y = 0.5, respectively, where μ = 0.01 ; (e,f) are the real part and imaginary part at y = 0.8, respectively, where μ = 0.1 .
Mathematics 09 02255 g002
Table 1. Numerical results of Example 1 for different y and γ .
Table 1. Numerical results of Example 1 for different y and γ .
y0.20.50.8
γ = 2 / 3 R M S E R e 0.07250.10090.2769
R M S E I m 0.01680.07320.2684
γ = 1 R M S E R e 0.08570.28660.7765
R M S E I m 0.02380.27740.7227
Table 2. Numerical results of Example 2 for different y and γ .
Table 2. Numerical results of Example 2 for different y and γ .
y0.20.50.8
γ = 2 / 3 R M S E R e 1.22013.20065.1905
R M S E I m 1.22082.04122.8628
γ = 1 R M S E R e 1.60755.66056.5887
R M S E I m 1.77143.50223.7275
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Xue, X.; Xiong, X. A Posteriori Fractional Tikhonov Regularization Method for the Problem of Analytic Continuation. Mathematics 2021, 9, 2255. https://doi.org/10.3390/math9182255

AMA Style

Xue X, Xiong X. A Posteriori Fractional Tikhonov Regularization Method for the Problem of Analytic Continuation. Mathematics. 2021; 9(18):2255. https://doi.org/10.3390/math9182255

Chicago/Turabian Style

Xue, Xuemin, and Xiangtuan Xiong. 2021. "A Posteriori Fractional Tikhonov Regularization Method for the Problem of Analytic Continuation" Mathematics 9, no. 18: 2255. https://doi.org/10.3390/math9182255

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