Skip to Content
AxiomsAxioms
  • Article
  • Open Access

6 February 2026

20 Pages

Fractional Inner Products and Orthogonal Polynomial Structures: A Riemann-Liouville Framework for Spectral Approximation

and
1
Department of Mathematics and Statistics, College of Science, King Faisal University, Al Ahsa 31982, Saudi Arabia
2
Department of Mathematics, College of Science, Qassim University, Burydah 52571, Saudi Arabia
*
Author to whom correspondence should be addressed.

Abstract

This paper develops an operator-oriented framework for spectral approximation in fractional calculus by introducing a fractional inner product defined through the Riemann-Liouville integral. Instead of modifying polynomial families, the proposed approach continuously deforms the underlying Hilbert space structure, with the fractional order α acting as a deformation parameter. A central theoretical result shows that this fractional inner product is mathematically equivalent to a classical weighted inner product with a deformed weight w α ( x ) = ( b − x ) α − 1 w ( x ) . This equivalence establishes a rigorous connection between fractional calculus and classical orthogonal polynomial theory and clarifies the structural role of the fractional parameter. For a canonical one-dimensional setting, explicit recurrence relations are derived and the limiting behavior as α → 1 is characterized, recovering the classical theory. The resulting orthogonal systems are naturally compatible with fractional operators and are used to construct spectral Galerkin methods for fractional differential equations. Well-posed variational formulations and optimal convergence rates are established. Numerical experiments illustrate the effectiveness of the framework, demonstrating spectral accuracy and improved performance in the approximation of fractional integrals and selected fractional differential equations when compared with standard polynomial bases. The proposed formulation provides a unifying operator-level perspective for spectral methods in fractional calculus.

1. Introduction

Fractional calculus has emerged as a powerful mathematical framework for modeling complex phenomena with memory and non-local effects, finding applications across physics, engineering, and applied mathematics [1]. The mathematical foundation of fractional calculus relies heavily on special functions [2,3], with recent developments extending to generalized M-series and adaptations of classical functions [4,5]. Orthogonal polynomials constitute another cornerstone of applied mathematics, providing essential tools for approximation theory, numerical analysis, and spectral methods [6,7].
The connection between these two fields has been actively explored. Early work introduced operational matrices for fractional calculus using generalized polynomials [8], a technique later reviewed comprehensively [9]. A prevalent approach in the recent literature involves constructing fractional versions of classical polynomial families, such as fractional Chebyshev polynomials [10] or discrete fractional orthogonal polynomials [11]. This often entails modifying the polynomial recurrence relations or their definitions. Concurrently, spectral methods employing these polynomials have shown remarkable success in solving fractional differential equations (FDEs), including schemes for fractional integral equations [12], nonlinear integro-differential systems [13], and operators involving Jacobi-type polynomials [14]. Recent advancements continue this trend, focusing on numerical schemes built upon specific fractional polynomial bases, such as generalized Chebyshev polynomials [15] or fractional shifted orthogonal functions [16].
However, a systematic, operator-oriented framework for constructing orthogonal systems specifically adapted to fractional operators remains underdeveloped. Most existing approaches either modify the polynomial families themselves or apply classical polynomials within fractional problems without adapting the underlying orthogonality structure to the fractional operator. This can be seen as addressing the “symptom” rather than the “cause.” The non-local nature of fractional operators demands numerical methods whose fundamental structure reflects this property.
In classical orthogonal polynomial theory, the three-term recurrence relation inherently connects to Jacobi continued fractions (J-fractions), which represent the Stieltjes transform of the orthogonality measure. The deformation of the inner product induced by the fractional order α naturally corresponds to an α -parametric deformation of the associated J-fraction coefficients, situating the present framework within the analytical context of continued fraction representations of spectral measures. Recent studies have explored continued fractions in the context of fractional calculus and spectral approximations for non-local operators, highlighting the role of Jacobi matrices and J-fractions in the discretization of fractional differential equations [17]. This connection reinforces the structural coherence of the proposed fractional inner product and aligns our operator-oriented deformation with established spectral and analytic theories of orthogonal functions and continued fractions [18].
This gap motivates the present work, which introduces a fundamentally different perspective. Rather than creating new fractional polynomial families, we propose a continuous deformation of the Hilbert space structure itself. We define a fractional inner product through the action of a Riemann-Liouville fractional integral on the product of two functions. A central theoretical result shows that this construction is equivalent to a classical weighted inner product with a deformed weight w α ( x ) = ( b − x ) α − 1 w ( x ) , where α is the fractional order. This equivalence establishes a rigorous and transparent bridge between fractional calculus and classical orthogonal polynomial theory. Consequently, the parameter α acts as a continuous deformer of the associated orthogonality measure, which may also be interpreted through the spectral theory of Jacobi matrices and their associated continued fractions [19].
In this framework, the resulting orthogonal polynomials are the classical polynomials associated with the deformed weight w α ( x ) . Their properties-including explicit recurrence relations, zero distributions, and quadrature rules-are, therefore, inherited from and analyzed through classical theory, but their behavior under the α -deformation provides new insights. The primary novelty lies not in the polynomials themselves, but in the systematic, operator-induced pathway that generates them, offering a unified structural foundation.
We exploit this natural compatibility to construct spectral Galerkin methods for fractional differential equations, establishing well-posed variational formulations and optimal convergence rates. Numerical experiments confirm the advantages of this operator-adapted approach, demonstrating its effectiveness and spectral convergence for FDEs.
The paper is organized as follows: Section 2 introduces the fractional inner product and establishes its equivalence to a deformed classical weight. Section 3 derives key analytical properties of the resulting polynomial systems. Section 4 examines zeros and associated quadrature rules. Section 5 develops and analyzes spectral methods for FDEs. Section 6 provides comprehensive numerical validation. Section 7 concludes with final remarks and future research directions.

2. Fractional Inner Product and Weight Transformation

This section introduces the core concept of this paper: a fractional deformation of the standard inner product used to define orthogonal polynomials. We show how replacing the classical integral with a specific fractional integral operation leads to a family of weights parameterized by a fractional order, α . To set the stage, we first recall the definition of the Riemann-Liouville fractional integral.
Let [ a , b ] be a finite interval on the real line. For a function f integrable on [ a , b ] and a fractional order α > 0 , the left-sided Riemann-Liouville fractional integral is defined as
I a + α [ f ] ( x ) = 1 Γ ( α ) ∫ a x ( x − t ) α − 1 f ( t ) d t , x ∈ [ a , b ] .

2.1. The Fractional Inner Product

The classical theory of orthogonal polynomials begins with an inner product defined by a weighted integral. We generalize this by employing the Riemann-Liouville fractional integral.
Let w ( x ) be a standard weight function on [ a , b ] . For a given fractional order α > 0 , we define a fractional inner product as follows:
⟨ f , g ⟩ α = I a + α [ f · g · w ] ( b ) .
Writing out the definition of the Riemann-Liouville integral explicitly, this becomes:
⟨ f , g ⟩ α = 1 Γ ( α ) ∫ a b ( b − t ) α − 1 f ( t ) g ( t ) w ( t ) d t .
This is the central object of our study. When α = 1 , we have ( b − t ) 0 = 1 and Γ ( 1 ) = 1 , so the inner product reduces to the classical weighted inner product: ⟨ f , g ⟩ α = 1 = ∫ a b f ( t ) g ( t ) w ( t ) d t .

2.2. Equivalence to a Classical Deformed Weight

A crucial observation, which forms the core theoretical insight of our framework, is that this fractional inner product is equivalent to a standard inner product with a modified weight. By comparing (1) to the classical form, we see that:
⟨ f , g ⟩ α = ∫ a b f ( t ) g ( t ) ( b − t ) α − 1 Γ ( α ) w ( t ) d t .
The factor 1 / Γ ( α ) is a positive constant for a fixed α . Since a constant multiplicative factor does not change the orthogonality structure of polynomials (it only scales the normalization constants), we can define the effective weight function without it:
w α ( x ) = ( b − x ) α − 1 w ( x ) .
Therefore, the family of polynomials { P n ( α ) ( x ) } orthogonal with respect to ⟨ · , · ⟩ α encompasses precisely the classical orthogonal polynomials associated with the deformed weight w α ( x ) . This equivalence is not merely an algebraic identity; it is a central theoretical result that bridges the proposed operator-induced fractional inner product and the rich theory of classical orthogonal polynomials. It clarifies that the fractional parameter α acts as a continuous deformer of the Hilbert space structure at the level of the weight function, distinguishing our approach from constructing new polynomial families.

2.3. Interpretation and a Canonical Example

The transformation from w ( x ) to w α ( x ) = ( b − x ) α − 1 w ( x ) has a clear interpretation. The parameter α controls the behavior of the weight at the right endpoint x = b .
For 0 < α < 1 , the term ( b − x ) α − 1 is singular at x = b , increasing the significance of the function’s behavior near that endpoint. For α = 1 , we recover the original weight. For α > 1 , the term ( b − x ) α − 1 tends to zero as x → b , suppressing the weight near the right endpoint.
This deformation systematically shifts the “balance” of the weight across the interval, which, in turn, deforms the properties of the corresponding orthogonal polynomials.
Example 1 (Canonical Case on [0, 1]).
Consider the simplest case: the interval [ a , b ] = [ 0 , 1 ] and the uniform weight w ( x ) = 1 . The effective weight becomes w α ( x ) = ( 1 − x ) α − 1 . This is the weight function for the Jacobi polynomials P n ( 0 , β ) ( y ) on [ − 1 , 1 ] , with parameter β = α − 1 . After a change of variable, the resulting fractional orthogonal polynomials are:
P n ( α ) ( x ) = P n ( 0 , α − 1 ) ( 2 x − 1 ) .
This example connects our fractional deformation directly to a well-known classical family.
While this canonical case provides explicit formulas and clear intuition, the fractional inner product framework defined in (1) is applicable to general finite intervals [ a , b ] and admissible weight functions w ( x ) . The scope, applicability, and main implications of this generality are discussed in the following subsection.

2.4. Scope and Applicability of the Framework

The fractional inner product framework defined by Equation (1) is valid for any finite interval [ a , b ] and any classical weight function w ( x ) that is integrable on that interval. The fundamental equivalence w α ( x ) = ( b − x ) α − 1 w ( x ) established in (3) holds in this general setting. Consequently, the associated orthogonal polynomials { P n ( α ) ( x ) } are the classical polynomials orthogonal with respect to the deformed weight w α ( x ) .
The canonical case with w ( x ) ≡ 1 on [ 0 , 1 ] , detailed in Example 1, is presented for its analytical transparency. It yields explicit recurrence relations and a direct identification with the Jacobi polynomial family. For an arbitrary admissible weight w ( x ) , while such closed-form expressions may not be available, the essential theoretical properties-including the existence of a three-term recurrence, the interlacing of zeros, and the convergence of spectral methods derived in subsequent sections-follow directly from the classical theory of orthogonal polynomials for the weight w α ( x ) .
Therefore, the framework provides a general method for generating orthogonal polynomial systems adapted to the Riemann-Liouville integral operator. The canonical example serves as a paradigmatic illustration of the deformation induced by the fractional order α , whose effects on the weight, polynomials, and zeros are analytically clear and numerically verifiable.

3. Analytical Properties of the Fractional Deformation

This section is dedicated to a rigorous analysis of the mathematical properties arising from the fractional deformation of the inner product, as defined in Equation (1). We establish explicit formulations, prove fundamental structural properties, and demonstrate the consistency of the framework by showing its continuous connection to the classical theory. For analytical clarity and to obtain the simplest form of the recurrence relations, we work primarily with monic orthogonal polynomials, denoted by P ˜ n ( α ) ( x ) , where the leading coefficient is unity. This choice is standard in the theoretical analysis of orthogonal polynomial systems, as it simplifies the derivation of explicit recurrence coefficients, ensures the associated Jacobi matrix is symmetric, and facilitates connections to classical results [6,7].

3.1. Explicit Formulation and Norms for the Canonical Case

The canonical case, where w ( x ) ≡ 1 on [ 0 , 1 ] , provides a tractable model where explicit results can be derived, offering insight into the general behavior induced by the parameter α .
Proposition 1 (Explicit monic form and norm on [0, 1]).
Let [ a , b ] = [ 0 , 1 ] and w ( x ) ≡ 1 . Set β ≔ α − 1 , so w α ( x ) = ( 1 − x ) β . The monic orthogonal polynomials P ˜ n ( α ) (with respect to (1)) are
P ˜ n ( α ) ( x ) = Γ ( n + 1 ) Γ ( n + α ) Γ ( 2 n + α ) P n ( 0 , α − 1 ) ( 2 x − 1 ) ,
and their squared norms are
h n ( α ) = 1 Γ ( α ) Γ ( n + 1 ) 2 Γ ( n + α ) 2 Γ ( 2 n + α ) 2 1 2 n + α .
Proof. 
With y = 2 x − 1 , one has d x = d y / 2 and ( 1 − x ) β = 2 − β ( 1 − y ) β . Hence,
∫ 0 1 P n ( 0 , β ) ( 2 x − 1 ) 2 ( 1 − x ) β d x = 2 − β − 1 ∫ − 1 1 P n ( 0 , β ) ( y ) 2 ( 1 − y ) β d y .
The Jacobi norm is ∫ − 1 1 [ P n ( 0 , β ) ] 2 ( 1 − y ) β d y = 2 β + 1 2 n + β + 1 , so on [ 0 , 1 ] ,
∫ 0 1 P n ( 0 , β ) ( 2 x − 1 ) 2 ( 1 − x ) β d x = 1 2 n + β + 1 = 1 2 n + α .
The leading coefficient of P n ( 0 , β ) ( y ) in y is 1 2 n 2 n + β n . After y = 2 x − 1 , the leading coefficient in x becomes Γ ( 2 n + α ) Γ ( n + 1 ) Γ ( n + α ) . Its reciprocal gives the monic factor c n ( α ) = Γ ( n + 1 ) Γ ( n + α ) Γ ( 2 n + α ) , yielding (5).
Finally, by (5) and (8),
h n ( α ) = 1 Γ ( α ) ∫ 0 1 P ˜ n ( α ) ( x ) 2 ( 1 − x ) α − 1 d x = 1 Γ ( α ) c n ( α ) 2 · 1 2 n + α ,
which is (6).   □

3.2. The Three-Term Recurrence Relation

