NANADec 1, 2017

A fast and spectrally convergent algorithm for rational-order fractional integral and differential equations

arXiv:1611.080280.2521 citationsh-index: 29
AI Analysis45

It provides an efficient numerical method for fractional differential equations, which are computationally challenging, but the approach is an extension of existing techniques to a new class of equations.

The paper presents a fast, linear-complexity algorithm for solving linear variable-coefficient rational-order fractional integral and differential equations, achieving spectral convergence for smooth problems.

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for ordinary differential equations [Olver & Townsend 2013], and involves constructing two different bases, one for the domain of the operator and one for the range of the operator. The bases are constructed from direct sums of suitably weighted ultraspherical or Jacobi polynomial expansions, for which explicit representations of fractional integrals and derivatives are known, and are carefully chosen so that the resulting operators are banded or almost-banded. Geometric convergence is demonstrated for numerous model problems when the variable coefficients and right-hand side are sufficiently smooth.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes