Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 30 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 12 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

The Numerical Approximation of Caputo Fractional Derivative of Higher Orders Using A Shifted Gegenbauer Pseudospectral Method: Two-Point Boundary Value Problems of the Bagley Torvik Type Case Study (2501.17956v5)

Published 29 Jan 2025 in math.NA and cs.NA

Abstract: This work presents a new framework for approximating Caputo fractional derivatives (FDs) of any positive order using a shifted Gegenbauer pseudospectral (SGPS) method. By transforming the Caputo FD into a scaled integral of the $m$th-derivative of the Lagrange interpolating polynomial (with $m$ being the ceiling of the fractional order $\alpha$), we mitigate the singularity near zero, improving stability and accuracy. The method links $m$th-derivatives of shifted Gegenbauer (SG) polynomials with SG polynomials of lower degrees, allowing for precise integration using SG quadratures. We employ orthogonal collocation and SG quadratures in barycentric form to obtain an accurate and efficient approach for solving fractional differential equations. We provide error analysis showing that the SGPS method is convergent in a semi-analytic framework and conditionally convergent with exponential rate for smooth functions in finite-precision arithmetic. This exponential convergence improves accuracy compared to wavelet-based, operational matrix, and finite difference methods. The SGPS method is flexible, with adjustable SG parameters for optimal performance. A key contribution is the fractional SG integration matrix (FSGIM), which enables efficient computation of Caputo FDs via matrix-vector multiplications and accelerates the SGPS method through pre-computation and storage. The method remains within double-precision limits, making it computationally efficient. It handles any positive fractional order $\alpha$ and outperforms existing schemes in solving Caputo fractional two-point boundary value problems (TPBVPs) of the Bagley-Torvik type.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube