Next Article in Journal
RU-OLD: A Comprehensive Analysis of Offensive Language Detection in Roman Urdu Using Hybrid Machine Learning, Deep Learning, and Transformer Models
Previous Article in Journal
A Survey of Visual SLAM Based on RGB-D Images Using Deep Learning and Comparative Study for VOE
Previous Article in Special Issue
General Position Subset Selection in Line Arrangements
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Super-Exponential Approximation of the Riemann–Liouville Fractional Integral via Gegenbauer-Based Fractional Approximation Methods

by
Kareem T. Elgindy
1,2
1
Department of Mathematics and Sciences, College of Humanities and Sciences, Ajman University, P.O. Box 346 Ajman, United Arab Emirates
2
Nonlinear Dynamics Research Center (NDRC), Ajman University, P.O. Box 346 Ajman, United Arab Emirates
Algorithms 2025, 18(7), 395; https://doi.org/10.3390/a18070395 (registering DOI)
Submission received: 24 May 2025 / Revised: 17 June 2025 / Accepted: 25 June 2025 / Published: 27 June 2025

Abstract

This paper introduces a Gegenbauer-based fractional approximation (GBFA) method for high-precision approximation of the left Riemann–Liouville fractional integral (RLFI). By using precomputable fractional-order shifted Gegenbauer integration matrices (FSGIMs), the method achieves super-exponential convergence for smooth functions, delivering near machine-precision accuracy with minimal computational cost. Tunable shifted Gegenbauer (SG) parameters enable flexible optimization across diverse problems, while rigorous error analysis confirms rapid error decay under optimal settings. Numerical experiments demonstrate that the GBFA method outperforms MATLAB’s integral, MATHEMATICA’s NIntegrate, and existing techniques by up to two orders of magnitude in accuracy, with superior efficiency for varying fractional orders 0<α<1. Its adaptability and precision make the GBFA method a transformative tool for fractional calculus, ideal for modeling complex systems with memory and non-local behavior.
Keywords: Riemann–Liouville fractional integral; shifted Gegenbauer polynomials; pseudospectral methods; super-exponential convergence; fractional-order integration matrix Riemann–Liouville fractional integral; shifted Gegenbauer polynomials; pseudospectral methods; super-exponential convergence; fractional-order integration matrix

Share and Cite

MDPI and ACS Style

Elgindy, K.T. Super-Exponential Approximation of the Riemann–Liouville Fractional Integral via Gegenbauer-Based Fractional Approximation Methods. Algorithms 2025, 18, 395. https://doi.org/10.3390/a18070395

AMA Style

Elgindy KT. Super-Exponential Approximation of the Riemann–Liouville Fractional Integral via Gegenbauer-Based Fractional Approximation Methods. Algorithms. 2025; 18(7):395. https://doi.org/10.3390/a18070395

Chicago/Turabian Style

Elgindy, Kareem T. 2025. "Super-Exponential Approximation of the Riemann–Liouville Fractional Integral via Gegenbauer-Based Fractional Approximation Methods" Algorithms 18, no. 7: 395. https://doi.org/10.3390/a18070395

APA Style

Elgindy, K. T. (2025). Super-Exponential Approximation of the Riemann–Liouville Fractional Integral via Gegenbauer-Based Fractional Approximation Methods. Algorithms, 18(7), 395. https://doi.org/10.3390/a18070395

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop