Numerical Treatment of the Time-Fractional Kuramoto–Sivashinsky Equation Using a Combined Chebyshev-Collocation Approach

In this paper, we present a collocation algorithm for numerically treating the time-fractional Kuramoto–Sivashinsky equation (TFKSE). Certain orthogonal polynomials, which are expressed as combinations of Chebyshev polynomials, and their shifted polynomials are introduced. Some new theoretical formulas regarding these polynomials have been developed, including their operational matrices of both integer and fractional derivatives. The derived formulas will be the foundation for designing the proposed numerical algorithm, which relies on converting the governing problem with its underlying conditions into a nonlinear algebraic system, which can be solved using Newton’s iteration technique. A rigorous error analysis for the proposed combined Chebyshev expansion is presented. Some numerical examples are given to ensure the applicability and efficiency of the presented algorithm. These results demonstrate that the proposed algorithm attains superior accuracy with fewer expansion terms.

Authors

Institutions

Publication Details

Journal
Fractal and Fractional
Published
2025-11-10
DOI
https://doi.org/10.3390/fractalfract9110727
Citations
2
Primary Topic
Fractional Differential Equations Solutions
Type
article
Field-Weighted Citation Impact
2.74

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Numerical Treatment of the Time-Fractional Kuramoto–Sivashinsky Equation Using a Combined Chebyshev-Collocation Approach

Ahmed Gamal Atta, Waleed Mohamed Abd-Elhameed, M. A. Abdelkawy, Naher Mohammed A. Alsafri
2 citations
Fractal and Fractional
Fractional Differential Equations Solutions
2.74
article

Numerical Treatment of the Time-Fractional Kuramoto–Sivashinsky Equation Using a Combined Chebyshev-Collocation Approach

Ahmed Gamal Atta, Waleed Mohamed Abd-Elhameed, M. A. Abdelkawy, Naher Mohammed A. Alsafri
article en
2 citations

Abstract

In this paper, we present a collocation algorithm for numerically treating the time-fractional Kuramoto–Sivashinsky equation (TFKSE). Certain orthogonal polynomials, which are expressed as combinations of Chebyshev polynomials, and their shifted polynomials are introduced. Some new theoretical formulas regarding these polynomials have been developed, including their operational matrices of both integer and fractional derivatives. The derived formulas will be the foundation for designing the proposed numerical algorithm, which relies on converting the governing problem with its underlying conditions into a nonlinear algebraic system, which can be solved using Newton’s iteration technique. A rigorous error analysis for the proposed combined Chebyshev expansion is presented. Some numerical examples are given to ensure the applicability and efficiency of the presented algorithm. These results demonstrate that the proposed algorithm attains superior accuracy with fewer expansion terms.

Fractal and FractionalVol. 9(11)
Ain Shams University (EG), Cairo University (EG), Imam Mohammad ibn Saud Islamic University (SA), University of Jeddah (SA)
Al-Imam Muhammad Ibn Saud Islamic University
Openalex Percentile: Top 8%
Fractional Differential Equations Solutions
2.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.