A note on a stable algorithm for computing the fractional integrals of orthogonal polynomials
arXiv:2205.11182 · doi:10.1016/j.aml.2022.108338
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.
8 pages, 3 figures
References in corpus (2)
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