@Article{EAJAM-12-3,
author = {},
title = {Optimal Convergence Rates in Time-Fractional Discretisations: The ${\rm L1}$, $\overline{{\rm L1}}$ and Alikhanov Schemes},
journal = {East Asian Journal on Applied Mathematics},
year = {2022},
volume = {12},
number = {3},
pages = {503--520},
abstract = {<p style="text-align: justify;">Consider the discretisation of the initial-value problem $D^αu(t) = f (t)$ for $0 &lt; t \leq T$ with $u(0) = u_0$ , where $D^αu(t)$ is a Caputo derivative of order $α \in (0, 1)$, using
the ${\rm L1}$ scheme on a graded mesh with $N$ points. It is well known that one can prove
the maximum nodal error in the computed solution is at most $\mathscr{O} (N^{− min\{rα,2−α\}})$, where $r\geq 1$ is the mesh grading parameter ($r = 1$ generates a uniform mesh). Numerical
experiments indicate that this error bound is sharp, but no proof of its sharpness has been
given. In the present paper the sharpness of this bound is proved, and the sharpness of
the analogous nodal error bounds for the $\overline{{\rm L1}}$ and Alikhanov schemes will also be proved,
using modifications of the ${\rm L1}$ analysis.</p>},
issn = {2079-7370},
doi = {https://doi.org/10.4208/eajam.290621.220921},
url = {https://global-sci.com/article/82478/optimal-convergence-rates-in-time-fractional-discretisations-the-rm-l1-overlinerm-l1-and-alikhanov-schemes}
}