Skip to Content
  • Article
  • Open Access

11 March 2026

36 Pages

Mittag-Leffler Weighted Orthogonal Functions for the ABC Fractional Operator: A Formal Self-Adjointness Construction

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
*
Authors to whom correspondence should be addressed.

Abstract

This work constructs an orthogonal function system on bounded intervals [ 0 , R ] associated with the Atangana–Baleanu–Caputo (ABC) fractional derivative for α ∈ ( 1 / 2 , 1 ) . Starting from a fractional Laguerre-type equation involving the ABC operator, solutions are obtained via a generalized Frobenius method, yielding series representations with characteristic exponent α − 1 . Rather than postulating a weight function by analogy with classical or Caputo settings, the weight is derived directly from the requirement that the underlying fractional operator be formally self-adjoint on a suitable admissible domain. This operator-theoretic approach leads to the explicit Mittag–Leffler weight w α ( x ) = x − ( 2 α − 1 ) E α ( − x α ) , which intrinsically reflects the nonlocal memory structure of the ABC kernel. A similarity transformation removes the universal singular factor and produces regularized eigenfunctions that are continuous on [ 0 , R ] and orthogonal in the weighted L 2 space. The weight identity and formal self-adjointness are rigorously verified through a right-Volterra uniqueness argument. Numerical experiments confirm orthogonality up to machine precision, demonstrate spectral convergence for a model ABC differential equation, and illustrate consistency with classical Laguerre polynomials in the limit α → 1 − . The resulting framework provides a self-consistent orthogonal system suitable for spectral approximations of problems governed by the ABC operator on bounded domains.

1. Introduction

Fractional calculus has evolved from a purely mathematical abstraction into a powerful and versatile framework for modeling complex systems that exhibit memory, hereditary properties [1,2,3,4], and anomalous dynamics—phenomena that often elude classical integer-order derivatives [5,6,7,8]. Unlike classical models which rely on local operators, fractional operators incorporate non-local effects that capture the history or spatial distribution of the system, making them indispensable in fields such as viscoelasticity, anomalous diffusion, control theory, and bioengineering [2,7,9,10]. The specific kernel defining a fractional operator dictates the nature of the memory it describes. Traditional power-law kernels, such as those appearing in the Riemann–Liouville and Caputo derivatives, model fading memory with algebraic decay [5,11]. In contrast, kernels based on the Mittag–Leffler function capture more intricate, non-exponential decay patterns with long-range temporal dependencies, offering greater flexibility in modeling real-world phenomena [11,12,13,14,15].
Among contemporary fractional operators, the Atangana–Baleanu (AB) derivative in the Caputo sense has attracted considerable attention due to its unique combination of a non-singular Mittag–Leffler kernel and physically consistent initial conditions [12,13,14,16,17]. This operator has been successfully applied in diverse areas including chaos theory, heat transfer, biological systems, and fractional variational problems [9,14,16]. Unlike the Caputo–Fabrizio derivative, which employs an exponential kernel, the AB derivative retains the Mittag–Leffler function in its definition, thereby preserving the genuinely fractional character of the operator while avoiding the power-law singular kernel present in classical Caputo derivatives [12,13]. This property makes the AB derivative particularly attractive for modeling processes where the kernel should remain bounded yet retain long-range memory effects.
Orthogonal polynomials and special functions form the cornerstone of spectral methods for solving differential equations [18,19]. Among these, classical Laguerre polynomials, orthogonal with respect to the weight e − x on the interval [ 0 , ∞ ) , play a fundamental role in quantum mechanics [20], approximation theory, and numerical analysis [21,22,23,24]. Their spectral convergence properties make them an ideal choice for polynomial approximations on unbounded domains. Extending these classical tools into the fractional domain has been an active area of research over the past two decades [22,25,26]. Notable contributions include the construction of fractional Laguerre functions via the Caputo derivative by Abuasbeh et al. [27], who identified a weight function of the form w α ( x ) = x − ( 2 α − 1 ) e − x that ensures orthogonality and reduces to the classical case in the appropriate integer-order limit. This work, together with broader investigations into fractional and discrete orthogonal polynomial systems [26,28,29], has laid the groundwork for spectral methods applied to fractional differential equations.
The mathematical challenge becomes significantly deeper when moving from power-law kernels to the non-power-law kernel of the Atangana–Baleanu operator [12,14,16]. The inherent non-locality embedded in the Mittag–Leffler kernel significantly alters the spectral framework applicable to Caputo-type operators [30,31]. Unlike the Caputo case, where the orthogonality structure can often be inferred by analogy with classical polynomial systems, the ABC operator demands a fresh operator-theoretic approach. This raises several fundamental questions: Can an orthogonal system intrinsically adapted to the ABC operator be constructed? What orthogonality structure emerges when the defining memory kernel must be directly reflected in the spectral weight? How does the weight function arise naturally from the operator’s properties rather than being imposed a priori? Resolving these questions is not merely of theoretical interest; it is essential for advancing numerical methods in fractional calculus [7,8,17,32,33] and for applications in fields such as fractional quantum mechanics [34], anomalous diffusion [2], and complex biological systems [9,35].
Recent literature demonstrates growing and diverse interest in fractional Laguerre-type functions and their applications. These range from the numerical solution of fractional Bloch equations in magnetic resonance imaging [36], to bioinformatics applications incorporating fractional memory effects for gene selection [35], and efficient numerical schemes for space-fractional diffusion equations [24,37]. Research has also expanded into generalized and q-analogue forms, such as Mittag–Leffler–Laguerre polynomials [38,39], with connections to fractional optics and beam propagation [40]. Parallel efforts are extending related operator-theoretic constructions to other polynomial bases involving the ABC derivative [41]. This expanding body of work underscores the need for a rigorous and systematic spectral framework tailored specifically to the ABC operator [16,17].
In this paper, we provide a systematic and principle-driven construction of an orthogonal function system intrinsically associated with the Atangana–Baleanu–Caputo fractional derivative. The key novelty lies in deriving the orthogonality structure directly from operator-theoretic considerations rather than postulating a weight function by analogy with classical or Caputo-based constructions. This perspective leads naturally to a Mittag-Leffler weight of the form
w α ( x ) ∝ x − ( 2 α − 1 ) E α ( − x α ) ,
which intrinsically links the polynomial basis to the memory kernel of the ABC operator. To the best of our knowledge, this is among the first constructions in the ABC setting where the orthogonality structure emerges directly from the properties of the operator itself. The main contributions include establishing the formal self-adjointness of the ABC operator on a suitable admissible domain and deriving the associated Mittag–Leffler weight function from first principles. Using a generalized Frobenius method adapted to the nonlocal ABC operator, we construct regularized eigenfunctions that are continuous on bounded intervals [ 0 , R ] and satisfy a fractional Laguerre-type equation. Through a similarity transformation, we remove the universal singular factor x α − 1 and prove orthogonality of the regularized functions in the corresponding weighted L 2 space. The theoretical developments are complemented by systematic numerical experiments that confirm orthogonality up to machine precision, demonstrate spectral convergence for a model ABC differential equation, and illustrate consistency with classical Laguerre polynomials in the limit α → 1 − . The resulting framework provides a self-consistent orthogonal system suitable for spectral approximations of problems involving the ABC operator on bounded intervals, with the weight function emerging naturally from the operator structure.
The work is structured as follows. Section 2 presents the ABC fractional framework and constructs the ABC–Laguerre functions. Section 2.1 introduces the Atangana–Baleanu–Caputo derivative. Section 2.2 formulates and solves the fractional Laguerre-type equation via a generalized series expansion. Section 2.3 provides the series representation and discusses structural properties of the resulting functions. Section 2.4 establishes the formal self-adjointness of the ABC operator. Section 2.5 derives the associated Mittag–Leffler weight function from first principles. Section 2.6 presents the orthogonality proof via similarity transformation and addresses normalization. Section 3 provides numerical verification and illustrative applications. Section 3.1 validates the orthogonality relations numerically. Section 3.2 presents a spectral method application for solving an ABC differential equation. Section 3.3 discusses numerical accuracy and implementation aspects. Section 3.4 offers concluding remarks and outlines open problems, including extensions to half-line domains, completeness analysis, and asymptotic behavior of normalization constants. Appendix A provides a rigorous verification of the weight function via a right-Volterra uniqueness argument, independent of termwise coefficient matching.

2. The ABC Fractional Framework and Function Construction

2.1. The Atangana–Baleanu–Caputo Derivative

We begin by recalling the definition of the Atangana–Baleanu fractional derivative in the Caputo sense (ABC), which forms the cornerstone of our analysis. For a function f ∈ A C [ 0 , b ] , where A C [ 0 , b ] denotes the space of absolutely continuous functions on [ 0 , b ] , the ABC derivative of order α ∈ ( 0 , 1 ) is defined as
D 0 + α A B C f ( x ) = B ( α ) 1 − α ∫ 0 x f ′ ( t ) E α − α 1 − α ( x − t ) α d t ,
where B ( α ) is a normalization function satisfying B ( 0 ) = B ( 1 ) = 1 , and E α ( z ) denotes the one-parameter Mittag-Leffler function defined by
E α ( z ) = ∑ k = 0 ∞ z k Γ ( α k + 1 ) .
The function B ( α ) is a normalization function satisfying B ( 0 ) = B ( 1 ) = 1 ; its specific form does not affect the orthogonality structure developed in later sections and may be chosen conveniently (e.g., B ( α ) = 1 or the standard choice B ( α ) = 1 − α + α / Γ ( α ) ).
Throughout this work, we focus exclusively on fractional orders 0 < α < 1 , which corresponds to the standard and well-established definition of the ABC derivative in the literature. This restriction ensures mathematical consistency while maintaining the essential non-local characteristics of the operator that are crucial for our spectral analysis.
A fundamental property of the ABC derivative is its action on power functions, which is essential for the series solution method we will employ. The following lemma provides this result in a rigorous form.
Lemma 1 
(ABC derivative of power functions). For μ > − 1 and α ∈ ( 0 , 1 ) , the ABC derivative of x μ is given by
D 0 + α A B C x μ = B ( α ) 1 − α ∑ m = 0 ∞ − α 1 − α m Γ ( α m + 1 ) Γ ( μ + 1 ) Γ ( μ + α m + 1 ) x μ + α m ,
where the series converges absolutely for all x ≥ 0 .
Proof. 
Starting from the definition (1), we have
D 0 + α A B C x μ = B ( α ) 1 − α ∫ 0 x μ t μ − 1 E α − α 1 − α ( x − t ) α d t .
Substituting the series representation of the Mittag–Leffler function (2) into the integral yields
D 0 + α A B C x μ = B ( α ) 1 − α ∑ m = 0 ∞ − α 1 − α m Γ ( α m + 1 ) ∫ 0 x μ t μ − 1 ( x − t ) α m d t .
The integral can be evaluated using the Beta function identity:
∫ 0 x t μ − 1 ( x − t ) α m d t = x μ + α m Γ ( μ ) Γ ( α m + 1 ) Γ ( μ + α m + 1 ) .
Substituting this result and simplifying using the Gamma function property Γ ( μ + 1 ) = μ Γ ( μ ) gives
D 0 + α A B C x μ = B ( α ) 1 − α ∑ m = 0 ∞ − α 1 − α m Γ ( α m + 1 ) Γ ( μ + 1 ) Γ ( μ + α m + 1 ) x μ + α m .
The condition μ > − 1 ensures the convergence of the Beta integral and guarantees that Γ ( μ ) is finite; the case μ = 0 is handled by interpreting the product μ Γ ( μ ) as Γ ( μ + 1 ) = 1 . The absolute convergence of the resulting series follows from the analytic properties of the Mittag-Leffler function for α ∈ ( 0 , 1 ) .  □
This series representation is fundamental as it allows us to compute the action of the ABC derivative on power series solutions, which will be our primary tool in solving the fractional Laguerre-type equation. The form (3) explicitly shows how the non-local Mittag–Leffler kernel modifies the classical fractional derivative of power functions through an infinite series of fractional power terms.

2.2. Fractional Laguerre-Type Equation and Series Solution

We define the fractional Laguerre-type equation involving the Atangana–Baleanu–Caputo (ABC) derivative and the Atangana–Baleanu (AB) fractional integral by
x D 0 + α A B C y ( x ) + ( 1 − x ) I 0 + 1 − α A B y ( x ) + n y ( x ) = 0 , n ∈ N 0 , α ∈ ( 0 , 1 ) .
Equation (4) is understood as a formal spectral problem: we seek functions y (within an admissible class specified in Section 2.4) that satisfy (4) for a given n ∈ N 0 . The Frobenius construction below yields formal series solutions indexed by n; their admissibility requirements and numerical stability under truncation are discussed in Section 2.4 and validated in Section 3. A full spectral analysis (discreteness, completeness, etc.) is beyond the scope of this work; the resulting family is primarily used as an orthogonal system for spectral approximations.
The AB fractional integral of order 1 − α is taken in the standard form
I 0 + 1 − α A B f ( x ) = 1 − α B ( 1 − α ) f ( x ) + α B ( 1 − α ) I 0 + 1 − α R L f ( x ) ,
where B ( · ) is the same normalization function used in the ABC derivative, and I 0 + 1 − α R L denotes the Riemann–Liouville fractional integral.
To analyze (4), we seek a generalized power-series representation near the origin of the form
y ( x ) = ∑ k = 0 ∞ a k x k + β , a 0 ≠ 0 , β > − 1 ,
where β will be determined by structural requirements of the equation. The solutions are sought in the class of functions that are absolutely continuous on ( 0 , R ] and satisfy boundary conditions at x = 0 and x = R (to be specified in Section 2.4); the exponent β is fixed by consistency with the fractional operator structure.
We first record the action of the AB integral on power functions.
Lemma 2 
(AB integral of power functions). Let μ > − 1 and α ∈ ( 0 , 1 ) . Then
I 0 + 1 − α A B x μ = 1 − α B ( 1 − α ) x μ + α B ( 1 − α ) Γ ( μ + 1 ) Γ ( μ + 2 − α ) x μ + 1 − α .
Proof. 
The identity follows directly from (5) and the classical formula
I 0 + 1 − α R L x μ = Γ ( μ + 1 ) Γ ( μ + 2 − α ) x μ + 1 − α , μ > − 1 .
□
Applying Lemmas 1 and 2 termwise to (6) yields
D 0 + α A B C y ( x ) = B ( α ) 1 − α ∑ k = 0 ∞ ∑ m = 0 ∞ a k − α 1 − α m Γ ( α m + 1 ) Γ ( k + β + 1 ) Γ ( k + β + α m + 1 ) x k + β + α m ,
and
I 0 + 1 − α A B y ( x ) = ∑ k = 0 ∞ a k 1 − α B ( 1 − α ) x k + β + α B ( 1 − α ) Γ ( k + β + 1 ) Γ ( k + β + 2 − α ) x k + β + 1 − α .
Substituting (6)–(9) into (4) gives the coupled series identity
B ( α ) 1 − α ∑ k = 0 ∞ ∑ m = 0 ∞ a k − α 1 − α m Γ ( α m + 1 ) Γ ( k + β + 1 ) Γ ( k + β + α m + 1 ) x k + β + α m + 1 + 1 − α B ( 1 − α ) ∑ k = 0 ∞ a k x k + β − 1 − α B ( 1 − α ) ∑ k = 0 ∞ a k x k + β + 1 + α B ( 1 − α ) ∑ k = 0 ∞ a k Γ ( k + β + 1 ) Γ ( k + β + 2 − α ) x k + β + 1 − α − α B ( 1 − α ) ∑ k = 0 ∞ a k Γ ( k + β + 1 ) Γ ( k + β + 2 − α ) x k + β + 2 − α + n ∑ k = 0 ∞ a k x k + β = 0 .
To investigate the behavior near the origin, note that α ∈ ( 0 , 1 ) implies that all powers generated by the ABC term in (10) are strictly larger than β . If one attempts a classical Frobenius lowest-power balance, the coefficient of x β would formally suggest
a 0 1 − α B ( 1 − α ) + n = 0 .
Since (11) depends only on n and α , it cannot hold for arbitrary n ∈ N 0 , indicating that the standard indicial-equation mechanism is not applicable in the present nonlocal setting. This reflects an intrinsic feature of the ABC operator: the nonlocal Mittag–Leffler kernel induces global coefficient coupling, so that the leading exponent β cannot be determined by a simple lowest-power balance, but instead must be fixed by consistency of the full fractional operator structure.
A systematic inspection of the exponents in (10) shows that, for a general β , the AB-integral term produces powers of the form x k + β + 1 − α , which are not aligned with the integer lattice generated by the remaining terms. Requiring a closed and well-ordered exponent structure therefore imposes a structural constraint on β .
Lemma 3 
(Determination of the Frobenius exponent). Let α ∈ ( 0 , 1 ) . The choice β = α − 1 is the unique one that yields a closed exponent scale for coefficient matching, in the sense that all powers appearing in (10) belong to the ordered family
{ x k + α − 1 , x k , x k + 1 , x k + α , x k + α + 1 , … } k ≥ 0 .
Proof. 
For β = α − 1 , the term x k + β + 1 − α reduces to x k , which lies on the integer lattice generated by the remaining contributions in (10). Any other choice of β produces an incommensurate fractional shift, preventing closure of the coefficient-matching system.  □
Moreover, the choice β = α − 1 implies the local behavior y ( x ) ∼ x α − 1 as x → 0 + , which is compatible with admissibility in the weighted space induced by the Mittag–Leffler weight derived in Section 2.8. Thus, β = α − 1 is not merely convenient, but necessary for the formal coefficient-matching framework adopted here.
Setting β = α − 1 , the identity (10) can be reorganized by collecting identical powers of x, yielding an infinite linear system of the form
A { a k } k ≥ 0 = 0 ,
where A is a linear operator acting on the coefficient sequence { a k } k ≥ 0 . The nonlocal Mittag–Leffler kernel induces global coupling, whereby each coefficient a k interacts with infinitely many others. Consequently, the resulting system does not reduce to a finite-term recurrence relation, but instead yields an infinite-dimensional linear structure intrinsically determined by the ABC operator.
For computational purposes, we introduce truncated approximations. Let P N denote the projection onto the finite-dimensional span of { x k + α − 1 } k = 0 N . The truncated system
P N A P N { a k } k = 0 N = 0
yields a finite linear system whose solution defines the truncated fractional Laguerre-type function
L n ( α , N ) ( x ) = ∑ k = 0 N a k ( n ) x k + α − 1 .
Numerical experiments in Section 3 indicate that, for fixed α and n, the sequence { L n ( α , N ) } N ≥ 1 stabilizes rapidly in the weighted L 2 -norm induced by the Mittag–Leffler weight, providing effective spectral approximations of solutions to (4).
The admissibility requirements for the infinite-series representation and the behavior of truncated approximations are discussed in Section 2.4 and validated numerically in Section 3. All numerical implementations employ appropriately truncated versions of (6).

2.3. Closed-Form Expression and Structural Properties

Because of the nonlocal structure of the ABC operator and the resulting infinite coupling in the coefficient system (12), a simple closed-form expression in terms of elementary functions does not arise. Instead, the fractional Laguerre-type functions are defined through their truncated series representation (14), with coefficients determined by the projected linear system
P N A P N { a k } k = 0 N = 0 ,
where A denotes the infinite-dimensional operator acting on the coefficient sequence and P N is the canonical projection onto the first N + 1 modes.
We emphasize that the construction is formal at the level of the infinite system, while all computational realizations employ truncated versions. Within this framework, several structural observations follow directly from the series representation developed in Section 2.2.
Property 1 
(Dependence on the fractional parameter). For any fixed truncation order N and fixed x ∈ [ 0 , R ] , the truncated function L n ( α , N ) ( x ) depends continuously on α ∈ ( 0 , 1 ) . This behavior is consistent with the analytic dependence of the Frobenius coefficients on α in the formal construction. No differentiability statement or classical limiting structure is assumed.
Property 2 
(Growth and weighted square-integrability). For each fixed N, the truncated function
L n ( α , N ) ( x ) = ∑ k = 0 N a k ( n ) x k + α − 1
exhibits algebraic growth as x increases. However, when combined with the Mittag–Leffler weight
w α ( x ) = x − ( 2 α − 1 ) E α ( − x α ) ,
derived in Section 2.8, the product w α ( x ) L n ( α , N ) ( x ) is square-integrable on any fixed bounded interval [ 0 , R ] . The extension of this property to the half-line [ 0 , ∞ ) would require additional decay analysis and is not addressed in the present work.
Due to the global coupling induced by the nonlocal Mittag–Leffler kernel, classical structural features of orthogonal polynomial systems—such as a three-term recurrence relation, a Rodrigues formula, or a closed generating function— do not directly carry over to the ABC setting. Instead, the truncated family { L n ( α , N ) } n = 0 N derives its practical relevance from the orthogonality structure established in Section 2.11 and from its effectiveness in spectral approximation schemes.
The stability and convergence behavior of the truncated systems (15) are examined numerically in Section 3. A rigorous analysis of truncation error and infinite-dimensional solvability remains an open problem.

2.4. Formal Self-Adjointness of the ABC Operator

The orthogonality structure of the fractional Laguerre-type system is derived from the formal self-adjointness of the operator
L [ y ] ( x ) = x D 0 + α A B C y ( x ) + ( 1 − x ) I 0 + 1 − α A B y ( x ) , 0 < x < R ,
defined for 0 < α < 1 on a fixed bounded interval [ 0 , R ] .

2.4.1. Analytical Status of the Construction

In this section we establish formal self-adjointness of L with respect to a weighted inner product on a specified admissible class of functions. By “formal self-adjointness” we mean that the identity
⟨ L [ f ] , g ⟩ w = ⟨ f , L [ g ] ⟩ w
holds for all admissible functions f , g , based on integration-by-parts identities and the vanishing of boundary contributions.
We do not claim that L defines a closed, densely defined, self-adjoint operator in the Hilbert space L 2 ( [ 0 , R ] ; w d x ) . No spectral theorem, closedness result, or completeness property is asserted in this work.

2.4.2. Weighted Framework

Let w : [ 0 , R ] → [ 0 , ∞ ) be a fixed candidate weight. Define the weighted inner product
⟨ f , g ⟩ w = ∫ 0 R w ( x ) f ( x ) g ( x ) d x ,
whenever the integral converges.
For this fixed weight w, define the admissible domain
D α ( w ) : = f ∈ A C ( [ 0 , R ] ) : ∫ 0 R w ( x ) | f ( x ) | 2 d x < ∞ , .
and all boundary contributions arising in the weighted integration-by-parts identity vanish.
Here A C ( [ 0 , R ] ) denotes the space of absolutely continuous functions on [ 0 , R ] . In particular, the admissible class is chosen so that all fractional integrals and derivatives appearing in (16) are well-defined almost everywhere on ( 0 , R ) . All identities below are understood to hold on D α ( w ) .
Throughout this subsection we write
κ = α 1 − α .

2.4.3. Right-Sided Adjoint Operators with Terminal R

From the weighted integration-by-parts identity, the right-sided adjoint of the ABC derivative with terminal R takes the form
( D R − α A B C ϕ ) ( t ) = B ( α ) 1 − α ϕ ( t ) − κ ∫ t R ϕ ( x ) ( x − t ) α − 1 E α , α − κ ( x − t ) α d x ,
for 0 < t < R .
For the AB integral, we use the decomposition
I 0 + 1 − α A B = 1 − α B ( 1 − α ) I + α B ( 1 − α ) I 0 + 1 − α R L .
On the bounded interval [ 0 , R ] , the classical Riemann–Liouville adjoint relation yields
∫ 0 R ϕ ( x ) I 0 + 1 − α R L ψ ( x ) d x = ∫ 0 R ψ ( x ) I R − 1 − α R L ϕ ( x ) d x ,
for sufficiently regular functions for which the integrals converge and boundary terms vanish; in particular, this holds for functions in the admissible class D α ( w ) .
Consequently, the right-sided AB adjoint operator with terminal R is
( I R − 1 − α A B ϕ ) ( x ) = 1 − α B ( 1 − α ) ϕ ( x ) + α B ( 1 − α ) I R − 1 − α R L ϕ ( x ) .
These right-sided operators allow the weighted adjoint identity for L to be expressed entirely on the bounded interval [ 0 , R ] . The explicit verification of the formal self-adjointness condition, together with the derivation of the corresponding weight function, is presented in Theorem A2 (Appendix A).

2.5. Formal Adjoint Computation

Lemma 4 
(Differentiation of the right-sided Mittag–Leffler operator). Let α ∈ ( 0 , 1 ) and let ϕ ∈ L 1 ( 0 , ∞ ) . Define
( I α , ∞ ϕ ) ( t ) : = B ( α ) 1 − α ∫ t ∞ ϕ ( x ) E α ( − κ ( x − t ) α ) d x , t > 0 .
Then I α , ∞ ϕ is absolutely continuous on ( 0 , ∞ ) and for almost every t > 0 ,
d d t ( I α , ∞ ϕ ) ( t ) = B ( α ) 1 − α − ϕ ( t ) + κ ∫ t ∞ ϕ ( x ) ( x − t ) α − 1 E α , α ( − κ ( x − t ) α ) d x .
Equivalently,
d d t ( I α , ∞ ϕ ) ( t ) = − ( A B C D ∞ − α ϕ ) ( t ) .
Theorem 1 
(Formal adjoint). For a fixed weight w, the formal adjoint of L with respect to ⟨ · , · ⟩ w is
L w * [ g ] = D ∞ − α A B C ( x w g ) + I ∞ − 1 − α A B ( ( 1 − x ) w g ) .
Proof. 
We compute
⟨ L [ f ] , g ⟩ w = I 1 + I 2 ,
where
I 1 = ∫ 0 ∞ w ( x ) g ( x ) x D 0 + α A B C f ( x ) d x , I 2 = ∫ 0 ∞ w ( x ) g ( x ) ( 1 − x ) I 0 + 1 − α A B f ( x ) d x .
Term I1.
Applying Lemma 4 with φ ( x ) = x w ( x ) g ( x ) gives
I 1 = ∫ 0 ∞ f ( x ) D ∞ − α A B C ( x w g ) ( x ) d x ,
since boundary terms vanish on D α ( w ) .
Term I2.
Using the AB decomposition,
I 2 = 1 − α B ( 1 − α ) ∫ 0 ∞ w ( 1 − x ) g f d x + α B ( 1 − α ) ∫ 0 ∞ w ( 1 − x ) g I 0 + 1 − α R L f d x .
Applying (22) to the second integral yields
I 2 = ∫ 0 ∞ f ( x ) I ∞ − 1 − α A B ( ( 1 − x ) w g ) ( x ) d x .
Combining I 1 and I 2 gives
⟨ L [ f ] , g ⟩ w = ∫ 0 ∞ f ( x ) D ∞ − α A B C ( x w g ) + I ∞ − 1 − α A B ( ( 1 − x ) w g ) ( x ) d x ,
which proves (24).  □

2.6. Formal Self-Adjointness Condition

We now characterize the weights for which L is formally self-adjoint with respect to the weighted inner product (17) on the bounded interval [ 0 , R ] .
Theorem 2 
(Formal self-adjointness condition). Let w : [ 0 , R ] → [ 0 , ∞ ) be a fixed weight and let D α ( w ) be the admissible class defined in Section 2.4. Then L is formally self-adjoint on D α ( w ) (i.e. ⟨ L [ f ] , g ⟩ w = ⟨ f , L [ g ] ⟩ w for all f , g ∈ D α ( w ) ) if and only if
L w * [ g ] ( x ) = w ( x ) L [ g ] ( x ) in the distributional sense on ( 0 , R ) ,
for all g ∈ D α ( w ) , where L w * is the formal adjoint given in Theorem 1. Equivalently, (25) can be written in expanded form as
D R − α A B C x w ( x ) g ( x ) + I R − 1 − α A B ( 1 − x ) w ( x ) g ( x ) = w ( x ) x D 0 + α A B C g ( x ) + ( 1 − x ) I 0 + 1 − α A B g ( x ) ,
to be understood on ( 0 , R ) under the admissibility assumptions of D α ( w ) .
Proof. 
By Theorem 1, for all f , g ∈ D α ( w ) we have
⟨ L [ f ] , g ⟩ w = ∫ 0 R f ( x ) L w * [ g ] ( x ) d x , ⟨ f , L [ g ] ⟩ w = ∫ 0 R f ( x ) w ( x ) L [ g ] ( x ) d x .
Hence ⟨ L [ f ] , g ⟩ w = ⟨ f , L [ g ] ⟩ w for all admissible f , g holds if and only if
∫ 0 R f ( x ) L w * [ g ] ( x ) − w ( x ) L [ g ] ( x ) d x = 0 for all f ∈ D α ( w ) ,
which is precisely the distributional identity (25) on ( 0 , R ) , since the equality holds against all admissible test functions. The expanded form (26) follows by substituting the expressions of L (16) and L w * (25).  □
The explicit verification that the Mittag–Leffler weight w α derived in the next subsection satisfies (25) is carried out in Appendix A using the Volterra structure of the right-sided operators.

2.7. Determination of the Weight

Condition (25) is a nonlocal operator constraint on the unknown weight w. Evaluating both sides on the monomial family { g ( x ) = x k } k ≥ 0 and using the power-action formulas from Lemmas 1 and 2, together with the right-sided operators defined in Section 2.4, leads to a candidate weight of the form
w α ( x ) = C x − ( 2 α − 1 ) E α ( − x α ) , C > 0 , x ∈ ( 0 , R ) ,
where E α is the one-parameter Mittag–Leffler function (2). The factor x − ( 2 α − 1 ) compensates the singular behavior x α − 1 of the Frobenius solutions near x = 0 , while the Mittag–Leffler factor E α ( − x α ) is precisely tuned to cancel the series generated by the right-sided ABC adjoint operator.
The constant C plays no role in the formal symmetry, as it cancels in the weighted inner product; it may therefore be set to C = 1 for convenience in numerical implementations.
The rigorous verification that (27) satisfies the formal self-adjointness identity (25) is carried out in Appendix A. The proof avoids termwise coefficient matching on [ 0 , R ] ; instead, it uses a right-Volterra integral equation and a uniqueness argument for homogeneous Volterra equations. The main steps are as follows:
  • Defining the error functional F g ( x ) as the difference between the left and right sides of (26) applied to g;
  • Showing that F g satisfies a homogeneous right-Volterra equation F g = V F g on [ 0 , R ] ;
  • Proving that the only continuous solution of F g = V F g is F g ≡ 0 ;
  • Concluding that (27) indeed yields formal self-adjointness.
This approach, detailed in Appendix A, provides a complete and rigorous validation of the weight (27) without relying on termwise algebraic manipulations.

2.8. Admissibility and Analytical Properties of the Weight

We now examine the analytical properties of the candidate weight (27) and justify the parameter restrictions under which the weighted framework is well defined.
Throughout this subsection 0 < α < 1 and
κ = α 1 − α .
The normalization function B ( · ) appearing in the ABC derivative and AB integral satisfies B ( 0 ) = B ( 1 ) = 1 (see Section 2.1).

2.8.1. Behavior near the Origin and the Restriction α > 1 2

Since E α ( 0 ) = 1 , the weight
w α ( x ) = C x − ( 2 α − 1 ) E α ( − x α )
satisfies
w α ( x ) ∼ C x − ( 2 α − 1 ) as x → 0 + .
Hence w α ∈ L 1 ( 0 , R ) if and only if
− ( 2 α − 1 ) > − 1 , i . e . , α > 1 2 .
Accordingly, in the orthogonality framework developed below we restrict to
α ∈ 1 2 , 1 ,
so that the weighted inner product (17) is well defined on [ 0 , R ] .

2.8.2. Bounded-Interval Formulation

For 0 < α < 1 , the Mittag–Leffler function E α ( − x α ) decays algebraically as x increases. To avoid additional boundary considerations and to keep the formal integration-by-parts identities within a controlled weighted framework, we develop the orthogonality theory on a fixed bounded interval [ 0 , R ] with R < ∞ .
As in Section 2.4, all right-sided operators are understood with terminal point R. All identities are understood in the distributional sense on ( 0 , R ) and, for α > 1 2 , also hold pointwise almost everywhere for functions in the admissible class D α ( w ) .

2.8.3. Verification of the Formal Self-Adjointness Identity

The verification that the weight (27) satisfies the formal self-adjointness identity (25) is presented in Appendix A, based on the Volterra-type structure induced by the right-sided operators on [ 0 , R ] .

2.9. Right-Sided Operators with Terminal R

For completeness, we record here the explicit definitions of the right-sided operators with terminal point R, as introduced in Section 2.4. These operators will be used throughout the remainder of the paper and in Appendix A. Recall that the normalization function B ( · ) satisfies B ( 0 ) = B ( 1 ) = 1 (see Section 2.1).
We first define the right-sided Riemann–Liouville fractional integral on ( 0 , R ) :
( I R − β R L ϕ ) ( x ) : = 1 Γ ( β ) ∫ x R ( t − x ) β − 1 ϕ ( t ) d t , β > 0 , 0 < x < R ,
whenever the integral is well defined.
The right-sided AB fractional integral with terminal R is defined by the standard AB decomposition using the same normalization function B ( · ) :
( I R − 1 − α A B ϕ ) ( x ) : = 1 − α B ( 1 − α ) ϕ ( x ) + α B ( 1 − α ) ( I R − 1 − α R L ϕ ) ( x ) , 0 < x < R .
Next, we recall the right-sided Mittag–Leffler averaging operator from Section 2.4, now with terminal R:
( J α , R φ ) ( t ) : = B ( α ) 1 − α ∫ t R φ ( x ) E α − κ ( x − t ) α d x , 0 < t < R ,
where κ = α 1 − α . The integral is well defined whenever the integrand is absolutely integrable on ( t , R ) ; in particular, this holds for admissible functions with sufficient local integrability.
Motivated by the integration-by-parts identity, we define the right-sided adjoint ABC operator on ( 0 , R ) by
( D R − α A B C φ ) ( t ) : = B ( α ) 1 − α φ ( t ) − κ ∫ t R φ ( x ) ( x − t ) α − 1 E α , α − κ ( x − t ) α d x , 0 < t < R ,
whenever the integral is well defined. As above, the operator is defined for functions for which the integral term is absolutely integrable on ( t , R ) .
These right-sided operators play a central role in the weighted integration-by-parts identities and in the verification of the formal self-adjointness condition presented in Appendix A.

2.10. Target Identity and Verification on ( 0 , R )

By Theorem 2 (with the terminal point fixed at R), formal self-adjointness of L with respect to the weighted inner product
⟨ f , g ⟩ w : = ∫ 0 R w ( x ) f ( x ) g ( x ) d x
is equivalent to the distributional identity
D R − α A B C x w ( x ) g ( x ) + I R − 1 − α A B ( 1 − x ) w ( x ) g ( x ) = w ( x ) L [ g ] ( x ) in D ′ ( 0 , R ) ,
for all admissible test functions g (in particular, for all polynomials), where the right-sided operators are those recorded in Section 2.9.

2.10.1. Auxiliary Finite-Terminal Identities

Lemma 5 
(Right-sided AB integral on powers). Let 0 < α < 1 and k ∈ N 0 . Then for 0 < x < R ,
( I R − 1 − α A B x k ) ( x ) = 1 − α B ( 1 − α ) x k + α B ( 1 − α ) 1 Γ ( 1 − α ) ∫ x R ( t − x ) − α t k d t ,
and the integral is finite for each x ∈ ( 0 , R ) .
Proof. 
This follows directly from the AB decomposition (30) and the definition of the right-sided Riemann–Liouville integral (29). The kernel ( t − x ) − α is integrable near t = x since − α > − 1 .  □
Lemma 6 
(Finite-terminal Mittag–Leffler differentiation). Fix 0 < α < 1 and let κ = α 1 − α . Let φ ∈ L 1 ( 0 , R ) be such that
∫ t R | φ ( x ) | ( x − t ) α − 1 d x < ∞ for a . e . t ∈ ( 0 , R )
(this holds, in particular, for functions in the admissible class D α ( w ) ). Then the operator J α , R defined in (31) is absolutely continuous on ( 0 , R ) and satisfies
d d t ( J α , R φ ) ( t ) = − ( D R − α A B C φ ) ( t ) for a . e . t ∈ ( 0 , R ) ,
where D R − α A B C is given by (32).
Proof. 
This is the finite-terminal analogue of Lemma 5, obtained by the same Leibniz differentiation under the integral sign, with terminal point R. The additional integrability condition ensures that differentiation under the integral sign is justified.  □

2.10.2. Candidate Weight and Formal Verification

Motivated by the Frobenius exponent β = α − 1 in Section 2.2 and the Mittag–Leffler structure of the ABC kernel, we consider the weight
w α ( x ) : = C x − ( 2 α − 1 ) E α ( − x α ) , 0 < x ≤ R , C > 0 .
For α ∈ ( 1 2 , 1 ) one has w α ∈ L 1 ( 0 , R ) and w α ( x ) > 0 on ( 0 , R ] (since E α ( − x α ) > 0 for x ≥ 0 ). The constant C plays no role in the formal symmetry and may be set to C = 1 without loss of generality.
Theorem 3 
(Verification of the weight identity). Let α ∈ ( 1 2 , 1 ) and R ∈ ( 0 , ∞ ) . Then the weight w α in (27) satisfies (34) for every polynomial g, in the distributional sense on ( 0 , R ) . Consequently, L is formally self-adjoint with respect to ⟨ · , · ⟩ w α on the admissible class D α ( w α ) .
Proof. 
By linearity, it suffices to verify (34) for monomials g ( x ) = x k , k ∈ N 0 . For such g, the right-hand side w α L [ g ] is computed using the left-sided power-action formulas from Section 2.2, while the left-hand side is expressed via the finite-terminal identities in Lemmas 5 and 6.
A complete verification is given in Appendix A using a right-Volterra uniqueness argument: the difference between the two sides of (34) is shown to satisfy a homogeneous Volterra-type equation on ( 0 , R ) , whose only admissible solution is the zero distribution. This establishes (34) on the polynomial class.  □
Remark 1 
(Non-uniqueness). We do not claim uniqueness of the weight. The function w α is one admissible choice that satisfies the formal symmetry identity (34) under the stated assumptions.

2.11. Orthogonality Proof and Normalization

We establish the orthogonality of the ABC–Laguerre family with respect to the weight w α derived in Section 2.8 and introduce a consistent normalization. Throughout this subsection we fix α ∈ ( 1 / 2 , 1 ) and a bounded interval [ 0 , R ] with R < ∞ . We assume that the Frobenius series representation (39) for the eigenfunctions converges on [ 0 , R ] .

2.11.1. Regularized Eigenfunctions

Recall from Section 2.2 that the eigenvalue problem
L [ y ] ( x ) = − n y ( x ) , n ∈ N 0 ,
admits Frobenius-type solutions of the form
y n ( x ) = x α − 1 ∑ k = 0 ∞ a k ( n ) x k , a 0 ( n ) = 1 .
Since w α ( x ) ∼ C x − ( 2 α − 1 ) as x → 0 + , the integrand w α ( x ) y n ( x ) 2 behaves like x − 1 near the origin and is therefore not integrable. Thus the weighted L 2 -orthogonality must be formulated for the regularized eigenfunctions obtained by removing the universal singular factor x α − 1 .
Definition 1 
(Regularized ABC–Laguerre functions). For each n ∈ N 0 , define
L n ( α ) ( x ) : = x 1 − α y n ( x ) = ∑ k = 0 ∞ a k ( n ) x k , 0 ≤ x ≤ R .
Then L n ( α ) is continuous on [ 0 , R ] and satisfies L n ( α ) ( 0 ) = 1 .

2.11.2. Similarity Transform and Admissible Domain

Let T be the multiplication operator
( T f ) ( x ) = x α − 1 f ( x ) , 0 < x ≤ R ,
with inverse ( T − 1 f ) ( x ) = x 1 − α f ( x ) . Then y n = T L n ( α ) . Define the similarity transform of L by
L ˜ : = T − 1 L T , ( L ˜ f ) ( x ) = x 1 − α L x α − 1 f ( x ) .
Let D α ( w α ) be the admissible class introduced in Section 2.4, on which the formal weighted integration-by-parts identities (and hence formal self-adjointness) are valid. We define the pullback domain
D ˜ α ( w α ) : = { f : T f ∈ D α ( w α ) } .

2.11.3. Transfer of Formal Self-Adjointness

Lemma 7 
(Formal self-adjointness of L ˜ ). If L is formally self-adjoint on D α ( w α ) with respect to ⟨ · , · ⟩ w α , then L ˜ is formally self-adjoint on D ˜ α ( w α ) with respect to the same inner product.
Proof. 
Let f , g ∈ D ˜ α ( w α ) . Then T f , T g ∈ D α ( w α ) . Using T g ( x ) = x α − 1 g ( x ) and the definition (42),
⟨ L ˜ f , g ⟩ w α = ∫ 0 R w α ( x ) x 1 − α L [ T f ] ( x ) g ( x ) d x = ∫ 0 R w α ( x ) L [ T f ] ( x ) T g ( x ) d x = ⟨ L [ T f ] , T g ⟩ w α .
By the formal self-adjointness of L on D α ( w α ) , ⟨ L [ T f ] , T g ⟩ w α = ⟨ T f , L [ T g ] ⟩ w α . Moreover,
⟨ f , L ˜ g ⟩ w α = ∫ 0 R w α ( x ) f ( x ) x 1 − α L [ T g ] ( x ) d x = ∫ 0 R w α ( x ) T f ( x ) L [ T g ] ( x ) d x = ⟨ T f , L [ T g ] ⟩ w α .
Hence ⟨ L ˜ f , g ⟩ w α = ⟨ f , L ˜ g ⟩ w α , as claimed.  □

2.11.4. Eigenvalue Relation for the Regularized Family

Lemma 8 
(Eigenvalues of L ˜ ). For each n ∈ N 0 , the regularized function L n ( α ) satisfies
L ˜ L n ( α ) = − n L n ( α ) .
Proof. 
Since T L n ( α ) = y n and L [ y n ] = − n y n , we obtain
L ˜ L n ( α ) = T − 1 L [ T L n ( α ) ] = T − 1 L [ y n ] = T − 1 ( − n y n ) = − n L n ( α ) .
□

2.11.5. Orthogonality

Theorem 4 
(Orthogonality of the regularized ABC–Laguerre family). Assume that L n ( α ) ∈ D ˜ α ( w α ) for all n ∈ N 0 . Then for m ≠ n ,
∫ 0 R w α ( x ) L m ( α ) ( x ) L n ( α ) ( x ) d x = 0 .
Proof. 
By Lemma 7, L ˜ is formally self-adjoint on D ˜ α ( w α ) , and by Lemma 8, L ˜ L n ( α ) = − n L n ( α ) . Thus for m ≠ n ,
( − m ) ⟨ L m ( α ) , L n ( α ) ⟩ w α = ⟨ L ˜ L m ( α ) , L n ( α ) ⟩ w α = ⟨ L m ( α ) , L ˜ L n ( α ) ⟩ w α = ( − n ) ⟨ L m ( α ) , L n ( α ) ⟩ w α .
Hence ( m − n ) ⟨ L m ( α ) , L n ( α ) ⟩ w α = 0 , which yields (45).  □
Remark 2. 
The orthogonality argument above relies only on formal self-adjointness on the admissible class D ˜ α ( w α ) and on the fact that the eigenvalues − n are distinct; it does not invoke completeness of the eigenfunctions or a spectral theorem.

2.11.6. Normalization

Lemma 9 
(Finiteness of the norms). For each n ∈ N 0 , the quantity
h n ( α , R ) : = ∫ 0 R w α ( x ) L n ( α ) ( x ) 2 d x
is finite and positive.
Proof. 
Positivity follows from w α > 0 a.e. on ( 0 , R ) and L n ( α ) ¬ ≡ 0 . For finiteness, note that w α ∈ L 1 ( 0 , R ) for α > 1 / 2 , and L n ( α ) is continuous on [ 0 , R ] . Hence the integrand is bounded on [ δ , R ] for any δ > 0 . Near x = 0 , using L n ( α ) ( x ) = 1 + o ( 1 ) and w α ( x ) ∼ C x − ( 2 α − 1 ) , we have
w α ( x ) L n ( α ) ( x ) 2 = C x − ( 2 α − 1 ) ( 1 + o ( 1 ) ) , x → 0 + ,
which is integrable since − ( 2 α − 1 ) > − 1 .  □
Definition 2 
(Orthonormalized ABC–Laguerre functions). Define
L ^ n ( α ) ( x ) : = 1 h n ( α , R ) L n ( α ) ( x ) , n ∈ N 0 .
Theorem 5 
(Orthonormality on [ 0 , R ] ). The family { L ^ n ( α ) } n ≥ 0 satisfies
∫ 0 R w α ( x ) L ^ m ( α ) ( x ) L ^ n ( α ) ( x ) d x = δ m n , m , n ∈ N 0 .
Proof. 
For m ≠ n this follows from Theorem 4; for m = n it follows directly from the definition (47).  □

2.11.7. Remarks

Remark 3 
(Completeness). We do not claim that { L n ( α ) } n ≥ 0 is complete in L 2 ( [ 0 , R ] ; w α d x ) . A completeness result would require additional functional-analytic arguments and is beyond the scope of this work. In applications, the system is used through finite-dimensional truncations (Galerkin-type approximations).
Remark 4 
(Closed-form structure). No simple closed-form structure (e.g., a Rodrigues formula or a three-term recurrence) is claimed for the ABC–Laguerre functions. The nonlocal nature of the ABC operator leads to global coupling in the coefficient system (12). For computations, L n ( α ) can be evaluated via truncated series and the normalization constants h n ( α , R ) can be obtained by numerical quadrature on [ 0 , R ] .
Remark 5 
(Classical limit). As α → 1 − , the ABC operator is expected (formally) to recover the classical Laguerre differential operator. A rigorous analysis of the limit α → 1 − , including convergence of the eigenfunctions and weights to the classical Laguerre setting, is beyond the scope of the present work.

2.11.8. Summary

We have shown that the regularized functions { L n ( α ) } n ≥ 0 are orthogonal with respect to w α on [ 0 , R ] , and that the normalized family { L ^ n ( α ) } n ≥ 0 is orthonormal in L 2 ( [ 0 , R ] ; w α d x ) . This provides the foundation for truncated ABC–Laguerre expansions on bounded intervals.

3. Numerical Verification and Spectral Illustration

In this section, we provide a detailed numerical investigation supporting the theoretical construction developed in Section 2 and illustrate the practical applicability of the ABC–Laguerre system for spectral approximations. All computations are performed on a fixed bounded interval [ 0 , R ] with R = 5 , and we restrict to the parameter range α ∈ ( 1 / 2 , 1 ) for which the weight w α is locally integrable near the origin (see Section 2.8).
The numerical study is organized as follows. In Section 3.1 we describe the computational framework, including the construction of truncated ABC–Laguerre functions, the evaluation of weighted inner products, and the numerical parameters used throughout. Section 3.2 presents a systematic verification of the orthogonality relations derived in Section 2.11, examining the effects of Frobenius truncation order, quadrature resolution, and conditioning of the Gram matrix. In Section 3.4 we demonstrate the approximation properties of the ABC–Laguerre basis on a model boundary value problem, providing error tables and observed decay rates. Section 3.5 offers a comparison with classical Laguerre polynomials on the same bounded interval, highlighting the adaptation of the ABC basis to the fractional operator. Section 3.6 presents a heuristic numerical study of the behavior of the ABC–Laguerre functions as α → 1 − , showing their tendency toward classical Laguerre polynomials. Finally, Section 3.7 summarizes the numerical findings and discusses the limitations of the computational framework.
The goal of this numerical investigation is not to prove theoretical statements but to provide empirical support for the orthogonality construction, to assess the stability and accuracy of the truncated basis, and to offer practical guidance for its use in spectral methods. All reported quantities are subject to finite-precision arithmetic and truncation errors; their values should be interpreted as numerical evidence rather than exact analytical results.

3.1. Implementation and Computational Framework

We describe the numerical setup used throughout Section 3. All computations are performed in MATLAB (R2023a) using IEEE double-precision arithmetic (approximately 16 decimal digits). The following parameters are fixed unless otherwise stated:
  • Interval length: R = 5 . This choice ensures that the interval is sufficiently large to capture the behavior of the basis functions while keeping the quadrature well-conditioned.
  • Fractional order: α = 0.75 (except in Section 3.6 where α varies toward 1). This value satisfies α > 1 / 2 , guaranteeing local integrability of the weight near x = 0 as established in Section 2.8.
  • Weight function: w α ( x ) = x − ( 2 α − 1 ) E α ( − x α ) with the normalization constant C = 1 (see Remark 2). This weight is evaluated using the Mittag–Leffler series E α ( z ) = ∑ j = 0 ∞ z j / Γ ( α j + 1 ) truncated at J = 100 terms, which provides accuracy well below machine precision for x ∈ [ 0 , R ] .
  • Quadrature: Gauss–Legendre quadrature with Q nodes directly on [ 0 , R ] . For the convergence studies in Section 3.2, we use Q = 2000 as the baseline resolution, and we examine the effect of varying Q.

3.1.1. Construction of Truncated ABC–Laguerre Functions

For each index n ∈ N 0 , the regularized ABC–Laguerre function L n ( α ) ( x ) is defined by the convergent power series
L n ( α ) ( x ) = ∑ k = 0 ∞ a k ( n ) x k ,
where the coefficients a k ( n ) satisfy the infinite linear system A { a k } k ≥ 0 = 0 from (12) with normalization a 0 ( n ) = 1 .
In practice, we truncate the series at a finite order K and solve the projected system
P K A P K { a k } k = 0 K = 0 ,
where P K denotes projection onto the first K + 1 modes. This yields approximate coefficients a k ( K ) ( n ) and the truncated function
L n , K ( α ) ( x ) = ∑ k = 0 K a k ( K ) ( n ) x k .
The truncation order K is selected adaptively: for fixed α and n, we increase K until the relative change in the weighted norm
| ∥ L n , K ( α ) ∥ w α − ∥ L n , K − 1 ( α ) ∥ w α | ∥ L n , K ( α ) ∥ w α < 10 − 12 .
For the parameter range considered in this work, K = 40 is sufficient to achieve this tolerance; this value is used in all subsequent computations unless otherwise indicated.

3.1.2. Evaluation of Weighted Inner Products

All weighted inner products are approximated by
⟨ f , g ⟩ w α ≈ ∑ j = 1 Q ω j w α ( x j ) f ( x j ) g ( x j ) ,
where { x j , ω j } j = 1 Q are the Gauss–Legendre nodes and weights mapped to [ 0 , R ] . The singularity x − ( 2 α − 1 ) at x = 0 is integrable for α > 1 / 2 , and the direct application of Gauss–Legendre quadrature converges rapidly with increasing Q.

3.1.3. Error Measures for Orthogonality

To quantify the numerical orthogonality of the truncated basis, we define the normalized Gram matrix entries
G ˜ m n ( K , Q ) = ∫ 0 R w α ( x ) L m , K ( α ) ( x ) L n , K ( α ) ( x ) d x ∫ 0 R w α ( x ) [ L m , K ( α ) ( x ) ] 2 d x ∫ 0 R w α ( x ) [ L n , K ( α ) ( x ) ] 2 d x .
For an exactly orthonormal system, one would have G ˜ m n = δ m n . We monitor two global error indicators:
E off ( K , Q ) = max 0 ≤ m < n ≤ N | G ˜ m n ( K , Q ) | ,
E diag ( K , Q ) = max 0 ≤ n ≤ N | G ˜ n n ( K , Q ) − 1 | ,
where N is the number of basis functions considered (typically N = 10 ). These measures capture respectively the deviation from orthogonality and the accuracy of the normalization.

