This algorithm demonstrates improved accuracy in numerical solutions of the time-fractional Kuramoto-Sivashinsky equation, indicating potential use in complex systems.
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.
No takes yet. Share an insight, caveat, or question.
Abd-Elhameed et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: