English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider error estimates for some time stepping methods for solving fractional diffusion problems with nonsmooth data in both homogeneous and inhomogeneous cases. McLean and Mustapha [ 18 ] established anO  ⁢   (  k  ){O(k)}    convergence rate for the piecewise constant discontinuous Galerkin method with nonsmooth initial data for the homogeneous problem when the linear operator  A  is assumed to be self-adjoint, positive semidefinite and densely defined in a suitable Hilbert space, where  k  denotes the time step size. In this paper, we approximate the Riemann–Liouville fractional derivative by Diethelm’s method (or L1 scheme) and obtain the same time discretisation scheme as in McLean and Mustapha [ 18 ]. We first prove that this scheme has also convergence rateO  ⁢   (  k  ){O(k)}    with nonsmooth initial data for the homogeneous problem when  A  is a closed, densely defined linear operator satisfying some certain resolvent estimates. We then introduce a new time discretisation scheme for the homogeneous problem based on the convolution quadrature and prove that the convergence rate of this new scheme isO  ⁢   (   k   1  +  α    ){O(k^{1+\alpha})}   ,0  &lt;  α  &lt;  1{0&lt;\alpha&lt;1}   , with the nonsmooth initial data. Using this new time discretisation scheme for the homogeneous problem, we define a time stepping method for the inhomogeneous problem and prove that the convergence rate of this method isO  ⁢   (   k   1  +  α    ){O(k^{1+\alpha})}   ,0  &lt;  α  &lt;  1{0&lt;\alpha&lt;1}   , with the nonsmooth data. Numerical examples are given to show that the numerical results are consistent with the theoretical results.

Some Time Stepping Methods for Fractional Diffusion Problems with Nonsmooth Data