Table of Contents
Fetching ...

Iterative Procedure for Non-Linear Fractional Integro-Differential Equations via Daftardar--Jafari Polynomials

Qasim Khan, Anthony Suen

TL;DR

The paper tackles the challenge of solving non-linear FPIDEs with Caputo time derivatives by introducing the Iterative Aboodh Transform Method (IATM), which represents the solution as $u=\sum_{j=0}^{\infty} u_j$ and models the nonlinear term using Daftardar--Jafari polynomials $\mathbf{J}_j$. The method leverages the Aboodh transform $\mathcal{A}$ to operate in the Laplace domain, then inverts back to obtain a convergent series in the time domain. Numerical experiments on several FPIDEs demonstrate superior accuracy and faster convergence than Laplace-Adomian Decomposition Method (LADM), particularly for $\alpha\in(0.5,1]$, with fractional-order solutions approaching integer-order results as $\alpha\to1$. Implemented in MAPLE with GPU support, the approach shows promise for applications in heat flow with memory and viscoelastic phenomena, and suggests extensions to stochastic nonlinear FPIDEs in future work.

Abstract

In this paper, we introduce a novel approach called the Iterative Aboodh Transform Method (IATM) which utilizes Daftardar--Jafari polynomials for solving non-linear problems. Such method is employed to derive solutions for non-linear fractional partial integro-differential equations (FPIDEs). The key novelty of the suggested method is that it can be used for handling solutions of non-linear FPIDEs in a very simple and effective way. {More precisely, we show that Daftardar--Jafari polynomials have simple calculations as compared to Adomian polynomials with higher accuracy}. The results obtained within the Daftardar--Jafari polynomials are demonstrated with graphs and tables, and the IATM's absolute error confirms the higher accuracy of the suggested method.

Iterative Procedure for Non-Linear Fractional Integro-Differential Equations via Daftardar--Jafari Polynomials

TL;DR

The paper tackles the challenge of solving non-linear FPIDEs with Caputo time derivatives by introducing the Iterative Aboodh Transform Method (IATM), which represents the solution as and models the nonlinear term using Daftardar--Jafari polynomials . The method leverages the Aboodh transform to operate in the Laplace domain, then inverts back to obtain a convergent series in the time domain. Numerical experiments on several FPIDEs demonstrate superior accuracy and faster convergence than Laplace-Adomian Decomposition Method (LADM), particularly for , with fractional-order solutions approaching integer-order results as . Implemented in MAPLE with GPU support, the approach shows promise for applications in heat flow with memory and viscoelastic phenomena, and suggests extensions to stochastic nonlinear FPIDEs in future work.

Abstract

In this paper, we introduce a novel approach called the Iterative Aboodh Transform Method (IATM) which utilizes Daftardar--Jafari polynomials for solving non-linear problems. Such method is employed to derive solutions for non-linear fractional partial integro-differential equations (FPIDEs). The key novelty of the suggested method is that it can be used for handling solutions of non-linear FPIDEs in a very simple and effective way. {More precisely, we show that Daftardar--Jafari polynomials have simple calculations as compared to Adomian polynomials with higher accuracy}. The results obtained within the Daftardar--Jafari polynomials are demonstrated with graphs and tables, and the IATM's absolute error confirms the higher accuracy of the suggested method.

Paper Structure

This paper contains 6 sections, 35 equations, 6 figures, 3 tables.

Figures (6)

  • Figure 1: Comparison solution plots up to three terms approximation for Problem \ref{['TE2']}.
  • Figure 2: Comparison solution plots up to three terms approximation for Problem \ref{['TE2']} at $\alpha=1$.
  • Figure 3: Comparison solution plots up to three terms approximation for Problem \ref{['TE4']}.
  • Figure 4: Comparison solution plots up to three terms approximation for Problem \ref{['TE4']} at $\alpha=1$.
  • Figure 5: Comparison solution plots up to three terms approximation for Problem \ref{['TE1']}.
  • ...and 1 more figures

Theorems & Definitions (4)

  • Definition 1
  • Definition 2
  • Definition 3
  • Definition 4