A fundamental property that uniquely characterizes orthogonal polynomial systems is the three-term recurrence relation they satisfy. We now prove that the polynomials generated by the fractional inner product inherit this property.
Theorem 1 (Three-Term Recurrence Relation).
The sequence of monic polynomials { P ˜ n ( α ) ( x ) } orthogonal with respect to the inner product ⟨ · , · ⟩ α satisfies a three-term recurrence relation
x P ˜ n ( α ) ( x ) = P ˜ n + 1 ( α ) ( x ) + a n ( α ) P ˜ n ( α ) ( x ) + b n ( α ) P ˜ n − 1 ( α ) ( x ) , n ≥ 0 ,
with initial conditions P ˜ − 1 ( α ) ( x ) = 0 and P ˜ 0 ( α ) ( x ) = 1 . The coefficients are given by
a n ( α ) = ⟨ x P ˜ n ( α ) , P ˜ n ( α ) ⟩ α h n ( α ) , b n ( α ) = h n ( α ) h n − 1 ( α ) > 0 .
Proof. 
Since ⟨ · , · ⟩ α is a positive definite inner product on polynomials, Favard’s theorem yields a three-term recurrence for the monic family. For n ≥ 0 ,
x P ˜ n ( α ) ( x ) = ∑ k = 0 n + 1 c n , k P ˜ k ( α ) ( x ) , c n , k = ⟨ x P ˜ n ( α ) , P ˜ k ( α ) ⟩ α h k ( α ) .
By symmetry, ⟨ x P ˜ n ( α ) , P ˜ k ( α ) ⟩ α = ⟨ P ˜ n ( α ) , x P ˜ k ( α ) ⟩ α . If k ≤ n − 2 , then deg ( x P ˜ k ( α ) ) = k + 1 ≤ n − 1 ; hence, it is orthogonal to P ˜ n ( α ) . Thus, c n , k = 0 . Therefore, only k = n + 1 , n , n − 1 remain, giving (10). Taking inner products with P ˜ n ( α ) and P ˜ n − 1 ( α ) yields the formulas for a n ( α ) and b n ( α ) in (11).
To confirm the explicit form of b n ( α ) , consider the recurrence (10) for index n − 1 :
x P ˜ n − 1 ( α ) ( x ) = P ˜ n ( α ) ( x ) + a n − 1 ( α ) P ˜ n − 1 ( α ) ( x ) + b n − 1 ( α ) P ˜ n − 2 ( α ) ( x ) .
Taking the inner product of both sides with P ˜ n ( α ) and using orthogonality ( ⟨ P ˜ n − 1 ( α ) , P ˜ n ( α ) ⟩ α = 0 and ⟨ P ˜ n − 2 ( α ) , P ˜ n ( α ) ⟩ α = 0 ) gives
⟨ x P ˜ n − 1 ( α ) , P ˜ n ( α ) ⟩ α = ⟨ P ˜ n ( α ) , P ˜ n ( α ) ⟩ α = h n ( α ) .
Comparing this result with the expression for b n ( α ) obtained from (11), namely b n ( α ) = ⟨ x P ˜ n − 1 ( α ) , P ˜ n ( α ) ⟩ α / h n − 1 ( α ) , we conclude that b n ( α ) = h n ( α ) / h n − 1 ( α ) > 0 .   □

3.3. Limiting Behavior and Consistency with the Classical Case

We now prove that the fractional deformation is a continuous generalization of the classical theory.
Theorem 2 (Continuous Limit to Classical Polynomials).
Let { P ˜ n ( α ) ( x ) } be the sequence of monic orthogonal polynomials with respect to ⟨ · , · ⟩ α . Then, for any fixed n ∈ N ,
lim α → 1 P ˜ n ( α ) ( x ) = P ˜ n ( x ) ,
where P ˜ n ( x ) is the monic polynomial orthogonal with respect to the classical inner product ⟨ f , g ⟩ = ∫ a b f ( x ) g ( x ) w ( x ) d x . The convergence is uniform on [ a , b ] .
Proof. 
By Proposition 1, P ˜ n ( α ) is the monic orthogonal polynomial for the weight w α ( x ) = ( b − x ) α − 1 w ( x ) (the prefactor 1 / Γ ( α ) in the inner product does not affect orthogonality). Fix n and restrict α to a neighborhood of 1, e.g., α ∈ [ 1 2 , 3 2 ] . Then, for all such α ,
0 ≤ ( b − x ) α − 1 ≤ ( b − x ) − 1 / 2 on [ a , b ) ,
and ( b − x ) − 1 / 2 w ( x ) is integrable (classical orthogonal polynomial weights are integrable with these exponents). By dominated convergence, μ k ( α ) ≔ ∫ a b x k w α ( x ) d x → μ k ≔ ∫ a b x k w ( x ) d x for all k. The coefficients of the monic orthogonal polynomial of fixed degree n are continuous rational functions of the first 2 n moments (via Hankel determinants). Hence, the coefficients of P ˜ n ( α ) ( x ) = x n + ∑ j = 0 n − 1 a n , j ( α ) x j converge to those of the classical monic P ˜ n ( x ) as α → 1 . Coefficientwise convergence for a fixed degree implies uniform convergence on [ a , b ] .   □

4. Zeros and Quadrature for Fractional Orthogonal Polynomials

This section examines the distribution of zeros of the fractional orthogonal polynomials and their application to numerical quadrature. While the theoretical framework relies on the classical theory applied to the deformed weight w α ( x ) , our contribution lies in the analysis of how the fractional parameter α deforms the zero distribution and enables efficient computation of fractional integrals. We assume throughout that α > 0 , so that w α ( x ) = ( b − x ) α − 1 w ( x ) defines a positive weight function on [ a , b ] .

4.1. Classical Zero Properties

The polynomials { P ˜ n ( α ) ( x ) } , being orthogonal with respect to the positive weight w α ( x ) , inherit the fundamental analytical properties of classical orthogonal polynomial systems. The following well-known theorem summarizes these properties for our deformed setting.
Theorem 3 ([7,20]).
The monic orthogonal polynomials { P ˜ n ( α ) ( x ) } with respect to w α ( x ) on ( a , b ) have all zeros real, simple, and contained in ( a , b ) . The zeros of P ˜ n ( α ) ( x ) and P ˜ n + 1 ( α ) ( x ) strictly interlace.
As α increases, the factor ( b − x ) α − 1 increasingly emphasizes the region near x = a , which induces a leftward migration of zeros that we will quantify numerically.

4.2. Spectral Interpretation

The zeros of orthogonal polynomials can be computed efficiently via symmetric eigenvalue problems. For our framework, this involves the Jacobi matrix formed by the recurrence coefficients derived from the deformed weight w α ( x ) .
Theorem 4 ([7]).
Let J n ( α ) be the n × n symmetric tridiagonal Jacobi matrix defined by
J n ( α ) = a 0 ( α ) b 1 ( α ) b 1 ( α ) a 1 ( α ) ⋱ ⋱ ⋱ b n − 1 ( α ) b n − 1 ( α ) a n − 1 ( α ) ,
where a k ( α ) and b k ( α ) are the recurrence coefficients from (10) and (11). Then, the zeros of P ˜ n ( α ) ( x ) are the eigenvalues of J n ( α ) .
This spectral framework provides the computational basis for tracking the evolution of zeros with α , directly linking the operator-induced deformation of the inner product to the spectral properties of the associated Jacobi matrix.

4.3. Numerical Investigation of Zero Migration

To illustrate the analytical sensitivity result (16), we now present a numerical investigation of zero migration as α varies. The following computations visualize the leftward drift of zeros predicted by the deformation of w α ( x ) .
To visualize and quantify the theoretical deformation of the zero distribution induced by the parameter α , we now present a numerical investigation. For the canonical case [ a , b ] = [ 0 , 1 ] with w ( x ) = 1 , the monic recurrence coefficients are known explicitly [7]:
a n ( α ) = 1 2 + ( α − 1 ) 2 2 ( 2 n + α − 1 ) ( 2 n + α + 1 ) ,
b n ( α ) = n 2 ( n + α − 1 ) 2 ( 2 n + α − 2 ) ( 2 n + α − 1 ) 2 ( 2 n + α ) .
Proposition 2 (Zero Sensitivity [21,22]).
Let x k ( α ) be the k-th zero of P ˜ n ( α ) ( x ) , and let v k ( α ) be the corresponding normalized eigenvector of J n ( α ) . Then,
d x k ( α ) d α = ⟨ v k ( α ) , ( J n ( α ) ) ′ v k ( α ) ⟩ ,
where ( J n ( α ) ) ′ has diagonal entries ( a i − 1 ( α ) ) ′ and off-diagonal entries 1 2 ( b i ( α ) ) ′ / b i ( α ) .
Proof. 
This follows from first-order perturbation theory for symmetric matrices. Differentiating the eigenvalue equation J n ( α ) v k ( α ) = x k ( α ) v k ( α ) with respect to α and taking the inner product with v k ( α ) yields the result. See [21,22].   □
The following computations illustrate this sensitivity. We compute zeros for n = 3 , 4 , 5 across α ∈ [ 0.2 , 2.0 ] using the Golub-Welsch algorithm applied to J n ( α ) . The results show a monotone leftward drift of all zeros as α increases, with the rightmost zero exhibiting the largest displacement. This is consistent with the weight w α ( x ) = ( 1 − x ) α − 1 concentrating mass near x = 0 as α grows, thereby pulling the zeros toward the left endpoint.

4.4. Fractional Gaussian Quadrature

The zeros of orthogonal polynomials yield optimal quadrature rules for the corresponding weight function. For our framework, this provides a high-order method for evaluating integrals with the deformed weight w α ( x ) , which is directly applicable to Riemann-Liouville fractional integrals.
Theorem 5 ([23]).
Let { x k ( α ) } k = 1 n be the zeros of P ˜ n ( α ) ( x ) with weights
λ k ( α ) = 1 ∑ j = 0 n − 1 [ P ˜ j ( α ) ( x k ( α ) ) ] 2 / h j ( α ) .
Then, the quadrature rule Q n ( α ) [ f ] = ∑ k = 1 n λ k ( α ) f ( x k ( α ) ) is exact for polynomials of degree ≤ 2 n − 1 .
Proposition 3 (Fractional Integral Quadrature).
For the Riemann-Liouville integral I a + α [ f ] ( b ) = 1 Γ ( α ) ∫ a b ( b − t ) α − 1 f ( t ) d t , we have
I a + α [ f ] ( b ) ≈ 1 Γ ( α ) Q n ( α ) [ f ]
with error bound
| E n | ≤ C n ( α ) ( 2 n ) ! max ξ ∈ [ a , b ] | f ( 2 n ) ( ξ ) | ,
where C n ( α ) = 1 Γ ( α ) ∫ a b | K 2 n ( α ) ( ξ ) | d ξ depends on both α and n.
Proof. 
The result follows from the Peano kernel theorem applied to the Gaussian quadrature rule (see, e.g., Section 3.2 in [6,23] for the standard formulation).   □
For f ( x ) = x 3 / 2 and α = 1.5 , our quadrature achieves errors of order 10 − 3 , 10 − 4 , and 10 − 5 for n = 3 , 4 , 5 respectively, demonstrating rapid convergence.

4.5. Discussion

This section has established that while the analytical properties of the zeros and quadrature rules follow from classical theory applied to the weight w α ( x ) , their behavior under the α -deformation reveals systematic and quantifiable patterns. The spectral framework enables efficient computation of the evolving zeros, directly linking the operator-induced deformation of the inner product to the spectral properties of a parameter-dependent Jacobi matrix. The resulting quadrature rules provide high precision for fractional integrals, with convergence rates dictated by the smoothness of the integrand. The observed leftward migration of zeros quantitatively illustrates how the fractional parameter α reshapes the orthogonality measure, offering both theoretical insight into the structure of the deformed Hilbert space and practical computational tools for fractional calculus.

5. Applications to Fractional Differential Equations

This section develops a rigorous spectral framework for fractional differential equations (FDEs) using the fractional orthogonal polynomials constructed in the previous sections. We establish rigorous theoretical results with complete proofs and demonstrate computational advantages. To begin, we recall necessary definitions. For γ > 0 and a function f sufficiently regular on [ a , b ] , the left and right Riemann-Liouville fractional derivatives are defined, respectively, as
D a + γ f ( x ) = d ⌈ γ ⌉ d x ⌈ γ ⌉ I a + ⌈ γ ⌉ − γ f ( x ) , D b − γ f ( x ) = ( − 1 ) ⌈ γ ⌉ d ⌈ γ ⌉ d x ⌈ γ ⌉ I b − ⌈ γ ⌉ − γ f ( x ) ,
where ⌈ · ⌉ denotes the ceiling function.

5.1. Variational Formulation and Well-Posedness

We consider a symmetric fractional boundary value problem that serves as a canonical model for studying spectral methods. This type of problem arises in steady-state fractional diffusion models, such as those describing anomalous transport in heterogeneous media or viscoelastic materials [24,25]. The equation takes the form:
− D b − α / 2 p ( x ) D a + α / 2 u ( x ) + q ( x ) u ( x ) = f ( x ) , x ∈ ( a , b ) , I a + 1 − α / 2 u ( a ) = 0 , I b − 1 − α / 2 u ( b ) = 0 ,
where 1 < α < 2 , p ( x ) ≥ p 0 > 0 , and q ( x ) ≥ q 0 ≥ 0 . The boundary conditions involve Riemann-Liouville fractional integrals of order 1 − α / 2 evaluated at the endpoints. These conditions are the natural counterparts to standard Dirichlet conditions for this fractional operator, ensuring the problem is well-posed in the following energy space.
Definition 1.
The energy space V is defined as:
V = u ∈ L 2 ( a , b ) : D a + α / 2 u ∈ L 2 ( a , b ) , I a + 1 − α / 2 u ( a ) = I b − 1 − α / 2 u ( b ) = 0
with norm ∥ u ∥ V 2 = ∥ u ∥ L 2 2 + ∥ D a + α / 2 u ∥ L 2 2 . For functions in V, the left and right fractional derivatives of order α / 2 are equivalent in the L 2 sense [24]; thus, the use of D b − α / 2 in the bilinear form below is justified. The boundary conditions I a + 1 − α / 2 u ( a ) = 0 and I b − 1 − α / 2 u ( b ) = 0 are the natural fractional analogues of classical Dirichlet conditions for this operator. They ensure the well-posedness of the variational problem in the energy space V and arise physically in diffusion problems where the flux vanishes at the boundaries [24,25].
Theorem 6 (Well-posedness).
For f ∈ L 2 ( a , b ) , the variational problem: find u ∈ V such that
a ( u , v ) = ⟨ f , v ⟩ ∀ v ∈ V ,
where the symmetric bilinear form is
a ( u , v ) = ⟨ p D a + α / 2 u , D b − α / 2 v ⟩ + ⟨ q u , v ⟩ ,
has a unique solution satisfying ∥ u ∥ V ≤ C ∥ f ∥ L 2 .
Proof. 
We first prove continuity. Using the Cauchy-Schwarz inequality and the equivalence of derivatives in V,
| a ( u , v ) | ≤ ∥ p ∥ ∞ ∥ D a + α / 2 u ∥ L 2 ∥ D b − α / 2 v ∥ L 2 + ∥ q ∥ ∞ ∥ u ∥ L 2 ∥ v ∥ L 2 ≤ M ∥ u ∥ V ∥ v ∥ V .
For coercivity, using a fractional Poincaré inequality [24],
a ( u , u ) ≥ p 0 ∥ D a + α / 2 u ∥ L 2 2 + q 0 ∥ u ∥ L 2 2 ≥ C ∥ u ∥ V 2 .
The result follows by the Lax-Milgram lemma.   □