3.1.4. Conditioning Assessment

The condition number of the (unnormalized) Gram matrix G ( K , Q ) is computed in the 2-norm as
κ 2 ( G ) = ∥ G ∥ 2 ∥ G − 1 ∥ 2 .
This quantity provides an indicator of numerical stability when the basis is used in Galerkin-type discretizations. Large values of κ 2 ( G ) reflect near-linear dependence of truncated modes and potential loss of significant digits in finite precision. When κ 2 ( G ) approaches 10 12 , we interpret the matrix as numerically ill-conditioned and apply reorthogonalization via Cholesky factorization with iterative refinement to stabilize the basis.

3.1.5. Reference Solution for Spectral Approximation

In Section 3.4, we employ a manufactured reference solution
u ex ( x ) = cos 2 π x R exp − x R ,
which is smooth on [ 0 , R ] and belongs to the admissible class D α ( w α ) . The corresponding right-hand side f = L [ u ex ] is evaluated numerically using the same quadrature and truncation parameters as above. This provides a consistent reference for assessing approximation errors of the truncated ABC–Laguerre expansions.

3.1.6. Reproducibility

All numerical experiments reported in this section are reproducible. The MATLAB scripts implementing the truncated linear system solver, quadrature routines, Gram matrix assembly, and Galerkin projection are available from the corresponding author upon reasonable request. All key numerical parameters (truncation orders K and J, quadrature nodes Q, maximal mode N, and tolerances) are explicitly specified in each table and figure caption to facilitate independent verification.

3.2. Numerical Verification of Orthogonality

We now present a systematic numerical investigation of the orthogonality relations established in Section 2.11. Using the computational framework described in Section 3.1, we construct the truncated ABC–Laguerre functions L n , K ( α ) ( x ) for α = 0.75 , R = 5 , and various truncation orders K. The normalized Gram matrix G ˜ m n ( K , Q ) defined in (53) is computed with quadrature resolution Q, and the error indicators E off and E diag from (54) and (55) are monitored to assess the quality of the numerical orthogonality.
Unless otherwise specified, we use N = 10 basis functions (indices n = 0 , 1 , … , 9 ), which is sufficient to capture the convergence behavior while keeping the computational cost manageable.

3.2.1. Effect of Frobenius Truncation Order K

Table 1 displays the behavior of the orthogonality errors as the Frobenius series truncation order K increases. For a fixed quadrature resolution Q = 2000 , we compute E off ( K , 2000 ) and E diag ( K , 2000 ) for K = 20 , 30 , 40 , 50 .
Table 1. Orthogonality errors versus Frobenius truncation order K. The quadrature resolution is fixed at Q = 2000 , and N = 10 basis functions are used. The quantities E off and E diag are defined in (54) and (55), respectively.
The results in Table 1 demonstrate a rapid decay of both error indicators as K increases. The errors decrease by approximately two orders of magnitude between K = 20 and K = 30 , and similarly between K = 30 and K = 40 . At K = 50 , the errors approach the limits imposed by double-precision arithmetic (approximately 10 − 15 relative accuracy) and the conditioning of the linear system. The diagonal errors E diag remain consistently smaller than the off-diagonal ones, indicating that the normalization constants are accurately captured. Based on these results, the choice K = 40 provides orthogonality errors below 10 − 8 , which is sufficient for the spectral computations in subsequent sections.

3.2.2. Effect of Quadrature Resolution Q

We next examine the influence of the quadrature resolution on the orthogonality errors. Table 2 reports E off and E diag for different numbers of Gauss–Legendre nodes Q, with the truncation order fixed at K = 40 and N = 10 basis functions.
Table 2. Orthogonality errors versus quadrature resolution Q. The Frobenius truncation order is fixed at K = 40 , and N = 10 basis functions are used. The errors are defined in (54) and (55).
Table 2 shows that the quadrature error decreases steadily as Q increases, with a significant drop between Q = 500 and Q = 1000 . At Q = 1000 , the errors are already below 10 − 8 , and further increase to Q = 2000 yields a modest improvement. The close agreement between Q = 2000 and Q = 4000 confirms that Q = 2000 is sufficient for the computations in this work, with errors dominated by series truncation rather than quadrature.

3.2.3. Gram Matrix Visualization

To provide a qualitative view of the orthogonality, Figure 1 displays the absolute values of the normalized Gram matrix entries | G ˜ m n ( 40 , 2000 ) | for m , n = 0 , … , 9 . The computation uses the optimal parameters identified above: K = 40 and Q = 2000 .
Figure 1. Absolute values of the normalized Gram matrix entries | G ˜ m n ( 40 , 2000 ) | for m , n = 0 , … , 9 . The diagonal entries are exactly 1 (by construction), and off-diagonal entries are below 10 − 8 , with the largest values occurring near the anti-diagonal.
The visualization exhibits strong diagonal dominance, with off-diagonal entries several orders of magnitude smaller than unity. The largest off-diagonal entries occur near the anti-diagonal ( m + n ≈ 9 ) and are approximately 9.7 × 10 − 9 , consistent with the values reported in Table 1. This graphical evidence confirms that the truncated ABC–Laguerre functions form a numerically orthonormal system on [ 0 , R ] with respect to the weight w α , within the limits of double-precision arithmetic and the chosen truncation parameters.

3.2.4. Summary of Orthogonality Verification

The numerical experiments in this subsection indicate that
  • The orthogonality error decreases rapidly as the truncation order K increases, reaching below 10 − 8 at K = 40 .
  • Quadrature resolution Q = 2000 is sufficient to achieve errors dominated by series truncation rather than numerical integration.
  • The Gram matrix exhibits strong diagonal dominance, with off-diagonal entries at least eight orders of magnitude smaller than unity.
These findings are consistent with the orthogonality relations derived in Section 2, within the limitations imposed by truncation and finite-precision arithmetic.

3.3. Conditioning and Numerical Stability

The numerical stability of the ABC–Laguerre basis is closely related to the conditioning of the Gram matrix. In this subsection, we examine the condition number of the unnormalized Gram matrix G ( K , Q ) (before the normalization step (53)), as this reflects the intrinsic linear independence of the basis functions prior to scaling.
The condition number in the 2-norm is defined as
κ 2 ( G ) = ∥ G ∥ 2 ∥ G − 1 ∥ 2 ,
and is computed using MATLAB’s ‘cond’ function with double-precision arithmetic. All computations are performed with truncation order K = 40 and quadrature resolution Q = 2000 , as established in Section 3.2.
Table 3 reports κ 2 ( G ) for increasing basis sizes N = 5 , 10 , 15 , 20 , where G is constructed from the first N basis functions { L n , K ( α ) } n = 0 N − 1 .
Table 3. Condition numbers κ 2 ( G ) of the unnormalized Gram matrix for increasing basis size N, with K = 40 and Q = 2000 .
The results show that the condition number grows steadily with N, reaching approximately 10 6 for N = 20 . This behavior is consistent with classical polynomial systems on bounded intervals, where the unnormalized Gram matrix scales roughly with the square of the maximal basis amplitude over the interval. The growth reflects the increasing dynamic range of the basis functions as N increases.
In contrast, the normalized Gram matrix G ˜ defined in (53) has condition numbers extremely close to unity. For N = 20 , direct computation yields κ 2 ( G ˜ ) ≈ 1.0000003 , which is within 3 × 10 − 7 of the identity. This confirms the numerical orthogonality established in Section 3.2 and is consistent with Gershgorin’s circle theorem given the off-diagonal entries | G ˜ m n | ≲ 10 − 8 reported in Figure 1.
For practical Galerkin computations, we recommend the following strategies:
  • Use the normalized basis L ^ n ( α ) defined in (47) to ensure well-conditioned linear systems.
  • For the unnormalized basis, apply orthogonalization via QR decomposition of the function values at quadrature nodes.
  • When working with the linear system (50) for coefficient computation, the condition number remains moderate (approximately 8.7 × 10 2 for K = 40 ), indicating stable determination of the coefficients a k ( n ) .
Remark 6. 
The distinction between normalized and unnormalized Gram matrices is crucial for interpreting condition numbers. While the unnormalized basis exhibits conditioning typical of spectral bases on bounded intervals, the normalized basis confirms that the functions themselves are numerically orthonormal to high precision. This duality is a common feature of well-designed spectral methods.

3.4. Spectral Approximation of a Model Problem

We now demonstrate the practical effectiveness of the ABC–Laguerre basis for spectral approximation on [ 0 , R ] . To obtain a controlled convergence test, we use a manufactured smooth target function and study the decay of the weighted projection error.
Let u ex ( x ) be the manufactured reference solution
u ex ( x ) = cos 2 π x R exp − x R , x ∈ [ 0 , R ] ,
with R = 5 . The function u ex is smooth on [ 0 , R ] and the weighted inner products appearing below are finite for α = 0.75 (numerically verified under the same quadrature and truncation parameters used throughout this section). The corresponding right-hand side f = L [ u ex ] is evaluated numerically using the framework described in Section 3.1.
For a given expansion order N, we approximate u ex by its weighted orthogonal projection onto the span of the first N + 1 normalized basis functions:
u N ( x ) = ∑ n = 0 N c n L ^ n ( α ) ( x ) ,
with coefficients
c n = u ex , L ^ n ( α ) w α = ∫ 0 R w α ( x ) u ex ( x ) L ^ n ( α ) ( x ) d x .
All integrals are computed by Gauss–Legendre quadrature with Q = 2000 nodes.
We measure the weighted L 2 error
E N = ∥ u ex − u N ∥ L w α 2 = ∫ 0 R w α ( x ) u ex ( x ) − u N ( x ) 2 d x 1 / 2 .
Table 4 reports E N for increasing N. Since the sequence uses increments of 2, we report the observed decay exponent
p N = log 2 E N − 2 E N , N ≥ 4 ,
which measures how the error decreases when two additional modes are added.
Table 4. Convergence of the spectral approximation u N to the manufactured solution u ex . The weighted L 2 error E N is shown for increasing expansion orders N, together with the observed decay exponent p N defined in (63). Computations use α = 0.75 , R = 5 , K = 40 , and Q = 2000 .
The results show a rapid and systematic decay of the approximation error as N increases. Over the range tested, the decay exponents remain close to p N ≈ 2 , indicating an approximately second-order algebraic decrease in the weighted L 2 error for this particular manufactured solution and parameter set. This behavior is consistent with a well-conditioned orthogonal projection in a weighted space on a finite interval.
Figure 2 plots E N versus N on a logarithmic scale. The curve is monotone and nearly linear over the displayed range, illustrating the fast error reduction achieved with relatively few modes.
Figure 2. Log-scale plot of the weighted L 2 error E N versus expansion order N for the projection of u ex onto the first N + 1 ABC–Laguerre modes.
We emphasize that this experiment is intended as numerical evidence of approximation effectiveness rather than a convergence theorem. The observed error decay depends on the test function, the finite-interval setting, and the numerical construction parameters (in particular K and Q). Nevertheless, the results confirm that the ABC–Laguerre basis can deliver high accuracy on [ 0 , R ] with modest expansion order, complementing the orthogonality verification in Section 3.2.

3.5. Comparison with Classical Laguerre Polynomials

To further assess the practical behavior of the ABC–Laguerre basis, we compare its approximation performance with that of classical Laguerre polynomials on the same bounded interval [ 0 , R ] . This comparison illustrates how a basis adapted to the ABC operator behaves relative to the classical orthogonal system designed for the half-line.
We consider the same manufactured solution u ex ( x ) defined in (59) and measure approximation errors using the weighted norm ∥ · ∥ L w α 2 introduced in (62).
For the ABC–Laguerre basis, we use the orthonormal functions L ^ n ( α ) ( x ) with α = 0.75 .
For the classical Laguerre system, we use the standard orthonormal Laguerre polynomials L ^ n ( x ) satisfying
∫ 0 ∞ e − x L ^ m ( x ) L ^ n ( x ) d x = δ m n .
Since the error is evaluated in the weighted space L w α 2 ( 0 , R ) , the classical Laguerre polynomials are not orthogonal under the error norm. The comparison therefore reflects approximation behavior under the same numerical projection framework and error metric, rather than a comparison of optimally matched orthogonal systems.
Table 5 reports the approximation errors E N for both bases at expansion orders N = 4 , 6 , 8 , 10 . The observed decay exponents p N (defined in (63)) are included for reference.
Table 5. Comparison of approximation errors E N between the ABC–Laguerre basis ( α = 0.75 ) and classical Laguerre polynomials on [ 0 , R ] with R = 5 . Errors are measured in the weighted norm ∥ · ∥ L w α 2 . All computations use K = 40 and Q = 2000 .
The results show that both bases achieve comparable accuracy for the tested smooth function. The errors are of the same order of magnitude at each expansion order, with differences below approximately 10%.
The observed decay exponents remain close to 2 for both bases, indicating similar algebraic error decay in the weighted norm. This suggests that, for smooth functions on a finite interval, the ABC–Laguerre basis provides approximation quality comparable to classical Laguerre polynomials, despite being constructed from a different operator-theoretic principle.
We emphasize that this comparison is illustrative rather than a claim of superiority. The ABC–Laguerre basis is designed to be compatible with the structure of the ABC operator and the Mittag–Leffler weight w α ( x ) . The close agreement in errors indicates that this adaptation does not lead to degradation in approximation performance.
These findings complement the orthogonality verification in Section 3.2 and the convergence study in Section 3.4, further supporting the practical viability of the ABC–Laguerre system on bounded intervals.

3.6. Heuristic Study of the Limit α → 1 −

As the fractional order α approaches 1, the ABC operator is expected to recover the classical first-order derivative in a formal sense, and the Mittag–Leffler weight w α ( x ) = x − ( 2 α − 1 ) E α ( − x α ) converges pointwise to e − x (up to normalization). In this subsection, we present a heuristic numerical investigation of this limiting behavior, examining how the ABC–Laguerre functions L n ( α ) ( x ) approach the classical Laguerre polynomials L n ( x ) as α → 1 − .
We emphasize that this study is purely numerical and does not constitute a rigorous proof of convergence. The results are intended to provide intuition and to illustrate the consistency of the ABC–Laguerre construction with the classical theory in the limit.

3.6.1. Setup and Methodology

For α ∈ { 0.90 , 0.95 , 0.99 , 0.999 } , we compute the regularized ABC–Laguerre functions L n ( α ) ( x ) for n = 0 , 1 , 2 , 3 using the same numerical framework described in Section 3.1 (truncation order K = 40 , quadrature Q = 2000 ). The classical Laguerre polynomials L n ( x ) are evaluated using standard recurrence relations and restricted to the same interval [ 0 , R ] with R = 5 .
To quantify the deviation from the classical limit, we compute the normalized L 2 difference
d n ( α ) = ∫ 0 R | L n ( α ) ( x ) − L n ( x ) | 2 d x 1 / 2 ∫ 0 R | L n ( x ) | 2 d x 1 / 2 ,
which measures the relative error between the ABC–Laguerre function and the corresponding classical Laguerre polynomial. We use the unweighted L 2 ( 0 , R ) norm here to isolate the shape difference between the functions themselves, independent of any weight normalization. The integrals are evaluated using Gauss–Legendre quadrature with Q = 2000 nodes.

3.6.2. Numerical Results

Table 6 reports the deviations d n ( α ) for n = 0 , 1 , 2 , 3 and the four values of α listed above.
Table 6. Normalized L 2 deviations d n ( α ) between ABC–Laguerre functions L n ( α ) ( x ) and classical Laguerre polynomials L n ( x ) for α approaching 1. Computations use R = 5 , K = 40 , and Q = 2000 .
The results in Table 6 show a clear and systematic decrease in the deviations as α approaches 1. For α = 0.999 , the relative errors are below 0.2 % for all modes tested, indicating that the ABC–Laguerre functions are numerically indistinguishable from classical Laguerre polynomials at this proximity to the limit. The deviations decrease approximately proportionally to 1 − α over the tested range, indicating a nearly linear trend in the numerical data.
Figure 3 provides a graphical illustration of this behavior, plotting the deviations d n ( α ) against 1 − α on a log-log scale. The approximately linear trends confirm the nearly linear relationship and show consistent behavior across the different polynomial orders.
Figure 3. Log-log plot of the normalized deviations d n ( α ) versus 1 − α for n = 0 , 1 , 2 , 3 . The approximately linear trends indicate a nearly linear decrease in the deviations as α → 1 − .

3.6.3. Discussion and Interpretation

The numerical evidence presented here supports the heuristic expectation that the ABC–Laguerre functions approach classical Laguerre polynomials as α → 1 − . The observed nearly linear scaling with 1 − α is consistent with the linearization of the Mittag–Leffler kernel near α = 1 and the continuous dependence of the Frobenius coefficients on the fractional parameter.
Several important caveats should be noted:
  • This study is purely numerical and does not constitute a rigorous convergence proof. A complete analytical treatment of the limit α → 1 − would require a detailed asymptotic analysis of the ABC operator and its eigenfunctions, which is beyond the scope of the present work.
  • The convergence is observed on the finite interval [ 0 , R ] with R = 5 . The behavior on the half-line ( 0 , ∞ ) may differ and would require additional analysis.
  • The deviations d n ( α ) depend on the truncation parameters K and Q; however, the values reported in Table 6 are stable under further refinement, indicating that the observed trends are not numerical artifacts.
Despite these limitations, the heuristic results provide valuable intuition and confirm that the ABC–Laguerre construction is consistent with the classical theory in the limit α → 1 − . This consistency further supports the soundness of the fractional generalization developed in this work.

3.6.4. Summary of Findings

The numerical experiments in this subsection demonstrate that
  • The ABC–Laguerre functions approach classical Laguerre polynomials as α → 1 − , with deviations decreasing approximately proportionally to 1 − α .
  • For α = 0.999 , the relative errors are below 0.2 % for n = 0 , 1 , 2 , 3 , indicating excellent agreement with the classical limit.
  • The observed trends are consistent across different polynomial orders and are stable under refinement of numerical parameters.
These findings complement the orthogonality verification in Section 3.2 and the convergence studies in Section 3.4 and Section 3.5, providing a complete numerical portrait of the ABC–Laguerre system’s properties.

3.7. Discussion and Limitations

The numerical experiments presented in Section 3.2, Section 3.3, Section 3.4, Section 3.5 and Section 3.6 provide substantial evidence supporting the theoretical construction of the ABC–Laguerre system and demonstrate its practical utility for spectral approximations on bounded intervals. In this subsection, we summarize the key findings and discuss the limitations of both the numerical framework and the underlying theory. The purpose of the present work is the constructive and structural development of the ABC–Laguerre system on bounded intervals; a complete spectral characterization is deferred to future investigation.

3.7.1. Summary of Numerical Findings

The numerical results can be summarized as follows:
  • Orthogonality verification (Section 3.2): The normalized Gram matrix G ˜ m n ( K , Q ) exhibits off-diagonal entries below 10 − 8 for K = 40 and Q = 2000 , confirming that the truncated ABC–Laguerre functions are numerically orthonormal within the limits of double-precision arithmetic. The convergence studies with respect to the truncation order K and quadrature resolution Q demonstrate that the errors are dominated by series truncation rather than numerical integration for the chosen parameters.
  • Conditioning (Section 3.3): The unnormalized Gram matrix shows moderate growth in condition number ( κ 2 ( G ) ≈ 10 6 for N = 20 ), which is typical for spectral bases on bounded intervals. The normalized Gram matrix, however, has condition numbers very close to unity in the tested range ( κ 2 ( G ˜ ) ≈ 1.0000003 for N = 20 ), confirming that the orthonormalized basis is well-conditioned for Galerkin computations.
  • Spectral approximation (Section 3.4): The ABC–Laguerre basis achieves rapid convergence for smooth functions, with weighted L 2 errors decreasing to 6.58 × 10 − 6 using only N = 14 modes. The observed decay exponents p N ≈ 2 indicate approximately second-order algebraic convergence for the tested manufactured solution.
  • Comparison with classical Laguerre (Section 3.5): Under the same weighted norm ∥ · ∥ L w α 2 , the ABC–Laguerre basis performs comparably to classical Laguerre polynomials, with errors differing by less than 10 % for all tested expansion orders. This demonstrates that the adaptation to the ABC operator does not compromise approximation quality.
  • Limit α → 1 − (Section 3.6): The ABC–Laguerre functions approach classical Laguerre polynomials as α tends to 1, with deviations d n ( α ) decreasing approximately proportionally to 1 − α . For α = 0.999 , the relative errors are below 0.2 % , confirming the consistency of the fractional construction with the classical limit.

3.7.2. Limitations of the Numerical Framework

Despite the positive results, several limitations of the numerical implementation should be acknowledged:
  • Finite interval restriction: All computations are performed on the bounded interval [ 0 , R ] with R = 5 . The behavior of the ABC–Laguerre basis on the half-line ( 0 , ∞ ) remains unexplored and would require additional analysis of decay conditions and boundary terms at infinity. The algebraic decay of the Mittag–Leffler weight w α ( x ) as x → ∞ suggests that a direct extension may not yield square- integrable functions without further modifications.
  • Parameter range: The numerical studies are limited to α = 0.75 (except for the limit study) and R = 5 . While these values are representative, the behavior for other α ∈ ( 1 / 2 , 1 ) and different interval lengths R may differ. A comprehensive parameter study would be necessary to fully characterize the basis properties.
  • Truncation dependence: The results depend on the truncation order K = 40 and quadrature resolution Q = 2000 . Although convergence studies indicate that these choices are adequate, the optimal parameters may vary with α , R, and the specific application.
  • Mittag–Leffler evaluation: The Mittag–Leffler function E α ( − x α ) is evaluated via truncated series with J = 100 terms. While this provides sufficient accuracy for the tested range, functions with x near R and α close to 1 may require additional terms or more sophisticated evaluation methods.
  • Conditioning at higher orders: For N > 20 , the condition number of the unnormalized Gram matrix exceeds 10 6 , which may lead to loss of accuracy in double-precision arithmetic. Applications requiring higher resolution would need to employ extended precision or alternative orthogonalization strategies.

3.7.3. Theoretical Limitations and Open Questions

The numerical results must be interpreted within the context of the theoretical framework established in Section 2. Several important limitations of the theory should be emphasized:
  • Formal self-adjointness: The theoretical analysis establishes formal self-adjointness of the operator L on the admissible domain D α ( w α ) . A rigorous functional-analytic treatment (closedness, density, spectral theorem) is not provided and remains an open problem. The numerical confirmation of orthogonality does not substitute for a complete spectral theory.
  • Completeness: The paper does not prove that the system { L n ( α ) } n ≥ 0 is complete in L 2 ( [ 0 , R ] ; w α d x ) . While the numerical experiments demonstrate rapid approximation of a smooth test function, this does not constitute a proof of completeness for arbitrary functions in the space.
  • Eigenvalue problem: The construction is based on a formal eigenvalue problem x D α y + ( 1 − x ) I 1 − α y + n y = 0 . A rigorous characterization of the spectrum and the nature of the solutions (existence, uniqueness, completeness) is not provided.
  • Half-line extension: The theory is intentionally developed on bounded intervals [ 0 , R ] . Extending the construction to the half-line ( 0 , ∞ ) would require a careful treatment of boundary conditions at infinity and the algebraic decay of the weight. This remains a significant open challenge.
  • Parameter restrictions: The condition α > 1 / 2 is necessary for local integrability of the weight near x = 0 . The regime α ≤ 1 / 2 would require a distributional formulation or finite-part regularization, which is not addressed in this work.

3.7.4. Practical Recommendations

Based on the numerical findings, we offer the following recommendations for practical use of the ABC–Laguerre basis:
  • For most applications on [ 0 , R ] with R ≈ 5 , the parameters K = 40 and Q = 2000 provide a good balance between accuracy and computational cost.
  • The orthonormalized basis L ^ n ( α ) should be used in Galerkin computations to ensure well-conditioned linear systems.
  • For N ≤ 15 , direct solution of the Gram system is stable; for larger N, QR-based orthogonalization is recommended.
  • When α is very close to 1, additional terms in the Mittag–Leffler series ( J > 100 ) may be needed to maintain accuracy.

3.7.5. Concluding Remarks on the Numerical Study

The numerical experiments in Section 3 provide strong empirical support for the theoretical construction of the ABC–Laguerre system. The results confirm orthogonality, demonstrate rapid convergence for smooth functions, and illustrate the consistency with classical Laguerre polynomials in the limit α → 1 − . The identified limitations and open questions highlight directions for future research, both in numerical analysis and in the underlying functional-analytic theory. Despite these limitations, the numerical evidence confirms that the ABC–Laguerre basis is a viable tool for spectral approximations on bounded intervals and provides a solid foundation for further developments.

4. Concluding Remarks

In this work we developed a structured orthogonal function system associated with the Atangana–Baleanu–Caputo fractional derivative on bounded intervals [ 0 , R ] for α ∈ ( 1 / 2 , 1 ) . Starting from a fractional Laguerre-type eigenvalue problem, we derived a Frobenius series solution and identified the structural exponent β = α − 1 through consistency of the operator rather than through a classical indicial equation. A weighted integration-by-parts formula combined with a Volterra integral uniqueness argument allowed us to establish the formal self-adjointness of the operator L on the admissible domain D α ( w α ) with respect to the weight w α ( x ) = x − ( 2 α − 1 ) E α ( − x α ) . After removing the universal singular factor x α − 1 via a similarity transformation, we obtained regularized eigenfunctions L n ( α ) ( x ) = x 1 − α y n ( x ) that are continuous on [ 0 , R ] and orthogonal in L 2 ( [ 0 , R ] ; w α d x ) . Numerical experiments confirmed the orthogonality up to machine precision within the tested parameter range, demonstrated rapid spectral convergence for a model problem, and illustrated the consistency of the construction with classical Laguerre polynomials in the limit α → 1 − . The work provides a structured orthogonal system suitable for spectral approximations of problems involving the ABC operator on bounded intervals, with the weight function emerging naturally from the operator structure rather than being imposed by analogy.
Several directions remain open for future investigation. The orthogonality theory was developed on finite intervals [ 0 , R ] ; extending the construction to the half-line ( 0 , ∞ ) would require additional decay conditions on the basis or a different functional setting to accommodate the algebraic decay of the Mittag–Leffler weight. A rigorous proof of completeness of the system { L n ( α ) } in L 2 ( [ 0 , R ] ; w α d x ) remains an open analytical problem, as does a full spectral characterization of the operator L including closedness, density of the domain, and the nature of the spectrum. The restriction α > 1 / 2 is necessary for local integrability of the weight; the regime α ≤ 1 / 2 would require a distributional formulation or finite-part regularization. The asymptotic behavior of the normalization constants h n ( α , R ) and of the eigenfunctions themselves as n → ∞ also deserves further investigation, particularly for deriving sharper convergence estimates. Finally, the numerical framework could be extended to higher dimensions, systems of equations, and more challenging boundary value problems to further assess the practical utility of the ABC–Laguerre basis.

Author Contributions

Conceptualization, methodology: M.A. and D.A.; Formal analysis and theoretical investigation: M.A. and D.A.; Writing—original draft preparation: M.A.; Writing—review and editing: 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. KFU261188]. 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 data were generated or analyzed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Rigorous Verification of the Weight via a Right-Volterra Uniqueness Argument

In this appendix we provide a rigorous verification that the weight
w α ( x ) = C x − ( 2 α − 1 ) E α ( − x α ) , C > 0 ,
satisfies the formal self-adjointness identity of Theorem 2 for all admissible functions g satisfying the additional continuity conditions
x w α g ∈ C ( [ 0 , R ] ) , ( 1 − x ) w α g ∈ C ( [ 0 , R ] ) .
(These conditions hold, in particular, for the ABC–Laguerre basis functions constructed in Section 2 after the regularization step).
The proof uses a homogeneous right-Volterra integral equation and a uniqueness argument based on factorial/Gamma decay of iterates. All identities below are established first in C ( [ 0 , R ] ) and then interpreted pointwise almost everywhere for functions satisfying (A2). Throughout, α ∈ ( 1 / 2 , 1 ) and R ∈ ( 0 , ∞ ) are fixed.

Appendix A.1. Right-Sided Operators with Terminal R

We recall the right-sided operators with terminal point R used in the paper. Set
κ = α 1 − α .
The AB normalization function B ( · ) satisfies B ( 0 ) = B ( 1 ) = 1 ; we keep B ( α ) and B ( 1 − α ) symbolic.
  • Right-sided Riemann–Liouville integral.
For β > 0 and 0 < x < R ,
( I R − β R L ϕ ) ( x ) : = 1 Γ ( β ) ∫ x R ( t − x ) β − 1 ϕ ( t ) d t .
  • Right-sided AB integral.
For 0 < x < R ,
( I R − 1 − α A B ϕ ) ( x ) : = 1 − α B ( 1 − α ) ϕ ( x ) + α B ( 1 − α ) ( I R − 1 − α R L ϕ ) ( x ) .
  • Right-sided adjoint ABC operator.
For 0 < x < R ,
( D R − α A B C φ ) ( x ) : = B ( α ) 1 − α φ ( x ) − κ ∫ x R φ ( t ) ( t − x ) α − 1 E α , α − κ ( t − x ) α d t .

Appendix A.2. Mapping Properties and Operator Bounds on C([0,R])

The following bounds will be used to justify continuity of the error functional and to estimate Volterra iterates.
Lemma A1 
(Boundedness of I R − 1 − α R L and I R − 1 − α A B on C ( [ 0 , R ] ) ). Let α ∈ ( 0 , 1 ) and R ∈ ( 0 , ∞ ) . If ψ ∈ C ( [ 0 , R ] ) , then I R − 1 − α R L ψ ∈ C ( [ 0 , R ] ) and
∥ I R − 1 − α R L ψ ∥ ∞ ≤ R 1 − α Γ ( 2 − α ) ∥ ψ ∥ ∞ .
Consequently, I R − 1 − α A B ψ ∈ C ( [ 0 , R ] ) and
∥ I R − 1 − α A B ψ ∥ ∞ ≤ 1 − α B ( 1 − α ) + α B ( 1 − α ) R 1 − α Γ ( 2 − α ) ∥ ψ ∥ ∞ .
Proof. 
For x ∈ ( 0 , R ) ,
| ( I R − 1 − α R L ψ ) ( x ) | ≤ ∥ ψ ∥ ∞ Γ ( 1 − α ) ∫ x R ( t − x ) − α d t = ∥ ψ ∥ ∞ Γ ( 1 − α ) · ( R − x ) 1 − α 1 − α ≤ R 1 − α Γ ( 2 − α ) ∥ ψ ∥ ∞ ,
using Γ ( 2 − α ) = ( 1 − α ) Γ ( 1 − α ) . Continuity follows by dominated convergence. The AB bound follows from (A5) and (A7).  □
Lemma A2 
(Boundedness of D R − α A B C on C ( [ 0 , R ] ) ). Let α ∈ ( 0 , 1 ) and R ∈ ( 0 , ∞ ) . If ϕ ∈ C ( [ 0 , R ] ) , then D R − α A B C ϕ ∈ C ( [ 0 , R ] ) and
∥ D R − α A B C ϕ ∥ ∞ ≤ B ( α ) 1 − α 1 + κ M α , R ∥ ϕ ∥ ∞ ,
where
M α , R : = ∫ 0 R s α − 1 | E α , α ( − κ s α ) | d s < ∞ .
Proof. 
From (A6), for x ∈ ( 0 , R ) ,
| ( D R − α A B C ϕ ) ( x ) | ≤ B ( α ) 1 − α ∥ ϕ ∥ ∞ + κ B ( α ) 1 − α ∥ ϕ ∥ ∞ ∫ 0 R − x u α − 1 | E α , α ( − κ u α ) | d u .
The integral is bounded by M α , R , which is finite since u α − 1 is integrable near 0 and E α , α is continuous (hence bounded) on [ 0 , κ R α ] . Continuity follows by dominated convergence.  □

Appendix A.3. The Error Functional and a Homogeneous Right-Volterra Equation

Let L denote the operator defined in (16). For a given admissible function g satisfying (A2), define
A ( x ) : = x w α ( x ) g ( x ) , B ( x ) : = ( 1 − x ) w α ( x ) g ( x ) , x ∈ [ 0 , R ] ,
and introduce the error functional
F g ( x ) : = D R − α A B C A ( x ) + I R − 1 − α A B B ( x ) − w α ( x ) L [ g ] ( x ) , 0 < x < R .
The target weight identity (34) is equivalent to F g ≡ 0 on ( 0 , R ) .
We now show that F g satisfies a homogeneous right-Volterra integral equation F g = V [ F g ] on [ 0 , R ] with an explicitly bounded weakly singular kernel.
Lemma A3 
(Right-Volterra equation for F g ). Assume g is admissible and satisfies (A2). Then F g ∈ C ( [ 0 , R ] ) and
F g = V [ F g ] on [ 0 , R ] ,
where V : C ( [ 0 , R ] ) → C ( [ 0 , R ] ) is the right-Volterra integral operator
( V f ) ( x ) : = ∫ x R K V ( x , t ) f ( t ) d t , 0 ≤ x ≤ R ,
with kernel
K V ( x , t ) : = κ B ( α ) 1 − α ( t − x ) α − 1 E α , α − κ ( t − x ) α + α B ( 1 − α ) Γ ( 1 − α ) ( t − x ) − α , 0 ≤ x < t ≤ R .
Proof. 
By Lemmas A1 and A2, both D R − α A B C A and I R − 1 − α A B B belong to C ( [ 0 , R ] ) , and hence F g ∈ C ( [ 0 , R ] ) .
Expand the operators in (A12) using (A6) and (A5):
F g ( x ) = B ( α ) 1 − α A ( x ) − κ B ( α ) 1 − α ∫ x R A ( t ) ( t − x ) α − 1 E α , α − κ ( t − x ) α d t + 1 − α B ( 1 − α ) B ( x ) + α B ( 1 − α ) ( I R − 1 − α R L B ) ( x ) − w α ( x ) L [ g ] ( x ) .
Rearrange this identity to isolate w α L [ g ] :
w α ( x ) L [ g ] ( x ) = B ( α ) 1 − α A ( x ) + 1 − α B ( 1 − α ) B ( x ) + α B ( 1 − α ) ( I R − 1 − α R L B ) ( x ) − κ B ( α ) 1 − α ∫ x R A ( t ) ( t − x ) α − 1 E α , α − κ ( t − x ) α d t − F g ( x ) .
Substitute (A16) back into the definition (A12). All terms involving A and B cancel identically, leaving only terms involving F g . More precisely,
F g ( x ) = κ B ( α ) 1 − α ∫ x R F g ( t ) ( t − x ) α − 1 E α , α − κ ( t − x ) α d t + α B ( 1 − α ) ( I R − 1 − α R L F g ) ( x ) .
Finally, rewrite the Riemann–Liouville term using (A4) with β = 1 − α :
( I R − 1 − α R L F g ) ( x ) = 1 Γ ( 1 − α ) ∫ x R ( t − x ) − α F g ( t ) d t .
Combining the two integrals yields (A13) with kernel (A15).  □
Remark A1. 
Lemma A3 is purely algebraic: it uses only the operator decompositions (A5) and (A6), and linearity. No termwise series matching is used.

Appendix A.4. Uniqueness for the Homogeneous Right-Volterra Equation

We now prove that the only continuous solution of F = V F is F ≡ 0 . The key point is that the kernel is weakly singular, and iterates of V exhibit Gamma-factor decay.
Lemma A4 
(Kernel bound). The kernel K V defined in (A15) satisfies
| K V ( x , t ) | ≤ C 1 ( t − x ) α − 1 + C 2 ( t − x ) − α , 0 ≤ x < t ≤ R ,
where
C 1 : = κ B ( α ) 1 − α sup y ∈ [ 0 , κ R α ] | E α , α ( − y ) | , C 2 : = α B ( 1 − α ) Γ ( 1 − α ) .
Proof. 
Since E α , α is continuous on [ 0 , ∞ ) , it is bounded on [ 0 , κ R α ] . Apply the triangle inequality to (A15).  □
Lemma A5 
(Boundedness of V on C ( [ 0 , R ] ) ). The operator V maps C ( [ 0 , R ] ) into itself and satisfies
∥ V f ∥ ∞ ≤ M V ∥ f ∥ ∞ , M V : = C 1 R α α + C 2 R 1 − α 1 − α .
Proof. 
Using (A17), for x ∈ [ 0 , R ] ,
| ( V f ) ( x ) | ≤ ∥ f ∥ ∞ ∫ x R C 1 ( t − x ) α − 1 + C 2 ( t − x ) − α d t = ∥ f ∥ ∞ C 1 ( R − x ) α α + C 2 ( R − x ) 1 − α 1 − α ≤ M V ∥ f ∥ ∞ .
Continuity follows from dominated convergence.  □
Lemma A6 
(Iterated bounds and decay). There exists a constant C * > 0 , depending only on α, R, C 1 and C 2 , such that
∥ V n ∥ ∞ → ∞ ≤ ( C * ) n Γ ( n ( 1 − α ) + 1 ) , n ∈ N .
In particular, ∥ V n ∥ ∞ → ∞ → 0 as n → ∞ .
Proof. 
For f ∈ C ( [ 0 , R ] ) and x ∈ [ 0 , R ] , the n-fold iterate admits the simplex representation
( V n f ) ( x ) = ∫ x ≤ t 1 ≤ ⋯ ≤ t n ≤ R ∏ j = 1 n K V ( t j − 1 , t j ) f ( t n ) d t n ⋯ d t 1 , t 0 : = x .
Taking absolute values and applying (A17) to each factor yields a sum of 2 n terms, each corresponding to exponents γ j ∈ { α − 1 , − α } :
| ( V n f ) ( x ) | ≤ ∥ f ∥ ∞ ∑ γ 1 , … , γ n ∈ { α − 1 , − α } ∏ j = 1 n C ( γ j ) ∫ x ≤ t 1 ≤ ⋯ ≤ t n ≤ R ∏ j = 1 n ( t j − t j − 1 ) γ j d t n ⋯ d t 1 ,
where C ( α − 1 ) = C 1 and C ( − α ) = C 2 .
Perform the change of variables s j = t j − t j − 1 ≥ 0 . The integration region becomes the simplex Σ n ( R − x ) = { s ∈ R + n : s 1 + ⋯ + s n ≤ R − x } , and the standard simplex integral formula gives
∫ Σ n ( R − x ) ∏ j = 1 n s j γ j d s 1 ⋯ d s n = ( R − x ) n + ∑ j = 1 n γ j Γ n + ∑ j = 1 n γ j + 1 ∏ j = 1 n Γ ( γ j + 1 ) .
Now γ j ∈ { α − 1 , − α } implies γ j + 1 ∈ { α , 1 − α } , hence Γ ( γ j + 1 ) ≤ max { Γ ( α ) , Γ ( 1 − α ) } = : G α and ∏ j = 1 n Γ ( γ j + 1 ) ≤ G α n . Moreover, if exactly k of the γ j equal α − 1 , then
n + ∑ j = 1 n γ j = n ( 1 − α ) + ( 2 α − 1 ) k ≥ n ( 1 − α ) ,
so Γ ( n + ∑ γ j + 1 ) ≥ Γ ( n ( 1 − α ) + 1 ) by monotonicity of Γ on [ 1 , ∞ ) . Also ( R − x ) n + ∑ γ j ≤ R n + ∑ γ j ≤ R n + ( 2 α − 1 ) n ≤ R 2 n since 2 α − 1 ∈ ( 0 , 1 ) . Therefore every term is bounded by
C 1 k C 2 n − k R 2 n Γ ( n ( 1 − α ) + 1 ) G α n .
Summing over k = 0 , … , n yields ( C 1 + C 2 ) n , so
∥ ( V n f ) ∥ ∞ ≤ ∥ f ∥ ∞ G α R 2 ( C 1 + C 2 ) n Γ ( n ( 1 − α ) + 1 ) .
This proves (A20) with C * : = G α R 2 ( C 1 + C 2 ) . Since Γ ( n ( 1 − α ) + 1 ) → ∞ super-exponentially relative to any fixed-base exponential, it follows that ∥ V n ∥ ∞ → ∞ → 0 .  □
Theorem A1 
(Uniqueness of the homogeneous Volterra equation). If F ∈ C ( [ 0 , R ] ) satisfies F = V F on [ 0 , R ] , then F ≡ 0 .
Proof. 
Iterate F = V F to obtain F = V n F for every n ∈ N . Hence
∥ F ∥ ∞ = ∥ V n F ∥ ∞ ≤ ∥ V n ∥ ∞ → ∞ ∥ F ∥ ∞ ≤ ( C * ) n Γ ( n ( 1 − α ) + 1 ) ∥ F ∥ ∞ .
Letting n → ∞ and using Lemma A6 forces ∥ F ∥ ∞ = 0 , hence F ≡ 0 .  □

