Two high-order time discretization schemes for subdiffusion problems with nonsmooth data
Name:
06-FCAA 841-proofs.pdf
Embargo:
2021-11-13
Size:
384.4Kb
Format:
PDF
Request:
Main article
Abstract
Two new high-order time discretization schemes for solving subdiffusion problems with nonsmooth data are developed based on the corrections of the existing time discretization schemes in literature. Without the corrections, the schemes have only a first order of accuracy for both smooth and nonsmooth data. After correcting some starting steps and some weights of the schemes, the optimal convergence orders $O(k^{3- \alpha})$ and $O(k^{4- \alpha})$ with $0< \alpha <1$ can be restored for any fixed time $t$ for both smooth and nonsmooth data, respectively. The error estimates for these two new high-order schemes are proved by using Laplace transform method for both homogeneous and inhomogeneous problem. Numerical examples are given to show that the numerical results are consistent with the theoretical results.Citation
Wang, Y., Yan, Y. & Yang, Y. (2020) Two high-order time discretization schemes for subdiffusion problems with nonsmooth data. Fractional Calculus and Applied Analysis, 23(5), 1349–1380.Publisher
De GruyterAdditional Links
https://www.degruyter.com/view/journals/fca/23/5/article-p1349.xmlType
ArticleEISSN
1314-2224Collections
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by-nc-nd/4.0/