Some time stepping methods for fractional diffusion problems with nonsmooth data
dc.contributor.author | Yang, Yan | * |
dc.contributor.author | Yan, Yubin | * |
dc.contributor.author | Ford, Neville J. | * |
dc.date.accessioned | 2017-10-16T08:37:18Z | |
dc.date.available | 2017-10-16T08:37:18Z | |
dc.date.issued | 2017-09-02 | |
dc.identifier.citation | Yang, Y., Yan, Y., & Ford, N. (2017). Some time stepping methods for fractional diffusion problems with nonsmooth data. Computational Methods in Applied Mathematics, 18(1), 129-146. https://doi.org/10.1515/cmam-2017-0037 | en |
dc.identifier.doi | 10.1515/cmam-2017-0037 | |
dc.identifier.uri | http://hdl.handle.net/10034/620655 | |
dc.description.abstract | 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. | |
dc.language.iso | en | en |
dc.publisher | De Gruyter | en |
dc.relation.url | https://www.degruyter.com/view/j/cmam.ahead-of-print/cmam-2017-0037/cmam-2017-0037.xml | en |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
dc.subject | Fractional diffusion problem | en |
dc.subject | Nonsmooth data | en |
dc.subject | Error estimates | en |
dc.subject | Laplace transform | en |
dc.title | Some time stepping methods for fractional diffusion problems with nonsmooth data | en |
dc.type | Article | en |
dc.identifier.eissn | 1609-9389 | |
dc.contributor.department | Lvliang University; University of Chester | en |
dc.identifier.journal | Computational Methods in Applied Mathematics | |
dc.date.accepted | 2017-08-18 | |
or.grant.openaccess | Yes | en |
rioxxterms.funder | Unfunded | en |
rioxxterms.identifier.project | Unfunded | en |
rioxxterms.version | AM | en |
rioxxterms.licenseref.startdate | 2018-09-02 | |
html.description.abstract | 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. | |
rioxxterms.publicationdate | 2017-09-02 |