A preconditioning technique for an all-at-once system from Volterra subdiffusion equations with graded time steps
Abstract
Volterra subdiffusion problems with weakly singular kernel describe the dynamics of subdiffusion processes well.The graded scheme is often chosen to discretize such problems since it can handle the singularity of the solution near . In this paper, we propose a modification. We first split the time interval into and , where () is reasonably small. Then, the graded scheme is applied in , while the uniform one is used in . Our all-at-once system is derived based on this strategy. In order to solve the arising system efficiently, we split it into two subproblems and design two preconditioners. Some properties of these two preconditioners are also investigated. Moreover, we extend our method to solve semilinear subdiffusion problems. Numerical results are reported to show the efficiency of our method.
Keywords
Cite
@article{arxiv.2007.14636,
title = {A preconditioning technique for an all-at-once system from Volterra subdiffusion equations with graded time steps},
author = {Yong-Liang Zhao and Xian-Ming Gu and Alexander Ostermann},
journal= {arXiv preprint arXiv:2007.14636},
year = {2024}
}
Comments
3 figures; 3 tables. This preprint has been accepted by Journal of Scientific Computing