5.2. Spectral Method with Fractional Orthogonal Basis

We construct a finite-dimensional subspace of V using our fractional orthogonal polynomials. Let { ψ k ( α ) } be the basis functions obtained by modifying the standard fractional orthogonal polynomials P ˜ k ( α ) to satisfy the homogeneous boundary conditions of (20), namely I a + 1 − α / 2 ψ k ( α ) ( a ) = I b − 1 − α / 2 ψ k ( α ) ( b ) = 0 . A standard approach is to apply a Gram-Schmidt orthogonalization process within the constrained space V. Define the approximation space as
V N = span { ψ 1 ( α ) , … , ψ N ( α ) } ⊂ V .
For a given f ∈ L 2 ( a , b ) , the Galerkin approximation u N ∈ V N is the unique element satisfying
a ( u N , v N ) = ⟨ f , v N ⟩ ∀ v N ∈ V N .
To analyze convergence, we recall the standard Sobolev space H σ ( a , b ) , σ ≥ 0 , equipped with the norm ∥ · ∥ H σ .
Theorem 7 (Spectral Convergence).
Let u ∈ V ∩ H σ ( a , b ) with σ > α / 2 be the solution of (22), and let u N ∈ V N be its Galerkin approximation defined by (27). Then, the following error estimate holds:
∥ u − u N ∥ V ≤ C N − σ + α / 2 ∥ u ∥ H σ .
Proof. 
By Céa’s lemma and the best approximation property,
∥ u − u N ∥ V ≤ C inf v N ∈ V N ∥ u − v N ∥ V .
For any v N ∈ V N , we have:
∥ u − v N ∥ V 2 = ∥ u − v N ∥ L 2 2 + ∥ D a + α / 2 ( u − v N ) ∥ L 2 2 .
Using the approximation properties of fractional orthogonal polynomials in weighted Sobolev spaces,
inf v N ∈ V N ∥ u − v N ∥ L 2 ≤ C 1 N − σ ∥ u ∥ H σ ,
inf v N ∈ V N ∥ D a + α / 2 ( u − v N ) ∥ L 2 ≤ C 2 N − σ + α / 2 ∥ u ∥ H σ .
Combining these estimates gives the result.   □

5.3. Fractional Sturm-Liouville Theory

The spectral framework naturally applies to eigenvalue problems associated with the fractional operator defined in (20). The fractional orthogonal polynomials provide an efficient basis for approximating the eigenfunctions of such operators.
Theorem 8 (Eigenfunction Approximation).
Consider the fractional Sturm-Liouville operator,
L α [ u ] = − D b − α / 2 p D a + α / 2 u + q u .
Let ( λ , u ) be an eigenpair of L α with u ∈ V ∩ H σ ( a , b ) , σ > 0 , and u ≠ 0 . Then, the Galerkin approximation u N ∈ V N obtained using the fractional orthogonal polynomial basis satisfies the following approximation error bound:
∥ u − u N ∥ V ≤ C N − σ ∥ u ∥ H σ .
Proof. 
Under the assumptions of Section 5.1, the operator L α is self-adjoint and positive definite on V with compact resolvent. Its eigenfunctions form a complete orthonormal basis in L 2 ( a , b ) . The approximation result follows from the regularity theory for fractional Sturm-Liouville problems [25] and the approximation properties of our polynomials.   □

5.4. Computational Framework and Complexity Analysis

The spectral method implementation consists of the following steps:
  • Construct the basis { ψ k ( α ) } from { P ˜ k ( α ) } satisfying the boundary conditions as described in Section 5.2.
  • Compute the stiffness matrix A with entries A i j = a ( ψ i ( α ) , ψ j ( α ) ) and the load vector F with entries F i = ⟨ f , ψ i ( α ) ⟩ .
  • Solve the linear system A c = F for the coefficient vector c = ( c 1 , … , c N ) T .
  • Form the approximation u N ( x ) = ∑ k = 1 N c k ψ k ( α ) ( x ) .
The conditioning of the stiffness matrix is crucial for numerical stability. The condition number κ ( A ) = ∥ A ∥ 2 ∥ A − 1 ∥ 2 -defined with respect to the Euclidean ( l 2 ) matrix norm-grows algebraically with the approximation order N, consistent with the non-local character of fractional diffusion operators.
Theorem 9 (Matrix Properties).
The stiffness matrix A is symmetric positive definite. For fixed α > 1 , under standard inverse estimates for fractional Sobolev spaces, its condition number satisfies the bound
κ ( A ) ≲ N 2 α .
Proof. 
Symmetry follows from the symmetry of the bilinear form a ( · , · ) . For the condition number estimate, we rely on the inverse inequality for fractional Sobolev spaces [24], which yields the following spectral bounds:
λ min ( A ) ≥ C 1 N − 2 α , λ max ( A ) ≤ C 2 ,
where λ min ( A ) and λ max ( A ) denote the smallest and largest eigenvalues of A, respectively. The bound κ ( A ) ≲ N 2 α follows directly.   □

5.5. Numerical Experiments

The following examples are designed to illustrate the convergence behavior and computational efficiency of the proposed spectral method for representative smooth and time-dependent test problems.
Example 2 (Fractional Poisson Equation).
To validate the spectral convergence of the method for a smooth solution, we consider the fractional Poisson equation D 0 + α u ( x ) = f ( x ) on [ 0 , 1 ] with homogeneous boundary conditions. We take the exact solution u ( x ) = x 3 ( 1 − x ) 3 and compute the corresponding right-hand side f ( x ) = D 0 + α [ x 3 ( 1 − x ) 3 ] analytically. Our spectral method achieves the errors and convergence rates shown in Table 1 for α = 1.5 , a typical value in the super-diffusive regime.
Table 1. L 2 error and convergence rate for the fractional Poisson equation (Example 2) with α = 1.5 .
The error decay demonstrates exponential (spectral) convergence, with the convergence rate increasing with N.
Example 3 (Space-Fractional Diffusion).
To demonstrate the method’s efficiency for a time-dependent problem and compare it with a standard discretization, we consider the space-fractional diffusion equation u t = − D 0 + α u on [ 0 , 1 ] . We use the initial condition u ( x , 0 ) = sin ( π x ) and homogeneous Dirichlet boundary conditions. We discretize in time using a Crank-Nicolson scheme with Δ t = 0.001 and in space using our spectral method. Table 2 compares the accuracy and computational cost of our method against a standard finite difference method for α = 1.5 at t = 1.0 .
Table 2. Comparison of the spectral method and a finite difference method for the space-fractional diffusion equation (Example 3) at t = 1.0 , α = 1.5 .
The results show that our method achieves higher accuracy with fewer degrees of freedom and reduced computational time.

5.6. Discussion

This section has developed a spectral framework for fractional differential equations based on fractional orthogonal polynomials. The theoretical analysis demonstrates that:
  • The variational formulation is well-posed in the energy space V, ensuring the existence and uniqueness of solutions.
  • Spectral convergence rates are achieved for sufficiently regular solutions, with error bounds exhibiting algebraic decay of order N − σ + α / 2 in the energy norm.
  • The computational framework maintains an algebraic condition number growth of O ( N 2 α ) , which is characteristic of fractional operators.
Numerical experiments confirm the theoretical convergence rates and demonstrate the practical efficiency of the method. The use of fractional orthogonal polynomials as basis functions appears particularly advantageous, as they naturally incorporate the endpoint behavior induced by the fractional inner product. The algebraic growth in condition number suggests that preconditioning strategies may be beneficial for large-scale problems, representing a practical direction for future work.
This framework provides a rigorous foundation for operator-adapted spectral methods in fractional calculus, specifically tailored to the operator-induced structure developed in this paper.

6. Numerical Experiments and Validation

This section provides comprehensive numerical validation of the theoretical framework developed in this work. We demonstrate the superior performance of fractional orthogonal polynomials through rigorous testing and comparison with classical methods.

6.1. Experimental Methodology

All computations were performed in MATLAB R2023a, (Version 9.14, The MathWorks, Inc., Natick, MA, USA) with double-precision arithmetic. The fractional orthogonal polynomials were first generated via the three-term recurrence relation derived in Section 3.2 and subsequently modified to satisfy the boundary conditions as described in Section 5.2. For the canonical case [ a , b ] = [ 0 , 1 ] with w ( x ) = 1 , we have explicit formulas for the recurrence coefficients of the monic polynomials P ˜ n ( α ) ( x ) :
a n ( α ) = 1 2 + ( α − 1 ) 2 2 ( 2 n + α − 1 ) ( 2 n + α + 1 ) ,
b n ( α ) = n 2 ( n + α − 1 ) 2 ( 2 n + α − 2 ) ( 2 n + α − 1 ) 2 ( 2 n + α ) .
We consider three test functions representing distinct regularity classes relevant to fractional calculus:
  • f 1 ( x ) = cos ( 2 π x ) —An analytic function to demonstrate spectral-type convergence in the ideal case.
  • f 2 ( x ) = x 3 − α ( 1 − x ) —A function with a boundary layer of order x 3 − α near x = 0 , designed to test the method’s accuracy for solutions with typical fractional endpoint behavior.
  • f 3 ( x ) = x − 1 / 4 ( 1 − x ) − 1 / 4 —A function with weak singularities at both endpoints, representing a challenging case with limited regularity.
The fractional order α is primarily chosen from the interval ( 1 , 2 ) , as this range is most common in applications such as space-fractional diffusion and viscoelastic modeling. We additionally include representative values below 1 (e.g., α = 0.5 ) in specific experiments to illustrate the broader applicability of the framework.

6.2. Approximation Theory and Error Analysis

To support the interpretation of the numerical results, we recall a standard projection estimate in the weighted Sobolev spaces associated with our framework.
Theorem 10 (Projection Estimate in Weighted Sobolev Spaces).
Let σ ∈ N and let H α σ ( 0 , 1 ) denote the weighted Sobolev space with weight w α ( x ) = ( 1 − x ) α − 1 and norm
∥ f ∥ H α σ 2 = ∑ k = 0 σ ∫ 0 1 | D k f ( x ) | 2 w α ( x ) d x .
For f ∈ H α σ ( 0 , 1 ) , the orthogonal projection f N ( x ) = ∑ k = 0 N c k P ˜ k ( α ) ( x ) onto the space of monic fractional orthogonal polynomials satisfies:
∥ f − f N ∥ L w α 2 ≤ C N − σ | f | H α σ .
For analytic functions, the convergence is spectral: ∥ f − f N ∥ L w α 2 ≤ C ρ − N for some ρ > 1 .
Proof. 
Since { P ˜ k ( α ) } forms a complete orthogonal system in L w α 2 ( 0 , 1 ) , the projection error satisfies:
∥ f − f N ∥ L w α 2 2 = ∑ k = N + 1 ∞ | c k | 2 h k ( α ) .
The decay rate of coefficients c k is determined by the regularity of f in H α σ . For analytic functions, the coefficients decay exponentially, yielding spectral convergence.   □
To validate the approximation estimates, we compute the weighted projection errors ∥ f − f N ∥ L w α 2 for the test functions defined in Section 6.1. The strongly singular function f 3 is excluded from this convergence test, as it does not belong to H α σ ( 0 , 1 ) for the values of σ considered here. Table 3 reports these errors and the corresponding estimated convergence rates for α = 1.5 with an increasing polynomial degree N, using our fractional orthogonal polynomial basis. The results confirm the theoretical spectral convergence for the analytic function f 1 , where the error decreases by a factor of approximately 10 3 each time N is doubled (Rate ≈ 4.0 ), and the algebraic convergence for the function with a boundary layer ( f 2 ).
Table 3. Projection errors ∥ f − f N ∥ L w α 2 and convergence rates for α = 1.5 using the fractional orthogonal polynomial basis.
The convergence rates demonstrated in Table 3 illustrate the effectiveness of the fractional orthogonal polynomial basis for approximating functions within the deformed weighted space induced by the fractional inner product.

6.3. Operator-Adapted Approximation for Fractional Integrals

A key advantage of the proposed framework is that the fractional orthogonal polynomials provide a natural representation for fractional calculus operations. This is formalized in the following optimality result concerning the Riemann-Liouville fractional integral.
Theorem 11 (Optimality for Fractional Integral Approximation).
For the Riemann-Liouville fractional integral I 0 + α , the approximation I 0 + α f N ( α ) based on the orthogonal projection f N ( α ) ( x ) = ∑ k = 0 N c k P ˜ k ( α ) ( x ) satisfies the minimal error property among all fractional integrals of polynomials of degree N:
∥ I 0 + α f − I 0 + α f N ( α ) ∥ L 2 = min p N ∈ P N ∥ I 0 + α f − I 0 + α p N ∥ L 2 .
Proof. 
The proof relies on the observation that the fractional integral operator I 0 + α maps the approximation space P N into itself. Specifically, for the monic basis functions P ˜ k ( α ) ( x ) = Γ ( k + 1 ) Γ ( k + α ) Γ ( 2 k + α ) P k ( 0 , α − 1 ) ( 2 x − 1 ) , we have:
I 0 + α P ˜ k ( α ) ( x ) = Γ ( k + 1 ) Γ ( k + α + 1 ) x k + α 2 F 1 ( − k , k + α ; α + 1 ; 1 − x ) ,
where the terminating hypergeometric function ensures the result belongs to the finite-dimensional space spanned by { P ˜ j ( α ) } j = 0 k . This invariance property means that the operator I 0 + α commutes with orthogonal projection onto P N with respect to the fractional inner product. Since the orthogonal projection f N ( α ) minimizes the error ∥ f − g ∥ L w α 2 over all g ∈ P N , and the operator I 0 + α is linear and leaves P N invariant, the approximation I 0 + α f N ( α ) inherits the same optimality in the L 2 norm.   □
The practical benefit of this theoretical optimality is demonstrated by comparing the accuracy of fractional integral approximations. Table 4 compares the errors in computing I 0 + 1.5 f for the three test functions using a fixed approximation degree N = 10 . The fractional orthogonal polynomial (FOP) basis is compared against classical Legendre and Jacobi polynomial bases.
Table 4. Comparison of fractional integral approximation errors ∥ I 0 + 1.5 f − I 0 + 1.5 f 10 ∥ L 2 for α = 1.5 and N = 10 .
As shown in Table 4, the fractional orthogonal polynomial basis achieves consistently lower approximation errors across all test functions, with error reductions of approximately one order of magnitude for the smooth function f 1 and up to two orders of magnitude for the functions with boundary layer ( f 2 ) and singular ( f 3 ) behavior. This enhanced performance underscores the advantage of using an operator-tailored basis for fractional integral approximations.

