• Login / Register
    Search 
    •   Home
    • Faculty of Science and Engineering
    • Search
    •   Home
    • Faculty of Science and Engineering
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of ChesterRepCommunitiesTitleAuthorsPublication DateSubmit DateSubjectsPublisherJournalThis CommunityTitleAuthorsPublication DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    Filter by Category

    Subjects
    Error estimates (1)
    Fractional diffusion problem (1)
    Laplace transform (1)
    Nonsmooth data (1)
    View MoreJournalComputational Methods in Applied Mathematics (1)AuthorsFord, Neville J. (1)
    Yan, Yubin (1)
    Yang, Yan (1)
    Types
    Article (1)

    About

    AboutUniversity of Chester

    Statistics

    Display statistics
     

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Now showing items 1-1 of 1

    • List view
    • Grid view
    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100

    • 1CSV
    • 1RefMan
    • 1EndNote
    • 1BibTex
    • Selective Export
    • Select All
    • Help
    Thumbnail

    Some time stepping methods for fractional diffusion problems with nonsmooth data

    Yang, Yan; Yan, Yubin; Ford, Neville J. (De Gruyter, 2017-09-02)
    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 \cite{mclmus} (Time-stepping error bounds for fractional diffusion problems with non-smooth initial data, Journal of Computational Physics, 293(2015), 201-217) established an $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 \cite{mclmus}. We first prove that this scheme has also convergence rate $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 discretization scheme for the homogeneous problem based on the convolution quadrature and prove that the convergence rate of this new scheme is $O(k^{1+ \alpha}), 0<\alpha <1 $ with the nonsmooth initial data. Using this new time discretization scheme for the homogeneous problem, we define a time stepping method for the inhomogeneous problem and prove that the convergence rate of this method is $O(k^{1+ \alpha}), 0<\alpha <1 $ with the nonsmooth data. Numerical examples are given to show that the numerical results are consistent with the theoretical results.
    DSpace software (copyright © 2002 - 2019)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.