A note on a stable algorithm for computing the fractional integrals of orthogonal polynomials

Abstract

In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving corresponding fractional differential equations. A few numerical examples are reported.

arXiv comment8 pages, 3 figures

References in corpus (5)

• Trapezoidal methods for fractional differential equations: theoretical and computational aspects
• A unifying framework for the derivation and analysis of effective classes of one-step methods for ODEs
• Multiple invariants conserving Runge-Kutta type methods for Hamiltonian problems
• Analysis of Spectral Hamiltonian Boundary Value Methods (SHBVMs) for the numerical solution of ODE problems
• Arbitrarily high-order energy-conserving methods for Poisson problems

Cited by in corpus (5)

• A spectrally accurate step-by-step method for the numerical solution of fractional differential equations
• Numerical solution of FDE-IVPs by using Fractional HBVMs: the fhbvm code
• Solving FDE-IVPs by using Fractional HBVMs: some experiments with the fhbvm code
• Analysis and implementation of collocation methods for fractional differential equations
• A shooting-Newton procedure for solving fractional terminal value problems