.png){kind=icon}
.png){kind=icon}
Return
An efficient and memory saving algorithm for subdiffusion equation using incremental singular value decomposition
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2026.115246.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we address the well-known challenge in the numerical solution of time-fractional partial differential equations (TFPDEs), namely, that the dependence on all previous time levels leads to storage requirements that grow linearly with the number of time steps. To overcome this difficulty, we develop an efficient algorithm based on incremental singular value decomposition (ISVD), which avoids the excessive memory demands associated with storing the full solution history. A rigorous error analysis is established, and numerical experiments are presented to validate the theoretical results. Comparisons with the direct method and a representative fast evaluation method show that the proposed ISVD approach dramatically reduces memory usage relative to the direct method and remains competitive with the fast method over the tested parameter regimes.
Keywords:
Time-fractional partial differential equation
Caputo derivative
Incremental singular value decomposition
Finite element method
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W