A preconditioning technique for an all-at-once system from Volterra subdiffusion equations with graded time steps
Yong-Liang Zhao, Xian-Ming Gu, Alexander Ostermann

TL;DR
This paper introduces a novel preconditioning approach for efficiently solving all-at-once systems from discretized Volterra subdiffusion equations, combining graded and uniform schemes to handle solution singularities.
Contribution
It proposes a hybrid discretization strategy and develops two preconditioners for the all-at-once system, extending the method to semilinear problems.
Findings
Preconditioners improve solver efficiency.
Hybrid scheme handles singularities effectively.
Numerical results confirm method's effectiveness.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFractional Differential Equations Solutions · Differential Equations and Numerical Methods · Numerical methods for differential equations
