1. Two L1 Schemes on Graded Meshes for Fractional Feynman-Kac Equation
- Author
-
Weiping Bu, Suzhen Jiang, and Minghua Chen
- Subjects
Combinatorics ,Computational Mathematics ,Numerical Analysis ,symbols.namesake ,Computational Theory and Mathematics ,Rate of convergence ,Applied Mathematics ,General Engineering ,symbols ,Feynman diagram ,Software ,Theoretical Computer Science ,Mathematics - Abstract
In this paper, we study the following time-fractional Feynman-Kac equation $$\begin{aligned} {_\sigma ^CD_t^{\alpha }G(x,t)}-\Delta G(x,t)=f(x,t),~~~ 0 0. \end{aligned}$$ As is well known, the optimal rate of convergence $$\mathcal {O}\left( \tau ^{\min \{2-\alpha ,~r\alpha \}}\right) $$ with $$\sigma =0$$ on graded meshes has been proved in [Stynes et al., SIAM J. Numer. Anal. 55, 1057–1079 (2017)] by L1 scheme. However, there are still some significant differences when $$\sigma >0$$ . More concretely, it shall drop down to the $$\mathcal {O}\left( \tau ^{\min \{1,~r\alpha \}}\right) $$ by the implicit L1 scheme. This motivates us to design the implicit-explicit L1 scheme, which recovers a convergence rate $$\mathcal {O}\left( \tau ^{\min \{2-\alpha ,~r\alpha \}}\right) $$ on graded meshes. Finally, numerical experiments are given to illustrate theoretical results.
- Published
- 2021