Loading...
Two high-order time discretization schemes for subdiffusion problems with nonsmooth data
Yan, Yubin Wang, Yanyong Yang, Yan
Yan, Yubin
Wang, Yanyong
Yang, Yan
Advisors
Editors
Other Contributors
Affiliation
EPub Date
Publication Date
2020-11-13
Submitted Date
Collections
Files
Loading...
Main article
Adobe PDF, 384.4 KB
Other Titles
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.
https://doi.org/10.1515/fca-2020-0067
Publisher
Springer
Journal
Fractional Calculus and Applied Analysis
Research Unit
DOI
PubMed ID
PubMed Central ID
Type
Article
Language
Description
Series/Report no.
ISSN
EISSN
1314-2224