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

05/23/2022

∙

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.

READ FULL TEXT

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

Numerical solution of fractional Fredholm integro-differential equations by spectral method with fractional basis functions

The numerical solution of fractional integral equations via orthogonal polynomials in fractional powers

The Algebraic Theory of Fractional Jumps

Log orthogonal functions: approximation properties and applications

A multi-orthogonal polynomials' approach to bulk queueing theory

Fractional Polynomials Models as Special Cases of Bayesian Generalized Nonlinear Models

Stable factorization for phase factors of quantum signal processing

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

Related Research

Numerical solution of fractional Fredholm integro-differential equations by spectral method with fractional basis functions

The numerical solution of fractional integral equations via orthogonal polynomials in fractional powers

The Algebraic Theory of Fractional Jumps

Log orthogonal functions: approximation properties and applications

A multi-orthogonal polynomials' approach to bulk queueing theory

Fractional Polynomials Models as Special Cases of Bayesian Generalized Nonlinear Models

Stable factorization for phase factors of quantum signal processing