Fast time-stepping discontinuous Galerkin method for the subdiffusion equation

Abstract The nonlocality of the fractional operator causes numerical difficulties for long time computation for time-fractional evolution equations. This paper develops a high-order fast time-stepping discontinuous Galerkin (DG) finite element method for a time-fractional diffusion equation, which saves storage and computational time. An optimal error estimate of the form $O(N^{-p-1} + h^{m+1} + \varepsilon N^{r\alpha })$ for the proposed time-stepping DG method is rigorously proved, where $N$ denotes the number of time intervals, $p$ is the degree of polynomial approximation on each time subinterval, $h$ is the maximum spatial mesh size, $r\ge 1$, $m$ is the order of finite element space and $\varepsilon>0$ can be arbitrarily small. Numerical simulations verify the theoretical analysis.

Authors

Institutions

Publication Details

Journal
IMA Journal of Numerical Analysis
Published
2024-10-31
DOI
https://doi.org/10.1093/imanum/drae087
Citations
2
Primary Topic
Fractional Differential Equations Solutions
Type
article
Field-Weighted Citation Impact
0.79

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast time-stepping discontinuous Galerkin method for the subdiffusion equation

Fanhai Zeng, Xiaoyun Jiang, Zhimin Zhang, Hui Zhang
2 citations
IMA Journal of Numerical Analysis
Fractional Differential Equations Solutions
0.79
article

Fast time-stepping discontinuous Galerkin method for the subdiffusion equation

Fanhai Zeng, Xiaoyun Jiang, Zhimin Zhang, Hui Zhang
article en
2 citations

Abstract

Abstract The nonlocality of the fractional operator causes numerical difficulties for long time computation for time-fractional evolution equations. This paper develops a high-order fast time-stepping discontinuous Galerkin (DG) finite element method for a time-fractional diffusion equation, which saves storage and computational time. An optimal error estimate of the form $O(N^{-p-1} + h^{m+1} + \varepsilon N^{r\alpha })$ for the proposed time-stepping DG method is rigorously proved, where $N$ denotes the number of time intervals, $p$ is the degree of polynomial approximation on each time subinterval, $h$ is the maximum spatial mesh size, $r\ge 1$, $m$ is the order of finite element space and $\varepsilon>0$ can be arbitrarily small. Numerical simulations verify the theoretical analysis.

IMA Journal of Numerical AnalysisVol. 45(6)
Shandong University (CN), Wayne State University (US), University of Jinan (CN)
National Natural Science Foundation of China, Natural Science Foundation of Shandong Province, National Key Research and Development Program of China
Openalex Percentile: Top 28%
Fractional Differential Equations Solutions
0.79
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.