6.4. Spectral Convergence for Fractional Differential Equations

This subsection focuses on convergence behavior rather than absolute accuracy, isolating the influence of the fractional order α on high-order algebraic convergence rates. We solve the fractional boundary value problem from Section 5 to validate the theoretical error estimate of Theorem 7.
We consider the problem:
− D 1 − α / 2 D 0 + α / 2 u ( x ) + u ( x ) = f ( x ) , I 0 + 1 − α / 2 u ( 0 ) = I 1 − 1 − α / 2 u ( 1 ) = 0 ,
with a manufactured smooth solution u ( x ) = x 3 ( 1 − x ) 3 , for which the right-hand side f ( x ) is computed analytically.
To quantify the convergence, we compute the energy norm errors ∥ u − u N ∥ V (where ∥ · ∥ V is defined in (21)) of the Galerkin approximation. Table 5 presents these errors for an increasing polynomial degree N and different fractional orders α . The reported convergence rate is representative and computed from successive refinements using the dominant decay observed across the tested fractional orders.
Table 5. Energy norm errors ∥ u − u N ∥ V and convergence rates for the fractional differential Equation (42).
The convergence behavior is visualized in Figure 1, which plots the energy norm error against the polynomial degree N on a log-log scale for α = 1.2 , 1.5 , 1.8 . For reference, lines corresponding to the theoretical algebraic decay rate O ( N − σ + α / 2 ) from Theorem 7 are included, assuming sufficient solution regularity ( σ ).
Figure 1. Energy norm convergence for the fractional differential Equation (42). The markers show the numerical error for different α , and the dashed lines indicate the theoretical convergence slope from Theorem 7.
As shown in Figure 1, the numerical error decay aligns with the theoretical prediction. The results demonstrate high-order algebraic convergence of the method. For a fixed solution regularity σ , the theoretical rate N − σ + α / 2 predicts a slower decay as α increases. This trend is reflected in both Table 5 and the figure, where smaller values of α exhibit slightly steeper convergence slopes. The consistent alignment between the computed errors and the theoretical slopes provides strong validation of the error estimate in Theorem 7.

6.5. Conditioning and Computational Efficiency

The conditioning of the stiffness matrix is crucial for the numerical stability of the spectral method. We analyze the growth of the condition number κ ( A ) = ∥ A ∥ 2 ∥ A − 1 ∥ 2 = λ max ( A ) / λ min ( A ) , defined in the Euclidean ( l 2 ) norm, where A is the stiffness matrix with entries A i j = a ( ψ i ( α ) , ψ j ( α ) ) for the constrained basis { ψ k ( α ) } defined in Section 5.2.
Theorem 12 (Stiffness Matrix Conditioning).
The condition number κ ( A ) of the stiffness matrix grows algebraically with the approximation order N:
κ ( A ) = O ( N 2 α ) .
Proof. 
The stiffness matrix for fractional operators exhibits algebraic conditioning growth due to the non-local nature of fractional derivatives. Using inverse inequalities for fractional Sobolev spaces (see, e.g., [24]) and spectral estimates for the underlying Jacobi-type basis, the extremal eigenvalues satisfy:
λ min ( A ) ≍ N − 2 α , λ max ( A ) ≍ 1 .
The boundedness of λ max ( A ) follows from the continuity of the bilinear form a ( · , · ) on the energy space V. The ratio in (29) directly gives the stated growth rate κ ( A ) ≍ N 2 α , which is consistent with known results for fractional spectral methods.   □
The growth trend stated in Theorem 12 is illustrated in Figure 2, which plots κ ( A ) against N for different fractional orders α . The numerical estimates (markers) closely follow the theoretical asymptotic curves (dashed lines), confirming the algebraic scaling. This behavior highlights a characteristic computational trade-off in fractional spectral methods: while high-order convergence is achieved, the linear systems become progressively ill-conditioned. Specifically, the lower bound λ min ( A ) ≍ N − 2 α reflects the increasing stiffness of the fractional operator as N grows, while λ max ( A ) ≍ 1 indicates bounded energy in the approximation space. This ill-conditioning necessitates careful numerical linear algebra and suggests that effective preconditioning would be beneficial for large-scale computations.
Figure 2. Condition number growth of the stiffness matrix A for different values of α . The dashed lines correspond to the theoretical growth rate O ( N 2 α ) .

6.6. Discussion

The numerical experiments presented in this section provide comprehensive validation of the theoretical framework developed in Section 2, Section 3, Section 4 and Section 5. The key findings demonstrate that the fractional orthogonal polynomial basis, derived from an operator-induced deformation of the inner product, offers distinct advantages for computational fractional calculus.
First, the approximation tests confirm the expected convergence behavior. For analytic functions, the fractional basis achieves spectral-type (high-order) convergence, while for functions with boundary layers or endpoint singularities, it delivers optimal algebraic convergence rates in the associated weighted norms, as established by Theorem 10. More importantly, the framework exhibits operator-induced optimality for fractional integral operators, as proven in Theorem 11. The numerical comparisons in Table 4 show that this theoretical optimality translates into practical accuracy, with error reductions of one to two orders of magnitude compared to classical polynomial bases.
Second, the application to fractional differential equations validates the well-posedness and convergence analysis of the spectral Galerkin method. The energy norm errors decay algebraically with the polynomial degree N, and the observed convergence rates for different fractional orders α align closely with the theoretical prediction of Theorem 7, as visually confirmed in Figure 1.
Finally, the analysis of the stiffness matrix conditioning reveals the characteristic computational profile of the method. As proven in Theorem 12 and illustrated in Figure 2, the condition number grows as O ( N 2 α ) , which is typical for spectral methods applied to non-local fractional operators. This algebraic growth represents a trade-off between the high accuracy of the method and the need for potential preconditioning strategies in large-scale implementations.
In summary, the numerical results substantiate the core thesis of this work: tailoring the orthogonal polynomial basis to the fractional inner product via the Riemann-Liouville integral yields a spectral method that is both theoretically sound and computationally effective for problems in fractional calculus.

7. Conclusions and Future Work