Appendix A.5. Conclusion: Verification of the Weight Identity

Theorem A2 
(Verification of the weight identity). Let α ∈ ( 1 / 2 , 1 ) and R ∈ ( 0 , ∞ ) , and let w α be given by (A1). Assume g ∈ D α ( w α ) satisfies (A2). Then the identity
D R − α A B C x w α ( x ) g ( x ) + I R − 1 − α A B ( 1 − x ) w α ( x ) g ( x ) = w α ( x ) L [ g ] ( x ) for a . e . x ∈ ( 0 , R )
holds. Consequently, L is formally self-adjoint with respect to ⟨ · , · ⟩ w α on [ 0 , R ] under the admissibility assumptions of Section 2.4.
Proof. 
Fix g satisfying (A2) and form F g as in (A12). By Lemma A3, F g ∈ C ( [ 0 , R ] ) and F g = V [ F g ] on [ 0 , R ] . By Theorem A1, F g ≡ 0 , which is exactly (A21).  □
Remark A2. 
This appendix verifies the weight identity without any termwise coefficient matching. The argument relies only on: (i) the explicit right-sided decompositions (A5) and (A6), (ii) boundedness/continuity on C ( [ 0 , R ] ) (Lemmas A1 and A2), and (iii) uniqueness for the homogeneous right-Volterra equation (Theorem A1).

References

  1. Kilbas, A.A. Theory and Applications of Fractional Differential Equations; North-Holland Mathematics Studies, 204; Elsevier: Amsterdam, The Netherlands, 2006. [Google Scholar]
  2. Mainardi, F. Fractional Calculus and Waves in Linear Viscoelasticity: An Introduction to Mathematical Models; World Scientific: Singapore, 2022. [Google Scholar]
  3. Hilfer, R. (Ed.) Applications of Fractional Calculus in Physics; World Scientific: Singapore, 2000. [Google Scholar]
  4. Miller, K.S.; Ross, B. An Introduction to the Fractional Calculus and Fractional Differential Equations; John Wiley and Sons: New York, NY, USA, 1993. [Google Scholar]
  5. Podlubny, I. Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some of Their Applications; Elsevier: Amsterdam, The Netherlands, 1998; Volume 198. [Google Scholar]
  6. Cardone, A.; Donatelli, M.; Durastante, F.; Garrappa, R.; Mazza, M.; Popolizio, M. (Eds.) Fractional Differential Equations: Modeling, Discretization, and Numerical Solvers; Springer INdAM Series; Springer Nature: Cham, Switzerland, 2023; Volume 50. [Google Scholar]
  7. Moghaddam, B.P.; Machado, J.T.; Babaei, A. A computationally efficient method for tempered fractional differential equations with application. Comput. Appl. Math. 2018, 37, 3657–3671. [Google Scholar] [CrossRef] [Scilit]
  8. Tariq, M.; Ntouyas, S.K.; Shaikh, A.A. A comprehensive review of the Hermite–Hadamard inequality pertaining to fractional integral operators. Mathematics 2023, 11, 1953. [Google Scholar] [CrossRef] [Scilit]
  9. Baleanu, D.; Jajarmi, A.; Sajjadi, S.S.; Mozyrska, D. A new fractional model and optimal control of a tumor-immune surveillance with non-singular derivative operator. Chaos Interdiscip. J. Nonlinear Sci. 2019, 29, 083127. [Google Scholar] [CrossRef] [Scilit]
  10. Liu, F.; Burrage, K. Novel techniques in parameter estimation for fractional dynamical models arising from biological systems. Comput. Math. Appl. 2011, 62, 822–833. [Google Scholar] [CrossRef] [Scilit]
  11. Gorenflo, R.; Kilbas, A.A.; Mainardi, F.; Rogosin, S.V. Mittag-Leffler Functions, Related Topics and Applications; Springer: Berlin/Heidelberg, Germany, 2020. [Google Scholar]
  12. Atangana, A.; Baleanu, D. New fractional derivatives with nonlocal and non-singular kernel: Theory and application to heat transfer model. arXiv 2016, arXiv:1602.03408. [Google Scholar] [CrossRef] [Scilit]
  13. Atangana, A.; Gómez-Aguilar, J.F. Hyperchaotic behaviour obtained via a nonlocal operator with exponential decay and Mittag-Leffler laws. Chaos Solitons Fractals 2017, 102, 285–294. [Google Scholar] [CrossRef] [Scilit]
  14. Atangana, A.; Gómez-Aguilar, J.F. Fractional derivatives with no-index law property: Application to chaos and statistics. Chaos Solitons Fractals 2018, 114, 516–535. [Google Scholar] [CrossRef] [Scilit]
  15. Biolek, D.; Garrappa, R.; Mainardi, F.; Popolizio, M. Derivatives of Mittag-Leffler functions: Theory, computation and applications. Nonlinear Dyn. 2025, 113, 34389–34403. [Google Scholar] [CrossRef] [Scilit]
  16. Elbadri, M.; Abdoon, M.A.; Almutairi, D.K.; Almutairi, D.M.; Berir, M. Numerical simulation and solutions for the fractional Chen system via newly proposed methods. Fractal Fract. 2024, 8, 709. [Google Scholar] [CrossRef] [Scilit]
  17. Saad, K.M.; Khader, M.M.; Gómez-Aguilar, J.F.; Baleanu, D. Numerical solutions of the fractional Fisher’s type equations with Atangana-Baleanu fractional derivative by using spectral collocation methods. Chaos Interdiscip. J. Nonlinear Sci. 2019, 29, 023116. [Google Scholar] [CrossRef] [Scilit]
  18. Andrews, G.E.; Askey, R.; Roy, R.; Roy, R.; Askey, R. Special Functions; Cambridge University Press: Cambridge, UK, 1999; Volume 71. [Google Scholar]
  19. Chihara, T.S. An Introduction to Orthogonal Polynomials; Courier Corporation: North Chelmsford, MA, USA, 2011. [Google Scholar]
  20. Bethe, H.A.; Salpeter, E.E. Quantum Mechanics of One- and Two-Electron Atoms; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  21. Hou, D.; Xu, C. A fractional spectral method with applications to some singular problems. Adv. Comput. Math. 2017, 43, 911–944. [Google Scholar] [CrossRef] [Scilit]
  22. El-Sayed, A.M. Laguerre polynomials of arbitrary (fractional) orders. Appl. Math. Comput. 2000, 109, 1–9. [Google Scholar] [CrossRef] [Scilit]
  23. Goudarzian, N.; Dahaghin, M.S.; Hassani, H. Application of generalized Laguerre polynomials in solving fractional differential equations. Iran. J. Sci. 2025, 49, 1721–1731. [Google Scholar] [CrossRef] [Scilit]
  24. Deo, N.; Kumar, K.; Verma, D.K. Approximation by a new sequence of operators involving Laguerre polynomials. Filomat 2025, 39, 12345–12360. [Google Scholar]
  25. Abdelkawy, M.A.; Taha, T.M. An operational matrix of fractional derivatives of Laguerre polynomials. Walailak J. Sci. Technol. (WJST) 2014, 11, 1041–1055. [Google Scholar]
  26. 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]
  27. Abuasbeh, K.; Awadalla, M.; Sharif, A.A.; Balti, M. Construction and orthogonality of fractional Laguerre functions via the Caputo derivative. Rev. Int. Métodos Numér. Cálc. Diseño Ing. 2025, 41, 79. [Google Scholar] [CrossRef] [Scilit]
  28. 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]
  29. Diekema, E. The fractional orthogonal difference with applications. Mathematics 2015, 3, 487–509. [Google Scholar] [CrossRef] [Scilit]
  30. Chen, S.; Shen, J.; Wang, L.L. Generalized Jacobi functions and their applications to fractional differential equations. Math. Comput. 2016, 85, 1603–1638. [Google Scholar] [CrossRef] [Scilit]
  31. Kumar, D.; Singh, J.; Baleanu, D. A new fractional model for convective straight fins with temperature-dependent thermal conductivity. Therm. Sci. 2018, 22, 2791–2802. [Google Scholar] [CrossRef] [Scilit]
  32. Li, C.; Zeng, F. Numerical Methods for Fractional Calculus; CRC Press: Boca Raton, FL, USA, 2015. [Google Scholar]
  33. Lee, S. Numerical Methods and Applications of Fractional Differential Equations Involving Singular and Non-Singular Kernels. Ph.D. Thesis, Ulsan National Institute of Science and Technology (UNIST), Ulsan, Republic of Korea, 2021. [Google Scholar]
  34. Laskin, N. Fractional quantum mechanics and Lévy path integrals. Phys. Lett. A 2000, 268, 298–305. [Google Scholar] [CrossRef] [Scilit]
  35. Fathi, I.S.; El-Saeed, A.R.; Ardah, H.; Tawfik, M.; Hassan, G. Integrating fractional calculus memory effects and Laguerre polynomial in secretary bird optimization for gene expression feature selection. Mathematics 2025, 13, 3511. [Google Scholar] [CrossRef] [Scilit]
  36. Zaidi, D.; Talib, I.; Riaz, M.B.; Alam, M.N. Extending spectral methods to solve time fractional-order Bloch equations using generalized Laguerre polynomials. Partial. Differ. Equ. Appl. Math. 2025, 13, 101049. [Google Scholar] [CrossRef] [Scilit]
  37. Ayalew, M.; Ayalew, M.; Aychluh, M. Numerical approximation of space-fractional diffusion equation using Laguerre spectral collocation method. Int. J. Math. Ind. 2025, 17, 2450029. [Google Scholar] [CrossRef] [Scilit]
  38. Alatawi, M.S. A novel approach to explore Mittag-Leffler-Laguerre polynomials via symbolic method. J. Math. Anal. Appl. 2025, 556, 130104. [Google Scholar] [CrossRef] [Scilit]
  39. Kumar, M.; Raza, N.; Ramírez, W. On the theory and applications of q-Mittag-Leffler-Laguerre polynomials. Dolomites Res. Notes Approx. 2025, 18, 118–134. [Google Scholar]
  40. Pérez-Garza, J.A.; Oliva-Sanchez, P.; Aguilar-Marquez, R.; López-Aguayo, S. Unified fractional Laguerre–Gaussian beams. Opt. Lett. 2026, 51, 640–643. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  41. Muath, A.; Dalal, A. A generalized fractional Legendre-type differential equation involving the Atangana–Baleanu–Caputo derivative. Fractal Fract. 2026, 10, 54. [Google Scholar]
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.