Fundamental kernel-based method for backward space–time fractional diffusion problem

Based on kernel-based approximation technique, we devise in this paper an efficient and accurate numerical scheme for solving a backward space–time fractional diffusion problem (BSTFDP). The kernels used in the approximation are the fundamental solutions of the space–time fractional diffusion equati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & mathematics with applications (1987) 2016-01, Vol.71 (1), p.356-367
Hauptverfasser: Dou, F.F., Hon, Y.C.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Based on kernel-based approximation technique, we devise in this paper an efficient and accurate numerical scheme for solving a backward space–time fractional diffusion problem (BSTFDP). The kernels used in the approximation are the fundamental solutions of the space–time fractional diffusion equation expressed in terms of inverse Fourier transform of Mittag-Leffler functions. The use of Inverse fast Fourier transform (IFFT) technique enables an accurate and efficient evaluation of the fundamental solutions and gives a robust numerical algorithm for the solution of the BSTFDP. Since the BSTFDP is intrinsic ill-posed, we apply the standard Tikhonov regularization technique to obtain a stable solution to the highly ill-conditioned resultant system of linear equations. For choosing optimal regularization parameter, we combine the regularization technique with the generalized cross validation (GCV) method for an optimal placement of the source points in the use of fundamental solutions. Meanwhile, the proposed algorithm also speeds up the previous method given in Dou and Hon (2014). Several numerical examples are constructed to verify the accuracy and efficiency of the proposed method.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2015.11.023