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

05/23/2022
by   P. Amodio, et al.
0

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

page 1

page 2

page 3

page 4

research
09/22/2022

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

This paper presents an efficient spectral method for solving the fractio...
research
06/28/2022

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

We present a spectral method for one-sided linear fractional integral eq...
research
12/29/2019

The Algebraic Theory of Fractional Jumps

In this paper we start by briefly surveying the theory of Fractional Jum...
research
03/02/2020

Log orthogonal functions: approximation properties and applications

We present two new classes of orthogonal functions, log orthogonal funct...
research
07/10/2021

A multi-orthogonal polynomials' approach to bulk queueing theory

We consider a stationary Markov process that models certain queues with ...
research
05/25/2023

Fractional Polynomials Models as Special Cases of Bayesian Generalized Nonlinear Models

We propose a framework for fitting fractional polynomials models as spec...
research
09/25/2019

A Self-consistent-field Iteration for Orthogonal Canonical Correlation Analysis

We propose an efficient algorithm for solving orthogonal canonical corre...

Please sign up or login with your details

Forgot password? Click here to reset