This work established a rigorous operator-oriented framework for spectral methods in fractional calculus by introducing a fractional inner product based on the Riemann-Liouville integral. The Hilbert space structure is deformed at the operator level, with the fractional order α acting as a continuous parameter rather than through ad hoc modifications of classical polynomial families.
The main conclusions of this study can be summarized as follows. The proposed fractional inner product was shown to be mathematically equivalent to a classical inner product with a deformed weight, providing a direct bridge between the operator-induced formulation and classical orthogonal polynomial theory. In the canonical setting, explicit recurrence relations, norm formulas, and the limiting behavior as α → 1 were derived, confirming consistency with the classical case. The resulting orthogonal polynomial systems were naturally adapted to fractional operators. This adaptation enabled the construction of spectrally accurate Galerkin methods for fractional differential equations, for which well-posed variational formulations and optimal convergence rates were established. Comprehensive numerical experiments validated the theoretical analysis, demonstrating spectral or high-order algebraic convergence and improved accuracy compared to classical polynomial bases in the approximation of fractional integrals and the solution of fractional differential equations.
The proposed framework offers a unified operator-level perspective for constructing orthogonal systems tailored to fractional calculus. Several important directions remain open for future research. A natural extension is the development of spectral methods for multi-dimensional fractional partial differential equations, where tensor-product constructions based on the one-dimensional fractional polynomials may be employed, although challenges related to anisotropy and boundary compatibility must be addressed. Another significant direction concerns variable-order fractional operators, in which the parameter α depends on space or time and necessitates a more flexible functional-analytic setting. Furthermore, while the algebraic growth of the condition number is inherent to fractional operators, the design of efficient preconditioning strategies for the resulting stiffness matrices will be essential for large-scale computations. Finally, applications to concrete fractional models in physics and engineering, such as non-local diffusion and viscoelasticity, provide a natural testbed for assessing the practical impact of the framework and guiding further methodological developments.

Author Contributions

Conceptualization, M.A. and D.A.; Methodology, M.A. and D.A.; Software, M.A. and D.A.; Writing-original draft, M.A.; Writing-review & editing, M.A. and D.A.; Funding acquisition, M.A. and D.A. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [Grant No. KFU260612]. The researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2026).

Data Availability Statement

No datasets were generated or analyzed during the current study. Data sharing is not applicable.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Samko, S.G.; Kilbas, A.A.; Marichev, O.I. Fractional Integrals and Derivatives; Gordon and Breach Science Publishers: Yverdonles-Bains, Switzerland, 1993; Volume 1. [Google Scholar]
  2. Kiryakova, V. A guide to special functions in fractional calculus. Mathematics 2021, 9, 106. [Google Scholar] [CrossRef] [Scilit]
  3. Mainardi, F. A tutorial on the basic special functions of Fractional Calculus. arXiv 2020, arXiv:2003.12385. [Google Scholar] [CrossRef] [Scilit]
  4. Sharma, M.; Jain, R. A note on a generalized M-series as a special function of fractional calculus. Fract. Calc. Appl. Anal. 2009, 12, 449–452. [Google Scholar]
  5. Singh, H.; Srivastava, H.M.; Pandey, R.K. (Eds.) Special Functions in Fractional Calculus and Engineering; CRC Press: Boca Raton, FL, USA, 2023. [Google Scholar]
  6. Gautschi, W. Orthogonal Polynomials: Computation and Approximation; OUP Oxford: Oxford, UK, 2004. [Google Scholar]
  7. Szeg, G. Orthogonal Polynomials; American Mathematical Society: Providence, RI, USA, 1939; Volume 23. [Google Scholar]
  8. Wang, M.L.; Chang, R.Y.; Yang, S.Y. Generalization of generalized orthogonal polynomial operational matrices for fractional and operational calculus. Int. J. Syst. Sci. 1987, 18, 931–943. [Google Scholar] [CrossRef] [Scilit]
  9. Braway, A.H.; Taha, T.M.; Machado, J.A.T. A review of operational matrices and spectral techniques for fractional calculus. Nonlinear Dyn. 2015, 81, 1023–1052. [Google Scholar] [CrossRef] [Scilit]
  10. Ghanbari, K.; Mirzaei, H.; Kavooci, Z. Fractional Chebyshev Differential Equation and New Family of Orthogonal polynomials. J. Fract. Calc. Appl. 2023, 14, 1–13. [Google Scholar]
  11. Area, I.; Djida, J.D.; Losada, J.; Nieto, J.J. On fractional orthonormal polynomials of a discrete variable. Discret. Dyn. Nat. Soc. 2015, 2015, 141325. [Google Scholar] [CrossRef] [Scilit]
  12. Pu, T.; Fasondini, M. The numerical solution of fractional integral equations via orthogonal polynomials in fractional powers. Adv. Comput. Math. 2023, 49, 7. [Google Scholar] [CrossRef] [Scilit]
  13. Moradi, L.; Mohammadi, F.; Conte, D. A discrete orthogonal polynomials approach for coupled systems of nonlinear fractional order integro-differential equations. Tbil. Math. J. 2019, 12, 21–38. [Google Scholar] [CrossRef] [Scilit]
  14. Suthar, D.L.; Tilahun, K.; Oli, A. Generalized Fractional Calculus Operators Involving the Product of the Jacobi Type Orthogonal Polynomials and Multivariable Polynomials. Appl. Appl. Math. Int. J. (AAM) 2020, 15, 33. [Google Scholar]
  15. Mulla, M.A.M.M. Fractional Differential Equations and Chebyshev Polynomials and Their Numerical Solution. Pak. J. Sci. Ind. Res. Ser. A Phys. Sci. 2025, 68, 199–206. [Google Scholar]
  16. Sawangtong, P.; Najafi, A. A numerical scheme based on fractional shifted orthogonal polynomials for high-order fractional integro-differential equation with a weakly singular kernel. Numer. Algorithms 2026, 1–42. [Google Scholar] [CrossRef] [Scilit]
  17. Li, J.; Shu, C.W.; Yang, W. Development and analysis of two new finite element schemes for a time-domain carpet cloak model. Adv. Comput. Math. 2022, 48, 24. [Google Scholar] [CrossRef] [Scilit]
  18. Cochran, L.; Cooper, S.C. Orthogonal Laurent polynomials on the real line. In Continued Fractions and Orthogonal Functions; CRC Press: Boca Raton, FL, USA, 2020; pp. 47–100. [Google Scholar]
  19. Lesfari, A. Spectral theory, Jacobi matrices, continued fractions and difference operators. Fundam. J. Math. Appl. 2019, 2, 63–90. [Google Scholar] [CrossRef] [Scilit]
  20. Chihara, T.S. An Introduction to Orthogonal Polynomials; Courier Corporation: North Chelmsford, MA, USA, 2011. [Google Scholar]
  21. Golub, G.H.; Van Loan, C.F. Matrix Computations; Johns Hopkins University Press: Baltimore, MD, USA; London, UK, 1996; Volume 60. [Google Scholar]
  22. Wilkinson, J.H. (Ed.) The Algebraic Eigenvalue Problem; Oxford University Press, Inc.: Oxford, UK, 1988. [Google Scholar]
  23. Sahakyan, A.V. Gauss-type Quadrature Formulas for Integrals of Various Types Containing the Jacobi Polynomial Weight Function with Complex Exponents. Lobachevskii J. Math. 2025, 46, 4141–4149. [Google Scholar] [CrossRef] [Scilit]
  24. Ervin, V.J.; Roop, J.P. Variational formulation for the stationary fractional advection dispersion equation. Numer. Methods Partial. Differ. Equ. Int. J. 2006, 22, 558–576. [Google Scholar] [CrossRef] [Scilit]
  25. Zayernouri, M.; Karniadakis, G.E. Fractional Sturm-Liouville eigen-problems: Theory and numerical approximation. J. Comput. Phys. 2013, 252, 495–517. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.