2019
DOI: 10.1090/mcom/3410
|View full text |Cite
|
Sign up to set email alerts
|

Error analysis of the L1 method on graded and uniform meshes for a fractional-derivative problem in two and three dimensions

Abstract: An initial-boundary value problem with a Caputo time derivative of fractional order α ∈ (0, 1) is considered, solutions of which typically exhibit a singular behaviour at an initial time. For this problem, we give a simple framework for the analysis of the error of L1-type discretizations on graded and uniform temporal meshes in the L∞ and L 2 norms. This framework is employed in the analysis of both finite difference and finite element spatial discretiztions. Our theoretical findings are illustrated by numeri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

6
95
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 187 publications
(102 citation statements)
references
References 26 publications
6
95
0
1
Order By: Relevance
“…This implies that the optimal grading parameter for global accuracy is r = (2 − α)/α. Note that similar global error bounds were obtained in [10,8,14].…”
supporting
confidence: 75%
See 3 more Smart Citations
“…This implies that the optimal grading parameter for global accuracy is r = (2 − α)/α. Note that similar global error bounds were obtained in [10,8,14].…”
supporting
confidence: 75%
“…By contrast, [10, Theorem 3.1] (obtained by means of a discrete Grönwall inequality) gives a somewhat similar, but less sharp error bound for graded meshes, as (in our notation) it involves the term O(τ α ) = O(M −αr ), so, e.g., [10, (3.17)] requires (in our notation) r = (2 − α)/α to attain the optimal convergence rate in positive time. Note that for r = 1, we have E m M −1 , so our error bound is consistent with [4,6,8] and is sharper than [10, (3.17…”
supporting
confidence: 62%
See 2 more Smart Citations
“…with h ≤ h 1 = (C Ω C * 2 ) −1 . Using (4.3) and Theorem 3.1, we get [33,34]). Taking = |U n h − u n |, 1 = , 2 = U n − u n in (1.4), we get…”
Section: )mentioning
confidence: 92%