A preconditioning technique for an all-at-once system from Volterra subdiffusion equations with graded time steps
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911801679020032 |
|---|---|
| author | Zhao, Yong-Liang Gu, Xian-Ming Ostermann, Alexander |
| author_facet | Zhao, Yong-Liang Gu, Xian-Ming Ostermann, Alexander |
| contents | Volterra subdiffusion problems with weakly singular kernel describe the dynamics of subdiffusion processes well.The graded $L1$ scheme is often chosen to discretize such problems since it can handle the singularity of the solution near $t = 0$. In this paper, we propose a modification. We first split the time interval $[0, T]$ into $[0, T_0]$ and $[T_0, T]$, where $T_0$ ($0 < T_0 < T$) is reasonably small. Then, the graded $L1$ scheme is applied in $[0, T_0]$, while the uniform one is used in $[T_0, T]$. 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_14636 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | A preconditioning technique for an all-at-once system from Volterra subdiffusion equations with graded time steps Zhao, Yong-Liang Gu, Xian-Ming Ostermann, Alexander Numerical Analysis Volterra subdiffusion problems with weakly singular kernel describe the dynamics of subdiffusion processes well.The graded $L1$ scheme is often chosen to discretize such problems since it can handle the singularity of the solution near $t = 0$. In this paper, we propose a modification. We first split the time interval $[0, T]$ into $[0, T_0]$ and $[T_0, T]$, where $T_0$ ($0 < T_0 < T$) is reasonably small. Then, the graded $L1$ scheme is applied in $[0, T_0]$, while the uniform one is used in $[T_0, T]$. 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. |
| title | A preconditioning technique for an all-at-once system from Volterra subdiffusion equations with graded time steps |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2007.14636 |