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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Finite difference methods for approximating fractional derivatives are often analyzed by determining their order of consistency when applied to smooth functions, but the relationship between this measure and their actual numerical performance is unclear. Thus in this paper several wellknown difference schemes are tested numerically on simple Riemann-Liouville and Caputo boundary value problems posed on the interval [0, 1] to determine their orders of convergence (in the discrete maximum norm) in two unexceptional cases: (i) when the solution of the boundary-value problem is a polynomial (ii) when the data of the boundary value problem is smooth. In many cases these tests reveal gaps between a method’s theoretical order of consistency and its actual order of convergence. In particular, numerical results show that the popular shifted Gr¨unwald-Letnikov scheme fails to converge for a Riemann-Liouville example with a polynomial solution p(x), and a rigorous proof is given that this scheme (and some other schemes) cannot yield a convergent solution when p(0)≠ 0.

Formal Consistency Versus Actual Convergence Rates of Difference Schemes for Fractional-Derivative Boundary Value Problems